./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-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_6-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 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:19:45,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:19:45,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:19:45,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:19:45,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:19:45,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:19:45,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:19:45,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:19:45,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:19:45,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:19:45,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:19:45,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:19:45,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:19:45,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:19:45,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:19:45,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:19:45,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:19:45,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:19:45,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:19:45,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:19:45,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:19:45,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:19:45,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:19:45,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:19:45,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:19:45,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:19:45,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:19:45,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:19:45,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:19:45,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:19:45,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:19:45,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:19:45,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:19:45,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:19:45,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:19:45,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:19:45,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:19:45,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:19:45,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:19:45,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:19:45,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:19:45,619 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:45,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:19:45,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:19:45,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:19:45,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:19:45,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:19:45,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:19:45,645 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:19:45,645 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:19:45,645 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:19:45,645 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:19:45,646 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:19:45,646 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:19:45,646 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:19:45,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:19:45,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:19:45,647 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:19:45,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:19:45,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:19:45,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:19:45,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:19:45,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:19:45,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:19:45,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:19:45,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:19:45,649 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:19:45,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:19:45,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:19:45,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:19:45,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:19:45,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:19:45,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:19:45,651 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:19:45,651 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 -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2022-02-21 04:19:45,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:19:45,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:19:45,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:19:45,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:19:45,898 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:19:45,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2022-02-21 04:19:45,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f5258df/4a240aad0c024d8e926ab89d9d7153d0/FLAG1da0bf8dd [2022-02-21 04:19:46,340 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:19:46,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2022-02-21 04:19:46,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f5258df/4a240aad0c024d8e926ab89d9d7153d0/FLAG1da0bf8dd [2022-02-21 04:19:46,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f5258df/4a240aad0c024d8e926ab89d9d7153d0 [2022-02-21 04:19:46,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:19:46,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:19:46,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:46,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:19:46,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:19:46,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14269233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46, skipping insertion in model container [2022-02-21 04:19:46,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:19:46,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:19:46,569 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_6-2.c[946,959] [2022-02-21 04:19:46,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:46,583 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:19:46,597 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_6-2.c[946,959] [2022-02-21 04:19:46,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:46,609 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:19:46,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46 WrapperNode [2022-02-21 04:19:46,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:46,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:46,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:19:46,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:19:46,616 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:46" (1/1) ... [2022-02-21 04:19:46,621 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:46" (1/1) ... [2022-02-21 04:19:46,633 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 04:19:46,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:46,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:19:46,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:19:46,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:19:46,639 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:46" (1/1) ... [2022-02-21 04:19:46,639 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:46" (1/1) ... [2022-02-21 04:19:46,641 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:46" (1/1) ... [2022-02-21 04:19:46,641 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:46" (1/1) ... [2022-02-21 04:19:46,645 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:46" (1/1) ... [2022-02-21 04:19:46,649 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:46" (1/1) ... [2022-02-21 04:19:46,653 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:46" (1/1) ... [2022-02-21 04:19:46,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:19:46,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:19:46,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:19:46,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:19:46,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,689 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:46,696 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:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:19:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:19:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-21 04:19:46,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-21 04:19:46,731 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-21 04:19:46,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-21 04:19:46,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:19:46,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:19:46,772 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:19:46,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:19:46,901 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:19:46,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:19:46,923 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 04:19:46,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:46 BoogieIcfgContainer [2022-02-21 04:19:46,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:19:46,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:19:46,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:19:46,928 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:19:46,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:46,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:19:46" (1/3) ... [2022-02-21 04:19:46,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e098a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:46, skipping insertion in model container [2022-02-21 04:19:46,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:46,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (2/3) ... [2022-02-21 04:19:46,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e098a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:46, skipping insertion in model container [2022-02-21 04:19:46,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:46,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:46" (3/3) ... [2022-02-21 04:19:46,931 INFO L388 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_6-2.c [2022-02-21 04:19:46,984 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:19:46,992 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:19:46,992 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:19:46,992 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:19:46,992 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:19:46,992 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:19:46,993 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:19:46,993 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:19:47,012 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:47,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:47,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:47,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:47,039 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:47,039 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:47,039 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:19:47,040 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:47,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:47,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:47,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:47,052 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:47,052 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:47,057 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 := 6; 15#L39true call main_#t~ret8#1 := fibo1(main_~x~0#1);< 5#fibo1ENTRYtrue [2022-02-21 04:19:47,058 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:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2022-02-21 04:19:47,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:47,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786287976] [2022-02-21 04:19:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,175 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2022-02-21 04:19:47,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:47,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620994176] [2022-02-21 04:19:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,217 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2022-02-21 04:19:47,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:47,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808680061] [2022-02-21 04:19:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:47,264 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:47,534 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:47,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:47,535 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:47,535 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:47,536 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:47,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:47,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:47,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration1_Loop [2022-02-21 04:19:47,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:47,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:47,545 INFO L141 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,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:47,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:47,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:47,574 INFO L141 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,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:47,578 INFO L141 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,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:47,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:47,594 INFO L141 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,706 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:47,706 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:47,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,710 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:47,720 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:47,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,735 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,735 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:19:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,752 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:47,753 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:47,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,776 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,776 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:19:47,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,793 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:47,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:19:47,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,836 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:47,854 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:47,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,870 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:47,871 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:47,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,895 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:47,910 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:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,912 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:47,913 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:47,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,935 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,935 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:47,951 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:47,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,952 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:47,953 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:47,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,961 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:47,976 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:47,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,990 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:47,992 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:47,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,999 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,999 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,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:19:48,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,038 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:48,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,052 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:48,072 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:48,072 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,087 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:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,088 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:48,089 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:48,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:48,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,118 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:48,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,120 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:48,120 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:48,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:48,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:48,178 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:48,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:19:48,182 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:48,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:48,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:48,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:48,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:48,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:48,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:48,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration1_Loop [2022-02-21 04:19:48,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:48,182 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:48,183 INFO L141 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,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:19:48,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:19:48,200 INFO L141 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,205 INFO L141 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,207 INFO L141 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,209 INFO L141 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,215 INFO L141 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,217 INFO L141 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,221 INFO L141 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,307 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:48,310 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:48,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,312 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:48,313 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:48,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:48,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,366 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:48,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,367 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:48,368 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:48,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:48,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,394 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:48,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,396 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:48,397 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:48,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:48,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 04:19:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,428 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:48,429 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:48,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:48,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,472 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:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,474 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:48,474 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:48,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:48,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,524 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:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,526 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:48,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:48,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,552 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:48,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,588 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:48,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,590 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:48,600 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:48,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:48,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:48,643 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:48,643 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:48,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,657 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:48,678 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:48,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:48,679 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:48,679 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:48,679 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2022-02-21 04:19:48,694 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:48,701 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:48,704 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:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:48,749 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:48,750 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 := 6; {36#unseeded} is VALID [2022-02-21 04:19:48,751 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:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:48,884 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:48,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(~n < 1); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:48,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(1 == ~n); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:48,886 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:48,887 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:48,887 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:48,887 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:48,888 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:48,888 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:48,907 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:48,917 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:48,918 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:48,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,922 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:48,923 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:48,976 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:49,196 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:49,197 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:49,197 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:49,197 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:49,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,200 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:49,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:49,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 116 transitions. [2022-02-21 04:19:49,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,207 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:49,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,211 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:49,212 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:49,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:49,213 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:49,213 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:49,219 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:49,219 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:49,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,219 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:49,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,220 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:49,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,220 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:49,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,221 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:49,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,221 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:49,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,221 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:49,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,222 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:49,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,222 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:49,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,223 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:49,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,223 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:49,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,223 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:49,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,224 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:49,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,224 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:49,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,224 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:49,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,225 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:49,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,225 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:49,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,225 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:49,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,225 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:49,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,226 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:49,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,226 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:49,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,227 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:49,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,227 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:49,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,227 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:49,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,228 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:49,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,228 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:49,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,228 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:49,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,229 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:49,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,229 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:49,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,230 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:49,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,230 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:49,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,231 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:49,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,231 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:49,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,231 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:49,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,232 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:49,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,232 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:49,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,233 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:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,233 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:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,233 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:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,234 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:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,234 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:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,235 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:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,235 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:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,236 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:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,236 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:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,236 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:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,237 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:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,237 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:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,237 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:49,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,238 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:49,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,238 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:49,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,238 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:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,239 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:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,239 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:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,240 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:49,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,240 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:49,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,240 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:49,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,240 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:49,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,241 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:49,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,241 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:49,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,241 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:49,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,242 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:49,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,242 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:49,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,242 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:49,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,243 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:49,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,243 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:49,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,243 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:49,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,244 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:49,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,244 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:49,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,244 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:49,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,245 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:49,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,245 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:49,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,245 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:49,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,246 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:49,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,246 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:49,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,246 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:49,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,246 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:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,247 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:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,247 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:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,247 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:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,248 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:49,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,248 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:49,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,248 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:49,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,248 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:49,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,249 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:49,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,249 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:49,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,249 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:49,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,250 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:49,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,250 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:49,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,250 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:49,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,251 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:49,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,251 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:49,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,251 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:49,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,252 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:49,255 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:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-21 04:19:49,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:49,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:19:49,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2022-02-21 04:19:49,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:49,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:49,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2022-02-21 04:19:49,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 04:19:49,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-02-21 04:19:49,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2022-02-21 04:19:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:49,270 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-02-21 04:19:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2022-02-21 04:19:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2022-02-21 04:19:49,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:49,288 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:49,289 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:49,290 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:49,293 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,300 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2022-02-21 04:19:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2022-02-21 04:19:49,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,302 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:49,303 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:49,304 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,312 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2022-02-21 04:19:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2022-02-21 04:19:49,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:49,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:49,314 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:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-02-21 04:19:49,317 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:49,317 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:49,317 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:19:49,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2022-02-21 04:19:49,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,319 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:49,319 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:49,319 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 := 6; 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:49,319 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:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2022-02-21 04:19:49,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:49,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847411320] [2022-02-21 04:19:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,380 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:49,380 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:49,381 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:49,381 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:49,382 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 := 6; {743#true} is VALID [2022-02-21 04:19:49,382 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:49,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:49,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {743#true} assume !(~n < 1); {743#true} is VALID [2022-02-21 04:19:49,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} assume !(1 == ~n); {743#true} is VALID [2022-02-21 04:19:49,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {743#true} call #t~ret4 := fibo2(~n - 1); {743#true} is VALID [2022-02-21 04:19:49,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:49,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#true} assume !(~n < 1); {745#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:49,383 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:49,383 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:49,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,384 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:49,385 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:49,385 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:49,385 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:49,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:49,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847411320] [2022-02-21 04:19:49,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847411320] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:49,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:49,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:49,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456117656] [2022-02-21 04:19:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:49,388 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2022-02-21 04:19:49,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:49,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387002293] [2022-02-21 04:19:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,426 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:49,426 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:49,427 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:49,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call #t~ret7 := fibo1(~n - 2); {753#true} is VALID [2022-02-21 04:19:49,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:49,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume !(~n < 1); {753#true} is VALID [2022-02-21 04:19:49,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#true} assume !(1 == ~n); {753#true} is VALID [2022-02-21 04:19:49,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret4 := fibo2(~n - 1); {753#true} is VALID [2022-02-21 04:19:49,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:49,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume !(~n < 1); {755#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:49,429 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:49,429 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:49,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,430 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:49,430 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:49,431 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:49,431 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:49,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:49,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387002293] [2022-02-21 04:19:49,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387002293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:49,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:49,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:49,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583287002] [2022-02-21 04:19:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:49,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:49,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:19:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:19:49,435 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:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:49,570 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-02-21 04:19:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:19:49,571 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:49,581 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:49,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2022-02-21 04:19:49,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2022-02-21 04:19:49,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-02-21 04:19:49,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 04:19:49,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2022-02-21 04:19:49,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:49,588 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-02-21 04:19:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2022-02-21 04:19:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-02-21 04:19:49,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:49,592 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:49,592 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:49,592 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:49,593 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,599 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:49,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,601 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:49,601 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:49,601 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,607 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:49,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:49,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:49,609 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:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-02-21 04:19:49,610 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:49,610 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:49,610 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:19:49,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2022-02-21 04:19:49,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,612 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:49,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:49,612 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 := 6; 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:49,612 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:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2022-02-21 04:19:49,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:49,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455052861] [2022-02-21 04:19:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,678 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:49,678 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:49,678 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:49,679 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 5 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,679 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:49,680 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 := 6; {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:49,680 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(~n < 1); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(1 == ~n); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:49,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(~n < 1); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(1 == ~n); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,683 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:49,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,684 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:49,684 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:49,685 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:49,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 5 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,685 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:49,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:49,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455052861] [2022-02-21 04:19:49,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455052861] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:49,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202215037] [2022-02-21 04:19:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:49,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,695 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:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:49,731 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:49,825 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:49,826 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 := 6; {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:49,826 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(~n < 1); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(1 == ~n); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:49,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(~n < 1); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(1 == ~n); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:49,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1446#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:49,830 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:49,830 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:49,831 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:49,831 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 5 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,831 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:49,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:50,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1459#(< 2 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:50,035 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:50,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {1469#(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:50,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume !(~n < 1); {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:50,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:50,037 INFO L272 TraceCheckUtils]: 10: Hoare triple {1459#(< 2 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:50,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {1459#(< 2 fibo2_~n)} assume !(1 == ~n); {1459#(< 2 fibo2_~n)} is VALID [2022-02-21 04:19:50,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {1459#(< 2 fibo2_~n)} assume !(~n < 1); {1459#(< 2 fibo2_~n)} is VALID [2022-02-21 04:19:50,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {1485#(< 2 |fibo2_#in~n|)} ~n := #in~n; {1459#(< 2 fibo2_~n)} is VALID [2022-02-21 04:19:50,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {1489#(< 3 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1485#(< 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:50,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {1489#(< 3 fibo1_~n)} assume !(1 == ~n); {1489#(< 3 fibo1_~n)} is VALID [2022-02-21 04:19:50,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {1489#(< 3 fibo1_~n)} assume !(~n < 1); {1489#(< 3 fibo1_~n)} is VALID [2022-02-21 04:19:50,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {1499#(< 3 |fibo1_#in~n|)} ~n := #in~n; {1489#(< 3 fibo1_~n)} is VALID [2022-02-21 04:19:50,047 INFO L272 TraceCheckUtils]: 2: Hoare triple {1503#(< 3 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1499#(< 3 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:50,047 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 := 6; {1503#(< 3 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:50,048 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:50,048 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,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202215037] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:50,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:50,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 04:19:50,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002106377] [2022-02-21 04:19:50,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:50,049 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2022-02-21 04:19:50,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:50,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477023658] [2022-02-21 04:19:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:50,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:50,063 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:50,307 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:50,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:50,308 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:50,308 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:50,308 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:50,308 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:50,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:50,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration3_Loop [2022-02-21 04:19:50,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:50,309 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:50,309 INFO L141 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:50,312 INFO L141 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:50,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:50,315 INFO L141 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:50,317 INFO L141 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:50,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:50,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:50,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:50,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:50,399 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:50,399 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:50,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,400 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:50,401 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:50,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,424 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:50,439 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:50,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,440 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:50,441 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:50,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,443 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,448 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,449 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:50,464 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:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,465 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:50,468 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:50,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,479 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,480 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:50,496 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:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,498 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:50,501 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:50,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,508 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,508 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:50,523 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:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,527 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:50,529 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:50,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,536 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,536 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:50,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:19:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,564 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:50,565 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:50,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,596 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,596 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:50,613 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:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,615 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:50,630 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:50,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,638 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,638 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:50,652 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:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,654 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:50,656 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:50,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:19:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,680 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:50,681 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:50,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:50,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:51,577 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:51,581 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:51,581 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:51,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:51,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:51,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:51,581 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:51,581 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,581 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:51,581 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:51,581 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration3_Loop [2022-02-21 04:19:51,581 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:51,581 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:51,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:51,584 INFO L141 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:51,586 INFO L141 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:51,588 INFO L141 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:51,590 INFO L141 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:51,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:51,593 INFO L141 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:51,599 INFO L141 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:51,601 INFO L141 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:51,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:51,682 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:51,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,695 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:51,696 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:51,697 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:51,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,746 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:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,748 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:51,749 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:51,750 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:51,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,776 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:51,777 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:51,778 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:51,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:19:51,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,802 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:51,802 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:51,804 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:51,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,842 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:51,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,843 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:51,844 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:51,845 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:51,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,881 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:51,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,883 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:51,904 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:51,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,914 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:51,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,948 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:51,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,950 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:51,966 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:51,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,973 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:51,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:51,999 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:51,999 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:51,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:52,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:52,001 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:52,016 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:52,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:52,017 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:52,017 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:52,017 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2022-02-21 04:19:52,035 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:52,040 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:52,042 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:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:52,183 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:52,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1509#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); {1509#unseeded} is VALID [2022-02-21 04:19:52,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {1509#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 := 6; {1509#unseeded} is VALID [2022-02-21 04:19:52,197 INFO L272 TraceCheckUtils]: 2: Hoare triple {1509#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1509#unseeded} is VALID [2022-02-21 04:19:52,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {1509#unseeded} ~n := #in~n; {1509#unseeded} is VALID [2022-02-21 04:19:52,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {1509#unseeded} assume !(~n < 1); {1509#unseeded} is VALID [2022-02-21 04:19:52,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {1509#unseeded} assume !(1 == ~n); {1509#unseeded} is VALID [2022-02-21 04:19:52,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {1509#unseeded} call #t~ret4 := fibo2(~n - 1); {1509#unseeded} is VALID [2022-02-21 04:19:52,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#unseeded} ~n := #in~n; {1509#unseeded} is VALID [2022-02-21 04:19:52,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {1509#unseeded} assume !(~n < 1); {1509#unseeded} is VALID [2022-02-21 04:19:52,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1509#unseeded} assume !(1 == ~n); {1509#unseeded} is VALID [2022-02-21 04:19:52,201 INFO L272 TraceCheckUtils]: 10: Hoare triple {1509#unseeded} call #t~ret6 := fibo1(~n - 1); {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:52,206 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1509#unseeded} #46#return; {1509#unseeded} is VALID [2022-02-21 04:19:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:19:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:52,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:52,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {1512#(>= oldRank0 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {1573#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:19:52,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {1573#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {1577#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:52,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1577#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {1577#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:52,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {1577#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {1577#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:52,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {1577#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret4 := fibo2(~n - 1); {1587#(<= (+ 3 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:19:52,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {1587#(<= (+ 3 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {1591#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:52,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {1591#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {1591#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:52,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {1591#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {1591#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:52,469 INFO L272 TraceCheckUtils]: 8: Hoare triple {1591#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret6 := fibo1(~n - 1); {1601#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:19:52,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {1605#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {1605#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,471 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {1591#(<= (+ fibo2_~n 3) oldRank0)} #46#return; {1522#(or (and (>= oldRank0 0) (> oldRank0 fibo2_~n)) unseeded)} is VALID [2022-02-21 04:19:52,472 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:52,472 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:52,502 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:52,502 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:52,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,502 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:52,503 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:53,371 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:53,371 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:53,371 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:53,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:53,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,372 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:53,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:53,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 263 transitions. [2022-02-21 04:19:53,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:53,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,382 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:53,386 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 04:19:53,386 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:53,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:53,388 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:53,388 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:53,398 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:53,398 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:53,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,398 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:53,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,399 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:53,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,399 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:53,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,399 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:53,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,399 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:53,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,400 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:53,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,400 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:53,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,400 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:53,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,400 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:53,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,400 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:53,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,401 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:53,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,401 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:53,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,401 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:53,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,401 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:53,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,401 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:53,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,405 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:53,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,405 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:53,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,405 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:53,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,406 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:53,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,407 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:53,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,407 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:53,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,408 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:53,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,409 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:53,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,409 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:53,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,409 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:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,410 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:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,410 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:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,410 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:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,410 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:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,410 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:53,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,410 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:53,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,411 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:53,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,411 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:53,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,411 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:53,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,411 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:53,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,411 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:53,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,412 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:53,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,412 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:53,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,412 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:53,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,412 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:53,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,412 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:53,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,412 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:53,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,413 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:53,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,413 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:53,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,413 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:53,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,413 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:53,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,414 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:53,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,414 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:53,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,414 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:53,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,414 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:53,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,414 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:53,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,415 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:53,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,415 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:53,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,415 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:53,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,415 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:53,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,416 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:53,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,416 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:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 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:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 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:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,417 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:53,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 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:53,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 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:53,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,418 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:53,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,419 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:53,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,419 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,420 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:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 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:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 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:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 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:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,421 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:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,423 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,424 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:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,425 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,426 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:53,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,427 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:53,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,428 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:53,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,428 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:53,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,428 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:53,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,428 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:53,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,428 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:53,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,428 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:53,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,429 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:53,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,430 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:53,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,430 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:53,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,430 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:53,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,430 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:53,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,430 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:53,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,431 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:53,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,431 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:53,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,431 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:53,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,431 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:53,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 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:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 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:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 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:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 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:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 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:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,432 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:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 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:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 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:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 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:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 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:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 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:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,433 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:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,434 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:53,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,434 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:53,435 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:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:53,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 30 letters. Loop has 14 letters. [2022-02-21 04:19:53,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 28 letters. [2022-02-21 04:19:53,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:53,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:53,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2022-02-21 04:19:53,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-02-21 04:19:53,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2022-02-21 04:19:53,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2022-02-21 04:19:53,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:53,457 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2022-02-21 04:19:53,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2022-02-21 04:19:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2022-02-21 04:19:53,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:53,479 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:53,479 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:53,479 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:53,480 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:53,499 INFO L93 Difference]: Finished difference Result 364 states and 492 transitions. [2022-02-21 04:19:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2022-02-21 04:19:53,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:53,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:53,502 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:53,502 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:53,503 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:53,524 INFO L93 Difference]: Finished difference Result 390 states and 526 transitions. [2022-02-21 04:19:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 526 transitions. [2022-02-21 04:19:53,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:53,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:53,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:53,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:53,526 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:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2022-02-21 04:19:53,530 INFO L704 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2022-02-21 04:19:53,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:19:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:19:53,531 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:53,984 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2022-02-21 04:19:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 04:19:53,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:54,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:54,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 276 transitions. [2022-02-21 04:19:54,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:54,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 200 states and 267 transitions. [2022-02-21 04:19:54,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2022-02-21 04:19:54,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2022-02-21 04:19:54,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 267 transitions. [2022-02-21 04:19:54,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:54,018 INFO L681 BuchiCegarLoop]: Abstraction has 200 states and 267 transitions. [2022-02-21 04:19:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 267 transitions. [2022-02-21 04:19:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2022-02-21 04:19:54,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:54,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states and 267 transitions. Second operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:54,037 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states and 267 transitions. Second operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:54,037 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:54,038 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:54,056 INFO L93 Difference]: Finished difference Result 449 states and 615 transitions. [2022-02-21 04:19:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 615 transitions. [2022-02-21 04:19:54,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:54,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:54,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) Second operand 200 states and 267 transitions. [2022-02-21 04:19:54,060 INFO L87 Difference]: Start difference. First operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) Second operand 200 states and 267 transitions. [2022-02-21 04:19:54,061 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:54,078 INFO L93 Difference]: Finished difference Result 449 states and 615 transitions. [2022-02-21 04:19:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 615 transitions. [2022-02-21 04:19:54,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:54,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:54,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:54,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 249 transitions. [2022-02-21 04:19:54,085 INFO L704 BuchiCegarLoop]: Abstraction has 185 states and 249 transitions. [2022-02-21 04:19:54,085 INFO L587 BuchiCegarLoop]: Abstraction has 185 states and 249 transitions. [2022-02-21 04:19:54,085 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:19:54,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. [2022-02-21 04:19:54,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:54,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:54,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:54,086 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:54,086 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:54,087 INFO L791 eck$LassoCheckResult]: Stem: 3543#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); 3544#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 := 6; 3577#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 3610#fibo1ENTRY ~n := #in~n; 3649#L10 assume !(~n < 1); 3648#L12 assume !(1 == ~n); 3562#L15 call #t~ret4 := fibo2(~n - 1);< 3647#fibo2ENTRY ~n := #in~n; 3646#L20 assume !(~n < 1); 3645#L22 assume !(1 == ~n); 3573#L25 call #t~ret6 := fibo1(~n - 1);< 3572#fibo1ENTRY ~n := #in~n; 3574#L10 assume !(~n < 1); 3592#L12 assume !(1 == ~n); 3582#L15 call #t~ret4 := fibo2(~n - 1);< 3597#fibo2ENTRY ~n := #in~n; 3604#L20 assume !(~n < 1); 3605#L22 assume !(1 == ~n); 3579#L25 call #t~ret6 := fibo1(~n - 1);< 3643#fibo1ENTRY ~n := #in~n; 3644#L10 assume !(~n < 1); 3654#L12 assume !(1 == ~n); 3655#L15 call #t~ret4 := fibo2(~n - 1);< 3663#fibo2ENTRY ~n := #in~n; 3667#L20 assume ~n < 1;#res := 0; 3666#fibo2FINAL assume true; 3662#fibo2EXIT >#50#return; 3659#L15-1 call #t~ret5 := fibo2(~n - 2);< 3660#fibo2ENTRY ~n := #in~n; 3664#L20 assume ~n < 1;#res := 0; 3661#fibo2FINAL assume true; 3658#fibo2EXIT >#52#return; 3656#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3657#fibo1FINAL assume true; 3723#fibo1EXIT >#46#return; 3555#L25-1 call #t~ret7 := fibo1(~n - 2);< 3642#fibo1ENTRY ~n := #in~n; 3676#L10 assume ~n < 1;#res := 0; 3554#fibo1FINAL assume true; 3557#fibo1EXIT >#48#return; 3575#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 3583#fibo2FINAL assume true; 3593#fibo2EXIT >#50#return; 3546#L15-1 call #t~ret5 := fibo2(~n - 2);< 3580#fibo2ENTRY [2022-02-21 04:19:54,087 INFO L793 eck$LassoCheckResult]: Loop: 3580#fibo2ENTRY ~n := #in~n; 3669#L20 assume !(~n < 1); 3545#L22 assume !(1 == ~n); 3550#L25 call #t~ret6 := fibo1(~n - 1);< 3563#fibo1ENTRY ~n := #in~n; 3571#L10 assume !(~n < 1); 3590#L12 assume !(1 == ~n); 3548#L15 call #t~ret4 := fibo2(~n - 1);< 3580#fibo2ENTRY [2022-02-21 04:19:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash -960039395, now seen corresponding path program 1 times [2022-02-21 04:19:54,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:54,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067357917] [2022-02-21 04:19:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:19:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:54,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:54,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume !(~n < 1); {5372#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:54,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {5372#(< 0 fibo1_~n)} assume !(1 == ~n); {5373#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:54,184 INFO L272 TraceCheckUtils]: 3: Hoare triple {5373#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:54,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,185 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,185 INFO L272 TraceCheckUtils]: 8: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,186 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:54,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {5323#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5323#false} is VALID [2022-02-21 04:19:54,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:54,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5323#false} {5322#true} #46#return; {5323#false} is VALID [2022-02-21 04:19:54,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 04:19:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5322#true} {5323#false} #48#return; {5323#false} is VALID [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L272 TraceCheckUtils]: 3: Hoare triple {5322#true} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#true} assume !(~n < 1); {5372#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:54,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {5372#(< 0 fibo1_~n)} assume !(1 == ~n); {5373#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:54,190 INFO L272 TraceCheckUtils]: 7: Hoare triple {5373#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:54,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,191 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,191 INFO L272 TraceCheckUtils]: 12: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {5323#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5323#false} {5322#true} #46#return; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L272 TraceCheckUtils]: 20: Hoare triple {5323#false} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,192 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5322#true} {5323#false} #48#return; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {5323#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:54,192 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5323#false} {5322#true} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#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); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#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 := 6; {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L272 TraceCheckUtils]: 2: Hoare triple {5322#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {5322#true} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L272 TraceCheckUtils]: 10: Hoare triple {5322#true} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L272 TraceCheckUtils]: 14: Hoare triple {5322#true} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:54,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:54,194 INFO L272 TraceCheckUtils]: 18: Hoare triple {5322#true} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {5322#true} assume !(~n < 1); {5372#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:54,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {5372#(< 0 fibo1_~n)} assume !(1 == ~n); {5373#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:54,194 INFO L272 TraceCheckUtils]: 22: Hoare triple {5373#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:54,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,196 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,196 INFO L272 TraceCheckUtils]: 27: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,196 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {5323#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5323#false} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:54,196 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5323#false} {5322#true} #46#return; {5323#false} is VALID [2022-02-21 04:19:54,196 INFO L272 TraceCheckUtils]: 35: Hoare triple {5323#false} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,197 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5322#true} {5323#false} #48#return; {5323#false} is VALID [2022-02-21 04:19:54,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {5323#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5323#false} is VALID [2022-02-21 04:19:54,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:54,197 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5323#false} {5322#true} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,197 INFO L272 TraceCheckUtils]: 43: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5323#false} is VALID [2022-02-21 04:19:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-21 04:19:54,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:54,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067357917] [2022-02-21 04:19:54,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067357917] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:54,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105965562] [2022-02-21 04:19:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:54,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:54,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:54,198 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:54,225 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:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:19:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:54,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:54,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#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); {5322#true} is VALID [2022-02-21 04:19:54,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#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 := 6; {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:54,571 INFO L272 TraceCheckUtils]: 2: Hoare triple {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5394#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:54,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {5394#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:54,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(~n < 1); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:54,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(1 == ~n); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:54,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {5398#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5408#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:54,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {5408#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:54,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(~n < 1); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:54,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(1 == ~n); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:54,578 INFO L272 TraceCheckUtils]: 10: Hoare triple {5412#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5422#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:54,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {5422#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:54,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(~n < 1); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:54,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(1 == ~n); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:54,580 INFO L272 TraceCheckUtils]: 14: Hoare triple {5426#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} ~n := #in~n; {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,582 INFO L272 TraceCheckUtils]: 18: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#true} ~n := #in~n; {5452#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:54,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {5452#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {5452#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:54,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {5452#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {5452#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:54,583 INFO L272 TraceCheckUtils]: 22: Hoare triple {5452#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} ~n := #in~n; {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,590 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5452#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,590 INFO L272 TraceCheckUtils]: 27: Hoare triple {5474#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,591 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5322#true} {5474#(<= |fibo1_#in~n| 1)} #52#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {5474#(<= |fibo1_#in~n| 1)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {5474#(<= |fibo1_#in~n| 1)} assume true; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,596 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5474#(<= |fibo1_#in~n| 1)} {5439#(<= |fibo2_#in~n| fibo2_~n)} #46#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,596 INFO L272 TraceCheckUtils]: 35: Hoare triple {5499#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,597 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5322#true} {5499#(<= |fibo2_#in~n| 2)} #48#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {5499#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {5499#(<= |fibo2_#in~n| 2)} assume true; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,598 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5499#(<= |fibo2_#in~n| 2)} {5426#(<= 4 fibo1_~n)} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,598 INFO L272 TraceCheckUtils]: 43: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5323#false} is VALID [2022-02-21 04:19:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 04:19:54,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:55,598 INFO L272 TraceCheckUtils]: 43: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5323#false} is VALID [2022-02-21 04:19:55,598 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5499#(<= |fibo2_#in~n| 2)} {5426#(<= 4 fibo1_~n)} #50#return; {5323#false} is VALID [2022-02-21 04:19:55,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {5499#(<= |fibo2_#in~n| 2)} assume true; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {5499#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,599 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5322#true} {5499#(<= |fibo2_#in~n| 2)} #48#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:55,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:55,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:55,600 INFO L272 TraceCheckUtils]: 35: Hoare triple {5499#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:55,601 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5474#(<= |fibo1_#in~n| 1)} {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #46#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {5474#(<= |fibo1_#in~n| 1)} assume true; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {5474#(<= |fibo1_#in~n| 1)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,602 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5322#true} {5474#(<= |fibo1_#in~n| 1)} #52#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:55,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:55,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:55,602 INFO L272 TraceCheckUtils]: 27: Hoare triple {5474#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:55,603 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} #50#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:55,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {5595#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:55,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} ~n := #in~n; {5595#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} is VALID [2022-02-21 04:19:55,604 INFO L272 TraceCheckUtils]: 22: Hoare triple {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:55,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(1 == ~n); {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:55,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(~n < 1); {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:55,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#true} ~n := #in~n; {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:55,605 INFO L272 TraceCheckUtils]: 18: Hoare triple {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:55,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:55,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:55,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} ~n := #in~n; {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:55,606 INFO L272 TraceCheckUtils]: 14: Hoare triple {5426#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:55,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(1 == ~n); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:55,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(~n < 1); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:55,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {5422#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:55,608 INFO L272 TraceCheckUtils]: 10: Hoare triple {5412#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5422#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:55,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(1 == ~n); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:55,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(~n < 1); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:55,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {5408#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:55,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {5398#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5408#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:55,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(1 == ~n); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:55,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(~n < 1); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:55,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {5394#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:55,611 INFO L272 TraceCheckUtils]: 2: Hoare triple {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5394#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:55,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#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 := 6; {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:55,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#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); {5322#true} is VALID [2022-02-21 04:19:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:19:55,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105965562] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:55,612 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:55,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 20 [2022-02-21 04:19:55,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693866852] [2022-02-21 04:19:55,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:55,612 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2022-02-21 04:19:55,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:55,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725972654] [2022-02-21 04:19:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:55,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:55,620 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:55,749 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:55,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:55,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:55,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:55,750 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:55,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:55,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:55,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration4_Loop [2022-02-21 04:19:55,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:55,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:55,751 INFO L141 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:55,753 INFO L141 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:55,755 INFO L141 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:55,756 INFO L141 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:55,758 INFO L141 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:55,763 INFO L141 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:55,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:55,766 INFO L141 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:55,767 INFO L141 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:55,769 INFO L141 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:55,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:55,831 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:55,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,856 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:55,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,865 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,865 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:55,879 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:55,883 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:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,885 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:55,887 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:55,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,904 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,905 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:55,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,939 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:55,940 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:55,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,948 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:55,963 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:55,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,965 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:55,966 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:55,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,974 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:55,989 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:55,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,991 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:55,992 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:55,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:56,013 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:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,015 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:56,016 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:56,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:56,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:56,044 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:56,046 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:56,047 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:56,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:56,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:56,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:56,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:56,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:56,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:56,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration4_Loop [2022-02-21 04:19:56,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:56,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:56,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:56,051 INFO L141 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:56,052 INFO L141 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:56,054 INFO L141 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:56,056 INFO L141 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:56,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:56,065 INFO L141 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:56,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:56,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:56,075 INFO L141 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:56,157 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:56,157 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,159 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:56,160 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:56,161 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:56,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:56,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:56,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:56,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:56,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:56,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:56,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:56,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:56,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,199 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:56,201 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:56,201 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:56,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:56,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:56,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:56,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:56,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:56,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:56,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:56,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:56,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,240 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:56,241 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:56,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:56,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:56,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:56,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:56,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:56,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:56,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:56,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:56,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:56,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 04:19:56,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,269 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:56,270 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:56,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:19:56,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:56,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:56,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:56,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:56,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:56,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:56,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:56,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:56,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 04:19:56,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,294 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:56,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:19:56,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:19:56,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:56,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:56,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:56,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:56,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:56,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:56,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:56,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:56,306 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:19:56,306 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:19:56,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:56,308 INFO L229 MonitoredProcess]: Starting monitored process 50 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:56,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:19:56,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:56,310 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:56,310 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:56,310 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2022-02-21 04:19:56,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:56,328 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:56,329 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:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:19:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:56,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {5658#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); {5658#unseeded} is VALID [2022-02-21 04:19:56,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#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 := 6; {5658#unseeded} is VALID [2022-02-21 04:19:56,745 INFO L272 TraceCheckUtils]: 2: Hoare triple {5658#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5658#unseeded} is VALID [2022-02-21 04:19:56,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:56,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:56,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:56,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:56,747 INFO L272 TraceCheckUtils]: 10: Hoare triple {5658#unseeded} call #t~ret6 := fibo1(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:56,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:56,751 INFO L272 TraceCheckUtils]: 14: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,753 INFO L272 TraceCheckUtils]: 18: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,754 INFO L272 TraceCheckUtils]: 22: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,757 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,757 INFO L272 TraceCheckUtils]: 27: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,759 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,761 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,761 INFO L272 TraceCheckUtils]: 35: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,763 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,765 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5658#unseeded} #50#return; {5658#unseeded} is VALID [2022-02-21 04:19:56,765 INFO L272 TraceCheckUtils]: 43: Hoare triple {5658#unseeded} call #t~ret5 := fibo2(~n - 2); {5658#unseeded} is VALID [2022-02-21 04:19:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:56,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {5661#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {5806#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:56,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {5806#(<= fibo2_~n oldRank0)} assume !(~n < 1); {5806#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:56,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {5806#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {5806#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:56,891 INFO L272 TraceCheckUtils]: 3: Hoare triple {5806#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {5816#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:56,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {5816#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {5820#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:56,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {5820#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,893 INFO L272 TraceCheckUtils]: 7: Hoare triple {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5671#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:56,893 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:56,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,924 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:19:56,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,925 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:56,925 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:57,237 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 691 states and 965 transitions. Complement of second has 26 states. [2022-02-21 04:19:57,237 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:57,237 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:57,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:57,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:57,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 691 states and 965 transitions. [2022-02-21 04:19:57,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:57,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,242 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:57,248 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:57,248 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:57,249 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:57,249 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 691 states and 965 transitions. cyclomatic complexity: 290 [2022-02-21 04:19:57,256 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:57,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:57,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:57,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:57,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:57,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:57,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,314 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,327 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {5658#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); {5658#unseeded} is VALID [2022-02-21 04:19:57,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#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 := 6; {5658#unseeded} is VALID [2022-02-21 04:19:57,724 INFO L272 TraceCheckUtils]: 2: Hoare triple {5658#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5658#unseeded} is VALID [2022-02-21 04:19:57,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,728 INFO L272 TraceCheckUtils]: 10: Hoare triple {5658#unseeded} call #t~ret6 := fibo1(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,729 INFO L272 TraceCheckUtils]: 14: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,731 INFO L272 TraceCheckUtils]: 18: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,732 INFO L272 TraceCheckUtils]: 22: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,734 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,735 INFO L272 TraceCheckUtils]: 27: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,736 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,738 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,738 INFO L272 TraceCheckUtils]: 35: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,741 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,742 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5658#unseeded} #50#return; {5658#unseeded} is VALID [2022-02-21 04:19:57,743 INFO L272 TraceCheckUtils]: 43: Hoare triple {5658#unseeded} call #t~ret5 := fibo2(~n - 2); {5658#unseeded} is VALID [2022-02-21 04:19:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {5661#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {6693#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#(<= fibo2_~n oldRank0)} assume !(~n < 1); {6693#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {6693#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,884 INFO L272 TraceCheckUtils]: 3: Hoare triple {6693#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {6703#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:57,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {6703#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {6707#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:57,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {6707#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,886 INFO L272 TraceCheckUtils]: 7: Hoare triple {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5671#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:57,886 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:57,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,929 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:19:57,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:57,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,930 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:57,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,259 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 691 states and 965 transitions. Complement of second has 26 states. [2022-02-21 04:19:58,259 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:58,259 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:58,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:58,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:58,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:58,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:58,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:58,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:58,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 691 states and 965 transitions. [2022-02-21 04:19:58,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:58,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:58,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:58,265 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:58,265 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:58,265 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:58,266 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:58,266 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 691 states and 965 transitions. cyclomatic complexity: 290 [2022-02-21 04:19:58,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:58,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:58,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:58,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:58,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:58,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:58,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:58,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:58,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:58,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:58,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:58,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:19:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:58,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {5658#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); {5658#unseeded} is VALID [2022-02-21 04:19:58,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#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 := 6; {5658#unseeded} is VALID [2022-02-21 04:19:58,681 INFO L272 TraceCheckUtils]: 2: Hoare triple {5658#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5658#unseeded} is VALID [2022-02-21 04:19:58,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:58,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:58,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:58,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:58,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:58,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:58,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:58,684 INFO L272 TraceCheckUtils]: 10: Hoare triple {5658#unseeded} call #t~ret6 := fibo1(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:58,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:58,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:58,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:58,685 INFO L272 TraceCheckUtils]: 14: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,687 INFO L272 TraceCheckUtils]: 18: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,688 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,690 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,691 INFO L272 TraceCheckUtils]: 27: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,692 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,694 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,694 INFO L272 TraceCheckUtils]: 35: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,696 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:58,698 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5658#unseeded} #50#return; {5658#unseeded} is VALID [2022-02-21 04:19:58,698 INFO L272 TraceCheckUtils]: 43: Hoare triple {5658#unseeded} call #t~ret5 := fibo2(~n - 2); {5658#unseeded} is VALID [2022-02-21 04:19:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:58,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:58,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {5661#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {7580#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:58,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#(<= fibo2_~n oldRank0)} assume !(~n < 1); {7580#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:58,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {7580#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:58,813 INFO L272 TraceCheckUtils]: 3: Hoare triple {7580#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {7590#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:58,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {7590#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {7594#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:58,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {7594#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:58,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:58,815 INFO L272 TraceCheckUtils]: 7: Hoare triple {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5671#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:58,815 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:58,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,852 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:19:58,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:58,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,853 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:58,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:59,121 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 576 states and 790 transitions. Complement of second has 25 states. [2022-02-21 04:19:59,121 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:59,121 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:59,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:59,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:59,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:59,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:59,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:59,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:59,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:59,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 576 states and 790 transitions. [2022-02-21 04:19:59,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:59,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:59,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:59,126 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:59,126 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:59,126 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:59,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:59,127 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:59,127 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 576 states and 790 transitions. cyclomatic complexity: 222 [2022-02-21 04:19:59,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 40 examples of accepted words. [2022-02-21 04:19:59,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 576 letters. Loop has 576 letters. [2022-02-21 04:19:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 576 letters. Loop has 576 letters. [2022-02-21 04:19:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 576 letters. Loop has 576 letters. [2022-02-21 04:19:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:59,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:59,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:59,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:59,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:59,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:59,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:59,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:59,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:59,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:59,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:59,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:59,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:59,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:59,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:59,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:59,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:59,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:59,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:59,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:59,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:59,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:59,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:59,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:59,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:59,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:59,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:59,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:59,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:59,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:59,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:59,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:59,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 13 letters. [2022-02-21 04:19:59,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 13 letters. [2022-02-21 04:19:59,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 53 letters. Loop has 13 letters. [2022-02-21 04:19:59,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:59,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:59,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:59,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:59,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:59,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:59,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:59,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:59,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 134 letters. [2022-02-21 04:19:59,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 134 letters. [2022-02-21 04:19:59,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 134 letters. [2022-02-21 04:19:59,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 87 letters. [2022-02-21 04:19:59,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 87 letters. [2022-02-21 04:19:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 87 letters. [2022-02-21 04:19:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:59,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 126 letters. [2022-02-21 04:19:59,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 126 letters. [2022-02-21 04:19:59,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 126 letters. [2022-02-21 04:19:59,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 93 letters. [2022-02-21 04:19:59,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 93 letters. [2022-02-21 04:19:59,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 93 letters. [2022-02-21 04:19:59,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 19 letters. [2022-02-21 04:19:59,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 19 letters. [2022-02-21 04:19:59,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 19 letters. [2022-02-21 04:19:59,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:59,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 154 letters. [2022-02-21 04:19:59,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 154 letters. [2022-02-21 04:19:59,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 154 letters. [2022-02-21 04:19:59,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:19:59,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:19:59,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:19:59,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 73 letters. [2022-02-21 04:19:59,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 73 letters. [2022-02-21 04:19:59,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 73 letters. [2022-02-21 04:19:59,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:19:59,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:19:59,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:19:59,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:19:59,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:19:59,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:19:59,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:19:59,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:19:59,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:19:59,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:19:59,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:19:59,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:19:59,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:19:59,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:19:59,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:19:59,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:19:59,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:19:59,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:19:59,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:19:59,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:19:59,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:19:59,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:59,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:59,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:59,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:59,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:59,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:59,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 13 letters. [2022-02-21 04:19:59,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 13 letters. [2022-02-21 04:19:59,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 13 letters. [2022-02-21 04:19:59,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 86 letters. [2022-02-21 04:19:59,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 86 letters. [2022-02-21 04:19:59,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 86 letters. [2022-02-21 04:19:59,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 61 letters. [2022-02-21 04:19:59,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 61 letters. [2022-02-21 04:19:59,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 61 letters. [2022-02-21 04:19:59,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:59,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:59,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:59,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 90 letters. [2022-02-21 04:19:59,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 90 letters. [2022-02-21 04:19:59,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 90 letters. [2022-02-21 04:19:59,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 175 letters. [2022-02-21 04:19:59,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 175 letters. [2022-02-21 04:19:59,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 175 letters. [2022-02-21 04:19:59,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:19:59,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:19:59,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:19:59,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 92 letters. [2022-02-21 04:19:59,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 92 letters. [2022-02-21 04:19:59,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 92 letters. [2022-02-21 04:19:59,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 126 letters. [2022-02-21 04:19:59,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 126 letters. [2022-02-21 04:19:59,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 126 letters. [2022-02-21 04:19:59,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 134 letters. [2022-02-21 04:19:59,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 134 letters. [2022-02-21 04:19:59,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 134 letters. [2022-02-21 04:19:59,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,229 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-21 04:19:59,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:59,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:59,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 44 letters. Loop has 16 letters. [2022-02-21 04:19:59,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:59,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 790 transitions. cyclomatic complexity: 222 [2022-02-21 04:19:59,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:59,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 465 states and 663 transitions. [2022-02-21 04:19:59,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2022-02-21 04:19:59,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2022-02-21 04:19:59,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 663 transitions. [2022-02-21 04:19:59,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:59,264 INFO L681 BuchiCegarLoop]: Abstraction has 465 states and 663 transitions. [2022-02-21 04:19:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 663 transitions. [2022-02-21 04:19:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 390. [2022-02-21 04:19:59,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:59,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states and 663 transitions. Second operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:59,273 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states and 663 transitions. Second operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:59,273 INFO L87 Difference]: Start difference. First operand 465 states and 663 transitions. Second operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:59,273 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:59,308 INFO L93 Difference]: Finished difference Result 886 states and 1241 transitions. [2022-02-21 04:19:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1241 transitions. [2022-02-21 04:19:59,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:59,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:59,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) Second operand 465 states and 663 transitions. [2022-02-21 04:19:59,313 INFO L87 Difference]: Start difference. First operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) Second operand 465 states and 663 transitions. [2022-02-21 04:19:59,314 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:59,371 INFO L93 Difference]: Finished difference Result 1237 states and 1712 transitions. [2022-02-21 04:19:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1712 transitions. [2022-02-21 04:19:59,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:59,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:59,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:59,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 531 transitions. [2022-02-21 04:19:59,385 INFO L704 BuchiCegarLoop]: Abstraction has 390 states and 531 transitions. [2022-02-21 04:19:59,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 04:19:59,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-02-21 04:19:59,386 INFO L87 Difference]: Start difference. First operand 390 states and 531 transitions. Second operand has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 13 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 04:20:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:00,523 INFO L93 Difference]: Finished difference Result 469 states and 660 transitions. [2022-02-21 04:20:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-21 04:20:00,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 13 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 04:20:00,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:00,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 660 transitions. [2022-02-21 04:20:00,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:00,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 430 states and 616 transitions. [2022-02-21 04:20:00,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2022-02-21 04:20:00,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2022-02-21 04:20:00,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 430 states and 616 transitions. [2022-02-21 04:20:00,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:00,623 INFO L681 BuchiCegarLoop]: Abstraction has 430 states and 616 transitions. [2022-02-21 04:20:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states and 616 transitions. [2022-02-21 04:20:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 381. [2022-02-21 04:20:00,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:00,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 430 states and 616 transitions. Second operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:20:00,633 INFO L74 IsIncluded]: Start isIncluded. First operand 430 states and 616 transitions. Second operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:20:00,634 INFO L87 Difference]: Start difference. First operand 430 states and 616 transitions. Second operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:20:00,634 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:00,679 INFO L93 Difference]: Finished difference Result 1049 states and 1507 transitions. [2022-02-21 04:20:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1507 transitions. [2022-02-21 04:20:00,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:00,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:00,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) Second operand 430 states and 616 transitions. [2022-02-21 04:20:00,685 INFO L87 Difference]: Start difference. First operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) Second operand 430 states and 616 transitions. [2022-02-21 04:20:00,685 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:00,732 INFO L93 Difference]: Finished difference Result 1058 states and 1522 transitions. [2022-02-21 04:20:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1522 transitions. [2022-02-21 04:20:00,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:00,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:00,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:00,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:20:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 523 transitions. [2022-02-21 04:20:00,744 INFO L704 BuchiCegarLoop]: Abstraction has 381 states and 523 transitions. [2022-02-21 04:20:00,744 INFO L587 BuchiCegarLoop]: Abstraction has 381 states and 523 transitions. [2022-02-21 04:20:00,744 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:20:00,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 381 states and 523 transitions. [2022-02-21 04:20:00,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:00,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:00,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:00,747 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:00,747 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:20:00,747 INFO L791 eck$LassoCheckResult]: Stem: 12497#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); 12498#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 := 6; 12526#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 12581#fibo1ENTRY ~n := #in~n; 12639#L10 assume !(~n < 1); 12638#L12 assume !(1 == ~n); 12634#L15 call #t~ret4 := fibo2(~n - 1);< 12637#fibo2ENTRY ~n := #in~n; 12636#L20 assume !(~n < 1); 12635#L22 assume !(1 == ~n); 12630#L25 call #t~ret6 := fibo1(~n - 1);< 12633#fibo1ENTRY ~n := #in~n; 12632#L10 assume !(~n < 1); 12631#L12 assume !(1 == ~n); 12621#L15 call #t~ret4 := fibo2(~n - 1);< 12628#fibo2ENTRY ~n := #in~n; 12627#L20 assume !(~n < 1); 12620#L22 assume !(1 == ~n); 12528#L25 call #t~ret6 := fibo1(~n - 1);< 12612#fibo1ENTRY ~n := #in~n; 12613#L10 assume !(~n < 1); 12785#L12 assume !(1 == ~n); 12691#L15 call #t~ret4 := fibo2(~n - 1);< 12777#fibo2ENTRY ~n := #in~n; 12787#L20 assume !(~n < 1); 12784#L22 assume 1 == ~n;#res := 1; 12782#fibo2FINAL assume true; 12776#fibo2EXIT >#50#return; 12527#L15-1 call #t~ret5 := fibo2(~n - 2);< 12531#fibo2ENTRY ~n := #in~n; 12805#L20 assume ~n < 1;#res := 0; 12803#fibo2FINAL assume true; 12800#fibo2EXIT >#52#return; 12797#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12796#fibo1FINAL assume true; 12795#fibo1EXIT >#46#return; 12694#L25-1 call #t~ret7 := fibo1(~n - 2);< 12711#fibo1ENTRY ~n := #in~n; 12809#L10 assume ~n < 1;#res := 0; 12808#fibo1FINAL assume true; 12792#fibo1EXIT >#48#return; 12729#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12762#fibo2FINAL assume true; 12754#fibo2EXIT >#50#return; 12564#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY [2022-02-21 04:20:00,747 INFO L793 eck$LassoCheckResult]: Loop: 12750#fibo2ENTRY ~n := #in~n; 12563#L20 assume !(~n < 1); 12569#L22 assume !(1 == ~n); 12718#L25 call #t~ret6 := fibo1(~n - 1);< 12735#fibo1ENTRY ~n := #in~n; 12775#L10 assume !(~n < 1); 12774#L12 assume !(1 == ~n); 12566#L15 call #t~ret4 := fibo2(~n - 1);< 12573#fibo2ENTRY ~n := #in~n; 12563#L20 assume !(~n < 1); 12569#L22 assume !(1 == ~n); 12718#L25 call #t~ret6 := fibo1(~n - 1);< 12735#fibo1ENTRY ~n := #in~n; 12775#L10 assume !(~n < 1); 12774#L12 assume !(1 == ~n); 12566#L15 call #t~ret4 := fibo2(~n - 1);< 12573#fibo2ENTRY ~n := #in~n; 12574#L20 assume !(~n < 1); 12779#L22 assume 1 == ~n;#res := 1; 12778#fibo2FINAL assume true; 12759#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY ~n := #in~n; 12771#L20 assume ~n < 1;#res := 0; 12755#fibo2FINAL assume true; 12751#fibo2EXIT >#52#return; 12747#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12732#fibo1FINAL assume true; 12724#fibo1EXIT >#46#return; 12726#L25-1 call #t~ret7 := fibo1(~n - 2);< 12731#fibo1ENTRY ~n := #in~n; 12766#L10 assume !(~n < 1); 12763#L12 assume !(1 == ~n); 12733#L15 call #t~ret4 := fibo2(~n - 1);< 12743#fibo2ENTRY ~n := #in~n; 12740#L20 assume !(~n < 1); 12737#L22 assume !(1 == ~n); 12727#L25 call #t~ret6 := fibo1(~n - 1);< 12731#fibo1ENTRY ~n := #in~n; 12766#L10 assume !(~n < 1); 12763#L12 assume !(1 == ~n); 12733#L15 call #t~ret4 := fibo2(~n - 1);< 12743#fibo2ENTRY ~n := #in~n; 12740#L20 assume !(~n < 1); 12737#L22 assume 1 == ~n;#res := 1; 12738#fibo2FINAL assume true; 12760#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY ~n := #in~n; 12771#L20 assume ~n < 1;#res := 0; 12755#fibo2FINAL assume true; 12751#fibo2EXIT >#52#return; 12747#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12732#fibo1FINAL assume true; 12724#fibo1EXIT >#46#return; 12726#L25-1 call #t~ret7 := fibo1(~n - 2);< 12731#fibo1ENTRY ~n := #in~n; 12766#L10 assume ~n < 1;#res := 0; 12767#fibo1FINAL assume true; 12791#fibo1EXIT >#48#return; 12730#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12802#fibo2FINAL assume true; 12753#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY ~n := #in~n; 12771#L20 assume ~n < 1;#res := 0; 12755#fibo2FINAL assume true; 12751#fibo2EXIT >#52#return; 12747#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12732#fibo1FINAL assume true; 12724#fibo1EXIT >#48#return; 12730#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12802#fibo2FINAL assume true; 12753#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY [2022-02-21 04:20:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1055972758, now seen corresponding path program 1 times [2022-02-21 04:20:00,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:00,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327535939] [2022-02-21 04:20:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:20:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,944 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:00,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,951 INFO L272 TraceCheckUtils]: 3: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,952 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,952 INFO L272 TraceCheckUtils]: 9: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,953 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} assume true; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,954 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16361#(<= 2 |fibo1_#in~n|)} {16289#true} #46#return; {16344#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:20:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16344#(<= 3 fibo2_~n)} #48#return; {16290#false} is VALID [2022-02-21 04:20:00,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:00,971 INFO L272 TraceCheckUtils]: 3: Hoare triple {16289#true} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:00,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,972 INFO L272 TraceCheckUtils]: 7: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,973 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,973 INFO L272 TraceCheckUtils]: 13: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,974 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} assume true; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,975 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16361#(<= 2 |fibo1_#in~n|)} {16289#true} #46#return; {16344#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:20:00,976 INFO L272 TraceCheckUtils]: 21: Hoare triple {16344#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,977 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16344#(<= 3 fibo2_~n)} #48#return; {16290#false} is VALID [2022-02-21 04:20:00,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {16290#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16290#false} is VALID [2022-02-21 04:20:00,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {16290#false} assume true; {16290#false} is VALID [2022-02-21 04:20:00,977 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16290#false} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:00,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#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); {16289#true} is VALID [2022-02-21 04:20:00,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#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 := 6; {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:00,978 INFO L272 TraceCheckUtils]: 2: Hoare triple {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {16292#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {16292#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(~n < 1); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(1 == ~n); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {16293#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16294#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {16294#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(~n < 1); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(1 == ~n); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,981 INFO L272 TraceCheckUtils]: 10: Hoare triple {16295#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16296#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(~n < 1); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(1 == ~n); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,982 INFO L272 TraceCheckUtils]: 14: Hoare triple {16297#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:00,983 INFO L272 TraceCheckUtils]: 18: Hoare triple {16289#true} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:00,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,984 INFO L272 TraceCheckUtils]: 22: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,985 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,985 INFO L272 TraceCheckUtils]: 28: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,986 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} assume true; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,987 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16361#(<= 2 |fibo1_#in~n|)} {16289#true} #46#return; {16344#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:20:00,987 INFO L272 TraceCheckUtils]: 36: Hoare triple {16344#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,988 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16344#(<= 3 fibo2_~n)} #48#return; {16290#false} is VALID [2022-02-21 04:20:00,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {16290#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16290#false} is VALID [2022-02-21 04:20:00,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {16290#false} assume true; {16290#false} is VALID [2022-02-21 04:20:00,989 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16290#false} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:00,989 INFO L272 TraceCheckUtils]: 44: Hoare triple {16290#false} call #t~ret5 := fibo2(~n - 2); {16290#false} is VALID [2022-02-21 04:20:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 04:20:00,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:00,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327535939] [2022-02-21 04:20:00,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327535939] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:00,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033204133] [2022-02-21 04:20:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,991 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,992 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:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 04:20:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:01,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#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); {16289#true} is VALID [2022-02-21 04:20:01,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#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 := 6; {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:01,305 INFO L272 TraceCheckUtils]: 2: Hoare triple {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {16292#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {16292#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:01,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(~n < 1); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:01,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(1 == ~n); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:01,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {16293#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16294#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {16294#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:01,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(~n < 1); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:01,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(1 == ~n); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:01,308 INFO L272 TraceCheckUtils]: 10: Hoare triple {16295#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16296#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:01,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(~n < 1); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:01,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(1 == ~n); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:01,309 INFO L272 TraceCheckUtils]: 14: Hoare triple {16297#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:01,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} ~n := #in~n; {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:01,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:01,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:01,310 INFO L272 TraceCheckUtils]: 18: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:01,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:01,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L272 TraceCheckUtils]: 22: Hoare triple {16289#true} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16289#true} {16289#true} #50#return; {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L272 TraceCheckUtils]: 28: Hoare triple {16289#true} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:01,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:01,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:01,312 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16289#true} {16289#true} #52#return; {16289#true} is VALID [2022-02-21 04:20:01,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {16289#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16289#true} is VALID [2022-02-21 04:20:01,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:01,313 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16289#true} {16411#(<= |fibo2_#in~n| fibo2_~n)} #46#return; {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:01,313 INFO L272 TraceCheckUtils]: 36: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:01,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {16289#true} ~n := #in~n; {16478#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:01,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {16478#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:01,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:01,315 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16411#(<= |fibo2_#in~n| fibo2_~n)} #48#return; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:01,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {16488#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:01,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {16488#(<= |fibo2_#in~n| 2)} assume true; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:01,316 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16488#(<= |fibo2_#in~n| 2)} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:01,316 INFO L272 TraceCheckUtils]: 44: Hoare triple {16290#false} call #t~ret5 := fibo2(~n - 2); {16290#false} is VALID [2022-02-21 04:20:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 04:20:01,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:01,861 INFO L272 TraceCheckUtils]: 44: Hoare triple {16290#false} call #t~ret5 := fibo2(~n - 2); {16290#false} is VALID [2022-02-21 04:20:01,862 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16488#(<= |fibo2_#in~n| 2)} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:01,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {16488#(<= |fibo2_#in~n| 2)} assume true; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:01,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {16488#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:01,864 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #48#return; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:01,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:01,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {16526#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:01,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {16289#true} ~n := #in~n; {16526#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,865 INFO L272 TraceCheckUtils]: 36: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:01,865 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16289#true} {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #46#return; {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:01,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:01,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {16289#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16289#true} is VALID [2022-02-21 04:20:01,865 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16289#true} {16289#true} #52#return; {16289#true} is VALID [2022-02-21 04:20:01,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:01,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L272 TraceCheckUtils]: 28: Hoare triple {16289#true} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16289#true} {16289#true} #50#return; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L272 TraceCheckUtils]: 22: Hoare triple {16289#true} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:01,866 INFO L272 TraceCheckUtils]: 18: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:01,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:01,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:01,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} ~n := #in~n; {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:01,867 INFO L272 TraceCheckUtils]: 14: Hoare triple {16297#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:01,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(1 == ~n); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:01,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(~n < 1); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:01,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:01,869 INFO L272 TraceCheckUtils]: 10: Hoare triple {16295#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16296#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(1 == ~n); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:01,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(~n < 1); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:01,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {16294#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:01,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {16293#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16294#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(1 == ~n); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:01,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(~n < 1); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:01,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {16292#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:01,874 INFO L272 TraceCheckUtils]: 2: Hoare triple {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {16292#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#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 := 6; {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:01,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#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); {16289#true} is VALID [2022-02-21 04:20:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 04:20:01,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033204133] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:01,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:01,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 20 [2022-02-21 04:20:01,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565508494] [2022-02-21 04:20:01,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:01,879 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 688787707, now seen corresponding path program 1 times [2022-02-21 04:20:01,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:01,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144335348] [2022-02-21 04:20:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 04:20:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,078 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,085 INFO L272 TraceCheckUtils]: 3: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,087 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:02,087 INFO L272 TraceCheckUtils]: 9: Hoare triple {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,088 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,089 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,179 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,195 INFO L272 TraceCheckUtils]: 9: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,201 INFO L272 TraceCheckUtils]: 13: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L272 TraceCheckUtils]: 21: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,203 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:02,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:02,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,203 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 04:20:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:02,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,209 INFO L272 TraceCheckUtils]: 3: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,209 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,210 INFO L272 TraceCheckUtils]: 17: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,223 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L272 TraceCheckUtils]: 25: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:02,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,225 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,225 INFO L272 TraceCheckUtils]: 33: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,226 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,227 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:02,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,234 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,235 INFO L272 TraceCheckUtils]: 7: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,237 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:02,237 INFO L272 TraceCheckUtils]: 13: Hoare triple {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,238 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,239 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:02,239 INFO L272 TraceCheckUtils]: 21: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:02,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,240 INFO L272 TraceCheckUtils]: 25: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L272 TraceCheckUtils]: 29: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L272 TraceCheckUtils]: 33: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,241 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L272 TraceCheckUtils]: 39: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,243 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:02,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:02,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,244 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,244 INFO L272 TraceCheckUtils]: 55: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,245 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,245 INFO L290 TraceCheckUtils]: 61: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,246 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:02,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:02,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:02,246 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:02,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,247 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,248 INFO L272 TraceCheckUtils]: 15: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,250 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:02,250 INFO L272 TraceCheckUtils]: 21: Hoare triple {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,251 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,252 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:02,252 INFO L272 TraceCheckUtils]: 29: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:02,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,254 INFO L272 TraceCheckUtils]: 33: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L272 TraceCheckUtils]: 37: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L272 TraceCheckUtils]: 41: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L272 TraceCheckUtils]: 55: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:02,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,257 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:02,257 INFO L272 TraceCheckUtils]: 63: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,257 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,257 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,257 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,258 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,259 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:02,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:02,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:02,259 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:02,259 INFO L272 TraceCheckUtils]: 74: Hoare triple {16633#false} call #t~ret5 := fibo2(~n - 2); {16633#false} is VALID [2022-02-21 04:20:02,260 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:20:02,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:02,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144335348] [2022-02-21 04:20:02,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144335348] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:02,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941247230] [2022-02-21 04:20:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:02,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:02,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:02,262 INFO L229 MonitoredProcess]: Starting monitored process 52 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:02,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-02-21 04:20:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:02,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:02,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,651 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,652 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {16878#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:02,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {16878#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {16878#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:02,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {16878#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {16878#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:02,653 INFO L272 TraceCheckUtils]: 15: Hoare triple {16878#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} ~n := #in~n; {16891#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:02,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {16891#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {16891#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:02,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {16891#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,655 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16878#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,656 INFO L272 TraceCheckUtils]: 21: Hoare triple {16770#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,656 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16770#(<= |fibo1_#in~n| 2)} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,658 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:02,658 INFO L272 TraceCheckUtils]: 29: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {16934#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {16934#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16934#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {16934#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16934#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,659 INFO L272 TraceCheckUtils]: 33: Hoare triple {16934#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16947#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {16947#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,660 INFO L272 TraceCheckUtils]: 37: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L272 TraceCheckUtils]: 41: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,662 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,663 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #46#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,663 INFO L272 TraceCheckUtils]: 55: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,663 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #48#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume true; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,665 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16951#(<= 1 |fibo2_#in~n|)} {16934#(<= fibo1_~n |fibo1_#in~n|)} #50#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,665 INFO L272 TraceCheckUtils]: 63: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,666 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16632#true} {16808#(<= 2 |fibo1_#in~n|)} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,666 INFO L290 TraceCheckUtils]: 68: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,667 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:02,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:02,667 INFO L290 TraceCheckUtils]: 72: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:02,667 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:02,667 INFO L272 TraceCheckUtils]: 74: Hoare triple {16633#false} call #t~ret5 := fibo2(~n - 2); {16633#false} is VALID [2022-02-21 04:20:02,668 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:20:02,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:03,866 INFO L272 TraceCheckUtils]: 74: Hoare triple {16633#false} call #t~ret5 := fibo2(~n - 2); {16633#false} is VALID [2022-02-21 04:20:03,866 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:03,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:03,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:03,867 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:03,868 INFO L290 TraceCheckUtils]: 69: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:03,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:03,869 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16632#true} {16808#(<= 2 |fibo1_#in~n|)} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:03,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:03,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:03,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,869 INFO L272 TraceCheckUtils]: 63: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:03,870 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16951#(<= 1 |fibo2_#in~n|)} {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} #50#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:03,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume true; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:03,871 INFO L290 TraceCheckUtils]: 60: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:03,871 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #48#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:03,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:03,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:03,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,872 INFO L272 TraceCheckUtils]: 55: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:03,872 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #46#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:03,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:03,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:03,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,874 INFO L272 TraceCheckUtils]: 41: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:03,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:03,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,874 INFO L272 TraceCheckUtils]: 37: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:03,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {17196#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:03,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {17196#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:03,875 INFO L272 TraceCheckUtils]: 33: Hoare triple {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(1 == ~n); {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:03,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(~n < 1); {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:03,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:03,876 INFO L272 TraceCheckUtils]: 29: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:03,877 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:03,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:03,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:03,878 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16770#(<= |fibo1_#in~n| 2)} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:03,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:03,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:03,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,878 INFO L272 TraceCheckUtils]: 21: Hoare triple {16770#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:03,879 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} #50#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:03,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:03,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:03,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:03,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} ~n := #in~n; {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:03,880 INFO L272 TraceCheckUtils]: 15: Hoare triple {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:03,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:03,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:03,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:03,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:03,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:03,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:03,883 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:20:03,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941247230] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:03,883 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:03,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-02-21 04:20:03,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209578229] [2022-02-21 04:20:03,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:03,884 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:20:03,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:03,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 04:20:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-02-21 04:20:03,885 INFO L87 Difference]: Start difference. First operand 381 states and 523 transitions. cyclomatic complexity: 149 Second operand has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 04:20:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:04,754 INFO L93 Difference]: Finished difference Result 412 states and 577 transitions. [2022-02-21 04:20:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-21 04:20:04,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 04:20:04,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:04,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 577 transitions. [2022-02-21 04:20:04,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:04,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 412 states and 577 transitions. [2022-02-21 04:20:04,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2022-02-21 04:20:04,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2022-02-21 04:20:04,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 577 transitions. [2022-02-21 04:20:04,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:04,836 INFO L681 BuchiCegarLoop]: Abstraction has 412 states and 577 transitions. [2022-02-21 04:20:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 577 transitions. [2022-02-21 04:20:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 394. [2022-02-21 04:20:04,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:04,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states and 577 transitions. Second operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:04,848 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states and 577 transitions. Second operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:04,848 INFO L87 Difference]: Start difference. First operand 412 states and 577 transitions. Second operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:04,848 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:04,890 INFO L93 Difference]: Finished difference Result 1013 states and 1418 transitions. [2022-02-21 04:20:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1418 transitions. [2022-02-21 04:20:04,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:04,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:04,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) Second operand 412 states and 577 transitions. [2022-02-21 04:20:04,902 INFO L87 Difference]: Start difference. First operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) Second operand 412 states and 577 transitions. [2022-02-21 04:20:04,902 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:04,986 INFO L93 Difference]: Finished difference Result 1013 states and 1418 transitions. [2022-02-21 04:20:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1418 transitions. [2022-02-21 04:20:05,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:05,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:05,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:05,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 539 transitions. [2022-02-21 04:20:05,035 INFO L704 BuchiCegarLoop]: Abstraction has 394 states and 539 transitions. [2022-02-21 04:20:05,035 INFO L587 BuchiCegarLoop]: Abstraction has 394 states and 539 transitions. [2022-02-21 04:20:05,035 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:20:05,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 539 transitions. [2022-02-21 04:20:05,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:05,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:05,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:05,038 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:05,038 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1] [2022-02-21 04:20:05,039 INFO L791 eck$LassoCheckResult]: Stem: 17720#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); 17721#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 := 6; 17754#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 17803#fibo1ENTRY ~n := #in~n; 17856#L10 assume !(~n < 1); 17855#L12 assume !(1 == ~n); 17851#L15 call #t~ret4 := fibo2(~n - 1);< 17854#fibo2ENTRY ~n := #in~n; 17853#L20 assume !(~n < 1); 17852#L22 assume !(1 == ~n); 17847#L25 call #t~ret6 := fibo1(~n - 1);< 17850#fibo1ENTRY ~n := #in~n; 17849#L10 assume !(~n < 1); 17848#L12 assume !(1 == ~n); 17839#L15 call #t~ret4 := fibo2(~n - 1);< 17845#fibo2ENTRY ~n := #in~n; 17844#L20 assume !(~n < 1); 17841#L22 assume !(1 == ~n); 17772#L25 call #t~ret6 := fibo1(~n - 1);< 17840#fibo1ENTRY ~n := #in~n; 17829#L10 assume !(~n < 1); 17830#L12 assume !(1 == ~n); 17816#L15 call #t~ret4 := fibo2(~n - 1);< 17817#fibo2ENTRY ~n := #in~n; 17831#L20 assume !(~n < 1); 17832#L22 assume !(1 == ~n); 17774#L25 call #t~ret6 := fibo1(~n - 1);< 17840#fibo1ENTRY ~n := #in~n; 17842#L10 assume !(~n < 1); 17952#L12 assume 1 == ~n;#res := 1; 17950#fibo1FINAL assume true; 17947#fibo1EXIT >#46#return; 17913#L25-1 call #t~ret7 := fibo1(~n - 2);< 17931#fibo1ENTRY ~n := #in~n; 18007#L10 assume ~n < 1;#res := 0; 18008#fibo1FINAL assume true; 18067#fibo1EXIT >#48#return; 18000#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 18054#fibo2FINAL assume true; 18020#fibo2EXIT >#50#return; 17936#L15-1 [2022-02-21 04:20:05,040 INFO L793 eck$LassoCheckResult]: Loop: 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17796#L20 assume !(~n < 1); 17939#L22 assume !(1 == ~n); 17735#L25 call #t~ret6 := fibo1(~n - 1);< 17953#fibo1ENTRY ~n := #in~n; 17948#L10 assume !(~n < 1); 17949#L12 assume !(1 == ~n); 17795#L15 call #t~ret4 := fibo2(~n - 1);< 17793#fibo2ENTRY ~n := #in~n; 17796#L20 assume !(~n < 1); 17939#L22 assume !(1 == ~n); 17735#L25 call #t~ret6 := fibo1(~n - 1);< 17953#fibo1ENTRY ~n := #in~n; 17948#L10 assume !(~n < 1); 17949#L12 assume !(1 == ~n); 17795#L15 call #t~ret4 := fibo2(~n - 1);< 17793#fibo2ENTRY ~n := #in~n; 17797#L20 assume !(~n < 1); 18030#L22 assume 1 == ~n;#res := 1; 18027#fibo2FINAL assume true; 18021#fibo2EXIT >#50#return; 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17941#L20 assume ~n < 1;#res := 0; 18031#fibo2FINAL assume true; 18018#fibo2EXIT >#52#return; 17987#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 17974#fibo1FINAL assume true; 17964#fibo1EXIT >#46#return; 17966#L25-1 call #t~ret7 := fibo1(~n - 2);< 17978#fibo1ENTRY ~n := #in~n; 18011#L10 assume !(~n < 1); 18013#L12 assume !(1 == ~n); 17977#L15 call #t~ret4 := fibo2(~n - 1);< 17998#fibo2ENTRY ~n := #in~n; 17984#L20 assume !(~n < 1); 17980#L22 assume !(1 == ~n); 17967#L25 call #t~ret6 := fibo1(~n - 1);< 17978#fibo1ENTRY ~n := #in~n; 18011#L10 assume !(~n < 1); 18013#L12 assume !(1 == ~n); 17977#L15 call #t~ret4 := fibo2(~n - 1);< 17998#fibo2ENTRY ~n := #in~n; 17984#L20 assume !(~n < 1); 17980#L22 assume 1 == ~n;#res := 1; 17981#fibo2FINAL assume true; 18024#fibo2EXIT >#50#return; 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17941#L20 assume ~n < 1;#res := 0; 18031#fibo2FINAL assume true; 18018#fibo2EXIT >#52#return; 17987#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 17974#fibo1FINAL assume true; 17964#fibo1EXIT >#46#return; 17966#L25-1 call #t~ret7 := fibo1(~n - 2);< 17978#fibo1ENTRY ~n := #in~n; 18011#L10 assume !(~n < 1); 18013#L12 assume 1 == ~n;#res := 1; 18003#fibo1FINAL assume true; 18001#fibo1EXIT >#48#return; 17969#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 18049#fibo2FINAL assume true; 18019#fibo2EXIT >#50#return; 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17941#L20 assume ~n < 1;#res := 0; 18031#fibo2FINAL assume true; 18018#fibo2EXIT >#52#return; 17987#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 17974#fibo1FINAL assume true; 17964#fibo1EXIT >#48#return; 17969#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 18049#fibo2FINAL assume true; 18019#fibo2EXIT >#50#return; 17936#L15-1 [2022-02-21 04:20:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1448014817, now seen corresponding path program 1 times [2022-02-21 04:20:05,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:05,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695169345] [2022-02-21 04:20:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-21 04:20:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume !(~n < 1); {21436#true} is VALID [2022-02-21 04:20:05,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {21436#true} assume 1 == ~n;#res := 1; {21436#true} is VALID [2022-02-21 04:20:05,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,211 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:05,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} ~n := #in~n; {21466#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {21466#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,217 INFO L272 TraceCheckUtils]: 3: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:05,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {21436#true} assume !(~n < 1); {21436#true} is VALID [2022-02-21 04:20:05,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {21436#true} assume 1 == ~n;#res := 1; {21436#true} is VALID [2022-02-21 04:20:05,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,218 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,218 INFO L272 TraceCheckUtils]: 9: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:05,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:05,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,219 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,221 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:05,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#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); {21436#true} is VALID [2022-02-21 04:20:05,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#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 := 6; {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:05,221 INFO L272 TraceCheckUtils]: 2: Hoare triple {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {21439#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:05,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {21439#(<= |fibo1_#in~n| 6)} ~n := #in~n; {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:05,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {21440#(<= fibo1_~n 6)} assume !(~n < 1); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:05,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {21440#(<= fibo1_~n 6)} assume !(1 == ~n); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:05,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {21440#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {21441#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:05,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#(<= |fibo2_#in~n| 5)} ~n := #in~n; {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:05,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {21442#(<= fibo2_~n 5)} assume !(~n < 1); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:05,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {21442#(<= fibo2_~n 5)} assume !(1 == ~n); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:05,224 INFO L272 TraceCheckUtils]: 10: Hoare triple {21442#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {21443#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:05,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {21443#(<= |fibo1_#in~n| 4)} ~n := #in~n; {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:05,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {21444#(<= fibo1_~n 4)} assume !(~n < 1); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:05,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {21444#(<= fibo1_~n 4)} assume !(1 == ~n); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:05,226 INFO L272 TraceCheckUtils]: 14: Hoare triple {21444#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {21445#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:05,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {21445#(<= |fibo2_#in~n| 3)} ~n := #in~n; {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {21446#(<= fibo2_~n 3)} assume !(~n < 1); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {21446#(<= fibo2_~n 3)} assume !(1 == ~n); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,227 INFO L272 TraceCheckUtils]: 18: Hoare triple {21446#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {21447#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {21447#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:05,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {21448#(<= fibo1_~n 2)} assume !(~n < 1); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:05,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {21448#(<= fibo1_~n 2)} assume !(1 == ~n); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:05,228 INFO L272 TraceCheckUtils]: 22: Hoare triple {21448#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {21436#true} is VALID [2022-02-21 04:20:05,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {21436#true} ~n := #in~n; {21466#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {21466#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,230 INFO L272 TraceCheckUtils]: 26: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:05,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {21436#true} assume !(~n < 1); {21436#true} is VALID [2022-02-21 04:20:05,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {21436#true} assume 1 == ~n;#res := 1; {21436#true} is VALID [2022-02-21 04:20:05,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,231 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:05,231 INFO L272 TraceCheckUtils]: 32: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:05,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:05,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,232 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,233 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:20:05,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:05,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695169345] [2022-02-21 04:20:05,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695169345] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:05,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843682300] [2022-02-21 04:20:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:05,235 INFO L229 MonitoredProcess]: Starting monitored process 53 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:05,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-02-21 04:20:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:05,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#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); {21436#true} is VALID [2022-02-21 04:20:05,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#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 := 6; {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:05,572 INFO L272 TraceCheckUtils]: 2: Hoare triple {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {21439#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:05,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {21439#(<= |fibo1_#in~n| 6)} ~n := #in~n; {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:05,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {21440#(<= fibo1_~n 6)} assume !(~n < 1); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:05,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {21440#(<= fibo1_~n 6)} assume !(1 == ~n); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:05,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {21440#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {21441#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:05,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#(<= |fibo2_#in~n| 5)} ~n := #in~n; {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:05,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {21442#(<= fibo2_~n 5)} assume !(~n < 1); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:05,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {21442#(<= fibo2_~n 5)} assume !(1 == ~n); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:05,575 INFO L272 TraceCheckUtils]: 10: Hoare triple {21442#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {21443#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:05,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {21443#(<= |fibo1_#in~n| 4)} ~n := #in~n; {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:05,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {21444#(<= fibo1_~n 4)} assume !(~n < 1); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:05,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {21444#(<= fibo1_~n 4)} assume !(1 == ~n); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:05,577 INFO L272 TraceCheckUtils]: 14: Hoare triple {21444#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {21445#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:05,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {21445#(<= |fibo2_#in~n| 3)} ~n := #in~n; {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {21446#(<= fibo2_~n 3)} assume !(~n < 1); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {21446#(<= fibo2_~n 3)} assume !(1 == ~n); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,578 INFO L272 TraceCheckUtils]: 18: Hoare triple {21446#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {21447#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {21447#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:05,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {21448#(<= fibo1_~n 2)} assume !(~n < 1); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:05,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {21448#(<= fibo1_~n 2)} assume !(1 == ~n); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:05,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {21448#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {21436#true} is VALID [2022-02-21 04:20:05,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {21436#true} ~n := #in~n; {21551#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {21551#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21551#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {21551#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {21551#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,580 INFO L272 TraceCheckUtils]: 26: Hoare triple {21551#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:05,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {21436#true} ~n := #in~n; {21564#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {21564#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume true; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,582 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21568#(<= 1 |fibo1_#in~n|)} {21551#(<= fibo2_~n |fibo2_#in~n|)} #46#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,582 INFO L272 TraceCheckUtils]: 32: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:05,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:05,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:05,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:05,583 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21436#true} {21478#(<= 2 |fibo2_#in~n|)} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,585 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:20:05,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:06,120 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:06,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,122 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21436#true} {21478#(<= 2 |fibo2_#in~n|)} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:06,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:06,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:06,122 INFO L272 TraceCheckUtils]: 32: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:06,123 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21568#(<= 1 |fibo1_#in~n|)} {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} #46#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume true; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {21642#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} assume !(~n < 1); {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {21436#true} ~n := #in~n; {21642#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} is VALID [2022-02-21 04:20:06,124 INFO L272 TraceCheckUtils]: 26: Hoare triple {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:06,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} assume !(1 == ~n); {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:06,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} assume !(~n < 1); {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:06,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {21436#true} ~n := #in~n; {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:06,125 INFO L272 TraceCheckUtils]: 22: Hoare triple {21448#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {21436#true} is VALID [2022-02-21 04:20:06,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {21448#(<= fibo1_~n 2)} assume !(1 == ~n); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:06,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {21448#(<= fibo1_~n 2)} assume !(~n < 1); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:06,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {21447#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:06,127 INFO L272 TraceCheckUtils]: 18: Hoare triple {21446#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {21447#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {21446#(<= fibo2_~n 3)} assume !(1 == ~n); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {21446#(<= fibo2_~n 3)} assume !(~n < 1); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {21445#(<= |fibo2_#in~n| 3)} ~n := #in~n; {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,128 INFO L272 TraceCheckUtils]: 14: Hoare triple {21444#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {21445#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:06,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {21444#(<= fibo1_~n 4)} assume !(1 == ~n); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:06,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {21444#(<= fibo1_~n 4)} assume !(~n < 1); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:06,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {21443#(<= |fibo1_#in~n| 4)} ~n := #in~n; {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:06,130 INFO L272 TraceCheckUtils]: 10: Hoare triple {21442#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {21443#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:06,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {21442#(<= fibo2_~n 5)} assume !(1 == ~n); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:06,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {21442#(<= fibo2_~n 5)} assume !(~n < 1); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:06,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#(<= |fibo2_#in~n| 5)} ~n := #in~n; {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:06,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {21440#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {21441#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:06,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {21440#(<= fibo1_~n 6)} assume !(1 == ~n); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:06,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {21440#(<= fibo1_~n 6)} assume !(~n < 1); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:06,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {21439#(<= |fibo1_#in~n| 6)} ~n := #in~n; {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:06,133 INFO L272 TraceCheckUtils]: 2: Hoare triple {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {21439#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:06,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#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 := 6; {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:06,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#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); {21436#true} is VALID [2022-02-21 04:20:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:20:06,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843682300] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:06,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:06,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 21 [2022-02-21 04:20:06,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878672047] [2022-02-21 04:20:06,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:06,136 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 651349219, now seen corresponding path program 1 times [2022-02-21 04:20:06,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:06,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584993150] [2022-02-21 04:20:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:20:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,294 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,300 INFO L272 TraceCheckUtils]: 3: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,302 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:06,302 INFO L272 TraceCheckUtils]: 9: Hoare triple {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,303 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,306 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,378 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,382 INFO L272 TraceCheckUtils]: 3: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L272 TraceCheckUtils]: 9: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,384 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,385 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,390 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:06,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L272 TraceCheckUtils]: 3: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L272 TraceCheckUtils]: 7: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L272 TraceCheckUtils]: 13: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L272 TraceCheckUtils]: 21: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,394 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:06,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:06,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,395 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 04:20:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:06,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,402 INFO L272 TraceCheckUtils]: 3: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L272 TraceCheckUtils]: 7: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L272 TraceCheckUtils]: 11: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L272 TraceCheckUtils]: 17: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L272 TraceCheckUtils]: 25: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,406 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:06,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:06,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,406 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,407 INFO L272 TraceCheckUtils]: 34: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,408 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,409 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:06,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,409 INFO L272 TraceCheckUtils]: 3: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,410 INFO L272 TraceCheckUtils]: 7: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,412 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:06,413 INFO L272 TraceCheckUtils]: 13: Hoare triple {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,413 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,415 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,415 INFO L272 TraceCheckUtils]: 21: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:06,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,416 INFO L272 TraceCheckUtils]: 25: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,416 INFO L272 TraceCheckUtils]: 29: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L272 TraceCheckUtils]: 33: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L272 TraceCheckUtils]: 39: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,418 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L272 TraceCheckUtils]: 47: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:06,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,420 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,420 INFO L272 TraceCheckUtils]: 56: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,420 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,421 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,422 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:06,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:06,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:06,423 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:06,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L272 TraceCheckUtils]: 8: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,424 INFO L272 TraceCheckUtils]: 12: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,425 INFO L272 TraceCheckUtils]: 16: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,427 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:06,428 INFO L272 TraceCheckUtils]: 22: Hoare triple {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,428 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,430 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,430 INFO L272 TraceCheckUtils]: 30: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:06,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,431 INFO L272 TraceCheckUtils]: 34: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,431 INFO L272 TraceCheckUtils]: 38: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L272 TraceCheckUtils]: 42: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,432 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L272 TraceCheckUtils]: 48: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,433 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L272 TraceCheckUtils]: 56: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:06,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,435 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:06,435 INFO L272 TraceCheckUtils]: 65: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,436 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,436 INFO L290 TraceCheckUtils]: 70: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,437 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:06,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:06,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:06,437 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 33 proven. 38 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-02-21 04:20:06,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:06,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584993150] [2022-02-21 04:20:06,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584993150] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:06,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980358348] [2022-02-21 04:20:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:06,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:06,441 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:06,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-02-21 04:20:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:06,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:06,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L272 TraceCheckUtils]: 8: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,786 INFO L272 TraceCheckUtils]: 12: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} ~n := #in~n; {21971#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:06,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {21971#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {21971#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:06,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {21971#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {21971#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:06,787 INFO L272 TraceCheckUtils]: 16: Hoare triple {21971#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {21718#true} ~n := #in~n; {21984#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:06,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {21984#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {21984#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:06,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {21984#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,789 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21971#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,789 INFO L272 TraceCheckUtils]: 22: Hoare triple {21858#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,790 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21858#(<= |fibo1_#in~n| 2)} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,791 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,791 INFO L272 TraceCheckUtils]: 30: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} ~n := #in~n; {22027#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {22027#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {22027#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {22027#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {22027#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,792 INFO L272 TraceCheckUtils]: 34: Hoare triple {22027#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {22040#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {22040#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,793 INFO L272 TraceCheckUtils]: 38: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L272 TraceCheckUtils]: 42: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L272 TraceCheckUtils]: 48: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,795 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,795 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #46#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,795 INFO L272 TraceCheckUtils]: 56: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,796 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #48#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume true; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,798 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22044#(<= 1 |fibo2_#in~n|)} {22027#(<= fibo1_~n |fibo1_#in~n|)} #50#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,798 INFO L272 TraceCheckUtils]: 65: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,799 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21718#true} {21897#(<= 2 |fibo1_#in~n|)} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,800 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:06,800 INFO L290 TraceCheckUtils]: 73: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:06,800 INFO L290 TraceCheckUtils]: 74: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:06,800 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 44 proven. 47 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-21 04:20:06,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:07,823 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:07,824 INFO L290 TraceCheckUtils]: 74: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:07,824 INFO L290 TraceCheckUtils]: 73: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:07,825 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:07,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:07,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:07,826 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21718#true} {21897#(<= 2 |fibo1_#in~n|)} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:07,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:07,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:07,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,826 INFO L272 TraceCheckUtils]: 65: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:07,827 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22044#(<= 1 |fibo2_#in~n|)} {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} #50#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:07,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume true; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,828 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #48#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:07,828 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:07,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:07,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,828 INFO L272 TraceCheckUtils]: 56: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:07,829 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #46#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:07,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:07,829 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L272 TraceCheckUtils]: 48: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,830 INFO L272 TraceCheckUtils]: 42: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:07,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:07,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,831 INFO L272 TraceCheckUtils]: 38: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {22289#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {22289#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:07,832 INFO L272 TraceCheckUtils]: 34: Hoare triple {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(1 == ~n); {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:07,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(~n < 1); {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:07,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} ~n := #in~n; {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:07,833 INFO L272 TraceCheckUtils]: 30: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:07,833 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:07,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:07,834 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21858#(<= |fibo1_#in~n| 2)} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:07,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:07,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:07,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,835 INFO L272 TraceCheckUtils]: 22: Hoare triple {21858#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:07,835 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} #50#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:07,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:07,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:07,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:07,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {21718#true} ~n := #in~n; {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:07,837 INFO L272 TraceCheckUtils]: 16: Hoare triple {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:07,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} ~n := #in~n; {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:07,838 INFO L272 TraceCheckUtils]: 12: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L272 TraceCheckUtils]: 8: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:07,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:07,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:07,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:07,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 44 proven. 47 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-21 04:20:07,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980358348] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:07,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:07,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-02-21 04:20:07,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489908152] [2022-02-21 04:20:07,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:07,840 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:20:07,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:07,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-21 04:20:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-02-21 04:20:07,841 INFO L87 Difference]: Start difference. First operand 394 states and 539 transitions. cyclomatic complexity: 152 Second operand has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:08,740 INFO L93 Difference]: Finished difference Result 445 states and 553 transitions. [2022-02-21 04:20:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 04:20:08,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:08,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:08,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 553 transitions. [2022-02-21 04:20:08,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2022-02-21 04:20:08,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 299 states and 359 transitions. [2022-02-21 04:20:08,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-02-21 04:20:08,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-02-21 04:20:08,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 359 transitions. [2022-02-21 04:20:08,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:08,818 INFO L681 BuchiCegarLoop]: Abstraction has 299 states and 359 transitions. [2022-02-21 04:20:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 359 transitions. [2022-02-21 04:20:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2022-02-21 04:20:08,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:08,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states and 359 transitions. Second operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:08,822 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states and 359 transitions. Second operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:08,823 INFO L87 Difference]: Start difference. First operand 299 states and 359 transitions. Second operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:08,823 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:08,841 INFO L93 Difference]: Finished difference Result 620 states and 758 transitions. [2022-02-21 04:20:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 758 transitions. [2022-02-21 04:20:08,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:08,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:08,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) Second operand 299 states and 359 transitions. [2022-02-21 04:20:08,844 INFO L87 Difference]: Start difference. First operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) Second operand 299 states and 359 transitions. [2022-02-21 04:20:08,844 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:08,863 INFO L93 Difference]: Finished difference Result 630 states and 774 transitions. [2022-02-21 04:20:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 774 transitions. [2022-02-21 04:20:08,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:08,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:08,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:08,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2022-02-21 04:20:08,871 INFO L704 BuchiCegarLoop]: Abstraction has 277 states and 332 transitions. [2022-02-21 04:20:08,871 INFO L587 BuchiCegarLoop]: Abstraction has 277 states and 332 transitions. [2022-02-21 04:20:08,871 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:20:08,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. [2022-02-21 04:20:08,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-02-21 04:20:08,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:08,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:08,873 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:08,873 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:08,873 INFO L791 eck$LassoCheckResult]: Stem: 22868#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); 22869#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 := 6; 22900#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 22951#fibo1ENTRY ~n := #in~n; 23006#L10 assume !(~n < 1); 23005#L12 assume !(1 == ~n); 23001#L15 call #t~ret4 := fibo2(~n - 1);< 23004#fibo2ENTRY ~n := #in~n; 23003#L20 assume !(~n < 1); 23002#L22 assume !(1 == ~n); 22997#L25 call #t~ret6 := fibo1(~n - 1);< 23000#fibo1ENTRY ~n := #in~n; 22999#L10 assume !(~n < 1); 22998#L12 assume !(1 == ~n); 22989#L15 call #t~ret4 := fibo2(~n - 1);< 22996#fibo2ENTRY ~n := #in~n; 22995#L20 assume !(~n < 1); 22988#L22 assume !(1 == ~n); 22902#L25 call #t~ret6 := fibo1(~n - 1);< 22972#fibo1ENTRY ~n := #in~n; 22973#L10 assume !(~n < 1); 23082#L12 assume !(1 == ~n); 22943#L15 call #t~ret4 := fibo2(~n - 1);< 22942#fibo2ENTRY ~n := #in~n; 22944#L20 assume !(~n < 1); 23136#L22 assume 1 == ~n;#res := 1; 23134#fibo2FINAL assume true; 23124#fibo2EXIT >#50#return; 22901#L15-1 call #t~ret5 := fibo2(~n - 2);< 22905#fibo2ENTRY ~n := #in~n; 23073#L20 assume ~n < 1;#res := 0; 23072#fibo2FINAL assume true; 23071#fibo2EXIT >#52#return; 23070#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 23069#fibo1FINAL assume true; 23068#fibo1EXIT >#46#return; 23009#L25-1 call #t~ret7 := fibo1(~n - 2);< 23066#fibo1ENTRY ~n := #in~n; 23011#L10 assume !(~n < 1); 23007#L12 assume !(1 == ~n); 22910#L15 call #t~ret4 := fibo2(~n - 1);< 22983#fibo2ENTRY ~n := #in~n; 22984#L20 assume !(~n < 1); 22976#L22 assume 1 == ~n;#res := 1; 22977#fibo2FINAL assume true; 23105#fibo2EXIT >#50#return; 22920#L15-1 [2022-02-21 04:20:08,873 INFO L793 eck$LassoCheckResult]: Loop: 22920#L15-1 call #t~ret5 := fibo2(~n - 2);< 23037#fibo2ENTRY ~n := #in~n; 23064#L20 assume !(~n < 1); 23022#L22 assume !(1 == ~n); 22898#L25 call #t~ret6 := fibo1(~n - 1);< 23087#fibo1ENTRY ~n := #in~n; 23078#L10 assume !(~n < 1); 23079#L12 assume !(1 == ~n); 22923#L15 call #t~ret4 := fibo2(~n - 1);< 23043#fibo2ENTRY ~n := #in~n; 23062#L20 assume !(~n < 1); 23058#L22 assume 1 == ~n;#res := 1; 23050#fibo2FINAL assume true; 23041#fibo2EXIT >#50#return; 22920#L15-1 [2022-02-21 04:20:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 881386511, now seen corresponding path program 1 times [2022-02-21 04:20:08,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:08,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443857775] [2022-02-21 04:20:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 04:20:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,010 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L272 TraceCheckUtils]: 3: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L272 TraceCheckUtils]: 9: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:09,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,015 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-21 04:20:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,018 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25454#true} {25455#false} #50#return; {25455#false} is VALID [2022-02-21 04:20:09,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#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); {25454#true} is VALID [2022-02-21 04:20:09,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#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 := 6; {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:09,019 INFO L272 TraceCheckUtils]: 2: Hoare triple {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25457#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:09,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {25457#(<= |fibo1_#in~n| 6)} ~n := #in~n; {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {25458#(<= fibo1_~n 6)} assume !(~n < 1); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {25458#(<= fibo1_~n 6)} assume !(1 == ~n); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {25458#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {25459#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:09,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {25459#(<= |fibo2_#in~n| 5)} ~n := #in~n; {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {25460#(<= fibo2_~n 5)} assume !(~n < 1); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {25460#(<= fibo2_~n 5)} assume !(1 == ~n); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,022 INFO L272 TraceCheckUtils]: 10: Hoare triple {25460#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {25461#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:09,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {25461#(<= |fibo1_#in~n| 4)} ~n := #in~n; {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {25462#(<= fibo1_~n 4)} assume !(~n < 1); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {25462#(<= fibo1_~n 4)} assume !(1 == ~n); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,023 INFO L272 TraceCheckUtils]: 14: Hoare triple {25462#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {25463#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:09,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {25463#(<= |fibo2_#in~n| 3)} ~n := #in~n; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {25464#(<= fibo2_~n 3)} assume !(~n < 1); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {25464#(<= fibo2_~n 3)} assume !(1 == ~n); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,024 INFO L272 TraceCheckUtils]: 18: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L272 TraceCheckUtils]: 22: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L272 TraceCheckUtils]: 28: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:09,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,026 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:09,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:09,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,026 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,027 INFO L272 TraceCheckUtils]: 36: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {25482#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:09,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {25482#(<= |fibo1_#in~n| 1)} ~n := #in~n; {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {25483#(<= fibo1_~n 1)} assume !(~n < 1); {25484#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:09,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {25484#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} assume !(1 == ~n); {25455#false} is VALID [2022-02-21 04:20:09,028 INFO L272 TraceCheckUtils]: 40: Hoare triple {25455#false} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,028 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25454#true} {25455#false} #50#return; {25455#false} is VALID [2022-02-21 04:20:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 04:20:09,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:09,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443857775] [2022-02-21 04:20:09,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443857775] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:09,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150209005] [2022-02-21 04:20:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,031 INFO L229 MonitoredProcess]: Starting monitored process 55 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:09,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-02-21 04:20:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:09,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#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); {25454#true} is VALID [2022-02-21 04:20:09,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#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 := 6; {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:09,315 INFO L272 TraceCheckUtils]: 2: Hoare triple {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25457#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:09,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {25457#(<= |fibo1_#in~n| 6)} ~n := #in~n; {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {25458#(<= fibo1_~n 6)} assume !(~n < 1); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {25458#(<= fibo1_~n 6)} assume !(1 == ~n); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {25458#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {25459#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:09,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {25459#(<= |fibo2_#in~n| 5)} ~n := #in~n; {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {25460#(<= fibo2_~n 5)} assume !(~n < 1); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {25460#(<= fibo2_~n 5)} assume !(1 == ~n); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,318 INFO L272 TraceCheckUtils]: 10: Hoare triple {25460#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {25461#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:09,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {25461#(<= |fibo1_#in~n| 4)} ~n := #in~n; {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {25462#(<= fibo1_~n 4)} assume !(~n < 1); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {25462#(<= fibo1_~n 4)} assume !(1 == ~n); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,320 INFO L272 TraceCheckUtils]: 14: Hoare triple {25462#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {25463#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:09,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {25463#(<= |fibo2_#in~n| 3)} ~n := #in~n; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {25464#(<= fibo2_~n 3)} assume !(~n < 1); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {25464#(<= fibo2_~n 3)} assume !(1 == ~n); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,321 INFO L272 TraceCheckUtils]: 18: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:09,321 INFO L272 TraceCheckUtils]: 22: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L272 TraceCheckUtils]: 28: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:09,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,323 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,323 INFO L272 TraceCheckUtils]: 36: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {25482#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:09,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {25482#(<= |fibo1_#in~n| 1)} ~n := #in~n; {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {25483#(<= fibo1_~n 1)} assume !(~n < 1); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {25483#(<= fibo1_~n 1)} assume !(1 == ~n); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,325 INFO L272 TraceCheckUtils]: 40: Hoare triple {25483#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {25454#true} ~n := #in~n; {25625#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {25625#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume true; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,326 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25629#(<= 1 |fibo2_#in~n|)} {25483#(<= fibo1_~n 1)} #50#return; {25455#false} is VALID [2022-02-21 04:20:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:20:09,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:09,663 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25629#(<= 1 |fibo2_#in~n|)} {25483#(<= fibo1_~n 1)} #50#return; {25455#false} is VALID [2022-02-21 04:20:09,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume true; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {25651#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:09,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {25454#true} ~n := #in~n; {25651#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:09,664 INFO L272 TraceCheckUtils]: 40: Hoare triple {25483#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {25483#(<= fibo1_~n 1)} assume !(1 == ~n); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {25483#(<= fibo1_~n 1)} assume !(~n < 1); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {25482#(<= |fibo1_#in~n| 1)} ~n := #in~n; {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:09,665 INFO L272 TraceCheckUtils]: 36: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {25482#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:09,666 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:09,666 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:09,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:09,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,666 INFO L272 TraceCheckUtils]: 28: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L272 TraceCheckUtils]: 22: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:09,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {25454#true} is VALID [2022-02-21 04:20:09,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {25464#(<= fibo2_~n 3)} assume !(1 == ~n); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {25464#(<= fibo2_~n 3)} assume !(~n < 1); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {25463#(<= |fibo2_#in~n| 3)} ~n := #in~n; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:09,670 INFO L272 TraceCheckUtils]: 14: Hoare triple {25462#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {25463#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:09,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {25462#(<= fibo1_~n 4)} assume !(1 == ~n); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {25462#(<= fibo1_~n 4)} assume !(~n < 1); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {25461#(<= |fibo1_#in~n| 4)} ~n := #in~n; {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:09,671 INFO L272 TraceCheckUtils]: 10: Hoare triple {25460#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {25461#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:09,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {25460#(<= fibo2_~n 5)} assume !(1 == ~n); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {25460#(<= fibo2_~n 5)} assume !(~n < 1); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {25459#(<= |fibo2_#in~n| 5)} ~n := #in~n; {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:09,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {25458#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {25459#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:09,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {25458#(<= fibo1_~n 6)} assume !(1 == ~n); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {25458#(<= fibo1_~n 6)} assume !(~n < 1); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {25457#(<= |fibo1_#in~n| 6)} ~n := #in~n; {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:09,673 INFO L272 TraceCheckUtils]: 2: Hoare triple {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25457#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:09,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#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 := 6; {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:09,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#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); {25454#true} is VALID [2022-02-21 04:20:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:20:09,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150209005] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:09,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:09,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 17 [2022-02-21 04:20:09,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332640307] [2022-02-21 04:20:09,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:09,675 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2022-02-21 04:20:09,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:09,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781431250] [2022-02-21 04:20:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:09,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:09,681 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:09,809 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:09,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:09,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:09,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:09,810 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:09,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:09,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:09,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration7_Loop [2022-02-21 04:20:09,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:09,810 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:09,811 INFO L141 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,823 INFO L141 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,825 INFO L141 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,826 INFO L141 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,830 INFO L141 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,832 INFO L141 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,837 INFO L141 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,840 INFO L141 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,841 INFO L141 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,884 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:09,884 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:09,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,886 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:09,887 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:09,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,895 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,895 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,911 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:09,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,912 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:09,912 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:09,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,935 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,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 04:20:09,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,952 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:09,953 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:09,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,961 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:09,976 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:09,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,978 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:09,979 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:09,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:09,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,998 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:09,998 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:10,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:10,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,016 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:10,017 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:10,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:10,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:10,066 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:10,066 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:10,082 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:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,084 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:10,085 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:10,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:10,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:10,098 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:10,098 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:10,114 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:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,116 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:10,117 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:10,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:10,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:10,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 04:20:10,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,144 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:10,148 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:10,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:10,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:10,890 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:10,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 04:20:10,894 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:10,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:10,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:10,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:10,894 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:10,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:10,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:10,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration7_Loop [2022-02-21 04:20:10,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:10,894 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:10,895 INFO L141 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,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:10,897 INFO L141 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,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:10,902 INFO L141 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,904 INFO L141 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,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:10,907 INFO L141 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,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:10,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:10,981 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:10,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:10,983 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:10,983 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:10,985 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,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:10,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:10,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:10,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:10,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:10,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:10,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:10,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:11,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 04:20:11,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:11,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:11,009 INFO L229 MonitoredProcess]: Starting monitored process 65 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:11,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:20:11,011 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:11,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:11,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:11,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:11,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:11,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:11,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:11,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:11,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:11,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-02-21 04:20:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:11,057 INFO L229 MonitoredProcess]: Starting monitored process 66 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:11,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:20:11,059 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:11,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:11,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:11,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:11,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:11,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:11,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:11,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:11,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:11,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:11,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:11,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:11,117 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:11,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:20:11,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:11,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:11,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:11,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:11,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:11,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:11,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:11,148 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:11,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:11,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:20:11,168 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:20:11,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:11,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:11,180 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:11,181 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:11,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:11,182 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:11,182 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:11,182 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:11,198 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:11,202 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:11,205 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:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,405 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:11,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {25774#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); {25774#unseeded} is VALID [2022-02-21 04:20:11,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {25774#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 := 6; {25774#unseeded} is VALID [2022-02-21 04:20:11,558 INFO L272 TraceCheckUtils]: 2: Hoare triple {25774#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25774#unseeded} is VALID [2022-02-21 04:20:11,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,561 INFO L272 TraceCheckUtils]: 10: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,562 INFO L272 TraceCheckUtils]: 14: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,564 INFO L272 TraceCheckUtils]: 18: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,565 INFO L272 TraceCheckUtils]: 22: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,568 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,568 INFO L272 TraceCheckUtils]: 28: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,570 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,571 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #46#return; {25774#unseeded} is VALID [2022-02-21 04:20:11,572 INFO L272 TraceCheckUtils]: 36: Hoare triple {25774#unseeded} call #t~ret7 := fibo1(~n - 2); {25774#unseeded} is VALID [2022-02-21 04:20:11,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,573 INFO L272 TraceCheckUtils]: 40: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,575 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #50#return; {25774#unseeded} is VALID [2022-02-21 04:20:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {25777#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {25928#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:11,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {25928#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {25932#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {25932#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {25932#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {25932#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {25932#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {25932#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {25942#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:11,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {25942#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {25946#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {25946#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {25946#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {25946#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {25946#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,796 INFO L272 TraceCheckUtils]: 8: Hoare triple {25946#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {25956#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:11,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {25956#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25960#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {25960#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,798 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {25946#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {25787#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:11,799 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,799 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:11,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,823 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:11,823 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,325 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61. 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1005 states and 1188 transitions. Complement of second has 40 states. [2022-02-21 04:20:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:12,325 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:12,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,325 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:12,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1005 states and 1188 transitions. [2022-02-21 04:20:12,332 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 137 [2022-02-21 04:20:12,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:12,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:12,333 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:12,356 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:20:12,356 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:12,359 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:12,360 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 [2022-02-21 04:20:12,396 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 114 examples of accepted words. [2022-02-21 04:20:12,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 1005 letters. Loop has 1005 letters. [2022-02-21 04:20:12,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 1005 letters. Loop has 1005 letters. [2022-02-21 04:20:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 1005 letters. Loop has 1005 letters. [2022-02-21 04:20:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:12,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:12,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:12,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:12,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:12,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:12,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:12,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:12,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:12,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:12,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:12,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:12,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:12,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:12,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:12,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:12,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:12,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 14 letters. [2022-02-21 04:20:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 14 letters. [2022-02-21 04:20:12,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 65 letters. Loop has 14 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:12,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:12,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:12,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 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,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:12,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:12,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:12,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:12,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:12,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:12,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:12,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:12,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:12,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:12,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:12,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:12,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:12,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:12,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:12,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:12,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:12,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:12,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:12,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:12,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:12,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:12,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:12,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:12,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:12,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:12,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:12,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:12,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:12,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:12,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:12,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:12,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,610 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,610 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-21 04:20:12,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,611 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:12,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {25774#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); {25774#unseeded} is VALID [2022-02-21 04:20:12,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {25774#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 := 6; {25774#unseeded} is VALID [2022-02-21 04:20:12,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {25774#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25774#unseeded} is VALID [2022-02-21 04:20:12,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,930 INFO L272 TraceCheckUtils]: 10: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,931 INFO L272 TraceCheckUtils]: 14: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,933 INFO L272 TraceCheckUtils]: 18: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,934 INFO L272 TraceCheckUtils]: 22: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,937 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,937 INFO L272 TraceCheckUtils]: 28: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,940 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,942 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #46#return; {25774#unseeded} is VALID [2022-02-21 04:20:12,952 INFO L272 TraceCheckUtils]: 36: Hoare triple {25774#unseeded} call #t~ret7 := fibo1(~n - 2); {25774#unseeded} is VALID [2022-02-21 04:20:12,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,953 INFO L272 TraceCheckUtils]: 40: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,955 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #50#return; {25774#unseeded} is VALID [2022-02-21 04:20:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:13,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {25777#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {27177#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:13,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {27177#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {27181#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:13,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {27181#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {27181#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:13,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {27181#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {27181#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:13,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {27181#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {27191#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:13,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {27191#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {27195#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:13,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {27195#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {27195#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:13,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {27195#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {27195#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:13,202 INFO L272 TraceCheckUtils]: 8: Hoare triple {27195#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {27205#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:13,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {27205#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {27209#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:13,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {27209#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:13,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:13,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:13,204 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {27195#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {25787#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:13,204 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:13,205 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:13,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,236 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:13,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,676 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61. 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 621 states and 723 transitions. Complement of second has 26 states. [2022-02-21 04:20:13,676 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:13,676 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:13,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:13,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,677 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:13,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 723 transitions. [2022-02-21 04:20:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 75 [2022-02-21 04:20:13,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,681 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:13,681 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:20:13,681 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:13,682 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:13,682 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 621 states and 723 transitions. cyclomatic complexity: 116 [2022-02-21 04:20:13,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 64 examples of accepted words. [2022-02-21 04:20:13,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:20:13,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:20:13,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:20:13,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:13,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:13,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:13,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:13,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:13,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:13,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:13,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:13,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:13,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:13,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:13,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:13,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 46 letters. [2022-02-21 04:20:13,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 46 letters. [2022-02-21 04:20:13,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 46 letters. [2022-02-21 04:20:13,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:13,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:13,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:13,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:13,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:13,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:13,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:13,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:13,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:13,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:13,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:13,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:13,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:13,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:13,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:13,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:13,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:13,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:13,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,795 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:13,796 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-02-21 04:20:13,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,797 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:13,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:20:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:13,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:14,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {25774#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); {25774#unseeded} is VALID [2022-02-21 04:20:14,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {25774#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 := 6; {25774#unseeded} is VALID [2022-02-21 04:20:14,073 INFO L272 TraceCheckUtils]: 2: Hoare triple {25774#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25774#unseeded} is VALID [2022-02-21 04:20:14,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:14,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:14,074 INFO L272 TraceCheckUtils]: 6: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:14,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:14,076 INFO L272 TraceCheckUtils]: 10: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:14,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:14,077 INFO L272 TraceCheckUtils]: 14: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:14,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:14,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,081 INFO L272 TraceCheckUtils]: 22: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,083 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,086 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #46#return; {25774#unseeded} is VALID [2022-02-21 04:20:14,087 INFO L272 TraceCheckUtils]: 36: Hoare triple {25774#unseeded} call #t~ret7 := fibo1(~n - 2); {25774#unseeded} is VALID [2022-02-21 04:20:14,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:14,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:14,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:14,088 INFO L272 TraceCheckUtils]: 40: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:14,089 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #50#return; {25774#unseeded} is VALID [2022-02-21 04:20:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:14,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {25777#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {28024#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:14,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {28024#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {28028#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:14,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {28028#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {28028#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:14,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {28028#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {28028#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:14,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {28028#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {28038#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:14,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {28038#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {28042#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:14,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {28042#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {28042#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:14,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {28042#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {28042#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:14,233 INFO L272 TraceCheckUtils]: 8: Hoare triple {28042#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {28052#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:14,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {28052#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {28056#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:14,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {28056#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:14,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:14,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:14,235 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {28042#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {25787#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:14,235 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:14,236 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:14,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:14,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,257 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:14,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:14,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61. 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1402 states and 1651 transitions. Complement of second has 102 states. [2022-02-21 04:20:14,831 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:14,831 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:14,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:14,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:14,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:14,832 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:14,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:14,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:14,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:14,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1402 states and 1651 transitions. [2022-02-21 04:20:14,838 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2022-02-21 04:20:14,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:14,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:14,852 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:14,852 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:20:14,852 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:14,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:14,854 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:14,854 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 [2022-02-21 04:20:14,888 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 108 examples of accepted words. [2022-02-21 04:20:14,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:14,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:14,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:14,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:14,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:14,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 1402 letters. Loop has 1402 letters. [2022-02-21 04:20:14,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 1402 letters. Loop has 1402 letters. [2022-02-21 04:20:14,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 1402 letters. Loop has 1402 letters. [2022-02-21 04:20:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:14,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:14,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:14,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:14,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:14,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:14,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:14,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:14,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:14,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:14,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:14,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:14,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:14,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:14,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:14,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:14,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:14,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:14,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:14,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:14,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:14,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:14,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:14,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:14,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:14,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:14,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:14,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:14,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:14,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:14,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:14,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:14,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:14,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:14,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:14,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:14,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:14,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:14,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:14,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:14,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:14,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:14,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:14,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:14,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:14,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:14,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:14,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:14,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:14,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:14,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:14,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:14,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:14,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:14,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:14,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:14,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:14,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:14,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:14,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:14,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:14,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:14,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:14,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:14,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:14,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:14,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:14,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:14,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:14,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:14,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:14,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:14,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:14,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:14,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:14,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:14,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:14,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:14,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:14,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:14,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:14,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:14,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:14,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:14,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:14,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:14,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:14,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:14,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:14,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:14,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:14,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:14,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:14,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:14,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:14,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:14,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:14,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:14,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:14,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:14,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:14,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:14,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:14,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:14,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:14,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:14,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:14,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:14,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:14,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:14,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:14,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:14,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:14,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:14,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:14,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:14,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:14,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:14,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:14,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:14,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:14,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:14,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:14,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:14,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:14,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:14,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:14,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:14,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:14,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:14,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:14,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:14,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:14,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:14,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,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, (11), 5 states have call predecessors, (11), 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:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:14,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:14,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:14,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:14,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:14,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:14,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:14,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:14,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 22 letters. [2022-02-21 04:20:14,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 22 letters. [2022-02-21 04:20:14,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 22 letters. [2022-02-21 04:20:14,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:14,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:14,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:14,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:14,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:14,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:14,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:14,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:14,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:14,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:14,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:14,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:14,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:14,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:14,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:14,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:14,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:14,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:14,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:14,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:14,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:14,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:14,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:14,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:14,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:14,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:14,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:14,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:14,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:14,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:14,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:14,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:14,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:14,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:14,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:14,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:14,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:14,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:14,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:14,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:14,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:14,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:14,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:14,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:14,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:14,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:14,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:14,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:14,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:14,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:14,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:14,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:14,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:14,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:14,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 28 letters. [2022-02-21 04:20:14,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 28 letters. [2022-02-21 04:20:14,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 28 letters. [2022-02-21 04:20:14,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:14,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:14,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:14,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:14,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:14,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:14,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:14,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:14,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:14,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:14,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:14,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:14,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:14,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:14,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:14,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:14,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:14,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:14,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:14,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:14,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:14,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:14,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:14,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:14,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:14,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:14,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:14,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:14,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:14,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:14,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:14,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:14,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:14,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:14,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:14,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:14,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:14,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:14,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:14,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:14,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:14,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:14,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:14,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:14,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:14,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:14,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:14,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:14,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:14,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:14,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:14,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:14,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:14,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:14,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:14,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:14,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:14,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:14,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:14,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:14,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:14,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:14,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:14,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:14,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:14,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:14,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:14,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:14,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:14,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:14,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:14,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:14,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:14,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:14,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:14,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:14,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:14,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:14,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:15,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:15,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:15,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:15,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:15,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:15,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:15,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:15,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:15,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:15,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:15,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:15,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:15,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:15,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:15,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:15,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 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:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:15,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:15,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:15,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:15,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:15,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:15,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:15,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:15,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:15,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:15,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:15,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:15,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:15,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:15,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:15,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:15,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:15,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:15,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,023 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:15,024 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, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-02-21 04:20:15,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:15,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:15,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:15,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:15,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 [2022-02-21 04:20:15,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2022-02-21 04:20:15,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1402 states to 782 states and 926 transitions. [2022-02-21 04:20:15,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2022-02-21 04:20:15,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2022-02-21 04:20:15,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 926 transitions. [2022-02-21 04:20:15,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:15,109 INFO L681 BuchiCegarLoop]: Abstraction has 782 states and 926 transitions. [2022-02-21 04:20:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 926 transitions. [2022-02-21 04:20:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 640. [2022-02-21 04:20:15,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:15,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 782 states and 926 transitions. Second operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:15,120 INFO L74 IsIncluded]: Start isIncluded. First operand 782 states and 926 transitions. Second operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:15,120 INFO L87 Difference]: Start difference. First operand 782 states and 926 transitions. Second operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:15,121 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:15,180 INFO L93 Difference]: Finished difference Result 1351 states and 1613 transitions. [2022-02-21 04:20:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1613 transitions. [2022-02-21 04:20:15,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:15,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:15,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) Second operand 782 states and 926 transitions. [2022-02-21 04:20:15,187 INFO L87 Difference]: Start difference. First operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) Second operand 782 states and 926 transitions. [2022-02-21 04:20:15,188 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:15,267 INFO L93 Difference]: Finished difference Result 1576 states and 1887 transitions. [2022-02-21 04:20:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1887 transitions. [2022-02-21 04:20:15,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:15,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:15,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:15,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 748 transitions. [2022-02-21 04:20:15,288 INFO L704 BuchiCegarLoop]: Abstraction has 640 states and 748 transitions. [2022-02-21 04:20:15,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 04:20:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-02-21 04:20:15,288 INFO L87 Difference]: Start difference. First operand 640 states and 748 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 04:20:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:15,959 INFO L93 Difference]: Finished difference Result 431 states and 477 transitions. [2022-02-21 04:20:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-21 04:20:15,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 04:20:15,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:15,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 477 transitions. [2022-02-21 04:20:16,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:16,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 270 states and 303 transitions. [2022-02-21 04:20:16,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-02-21 04:20:16,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-02-21 04:20:16,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 303 transitions. [2022-02-21 04:20:16,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:16,009 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 303 transitions. [2022-02-21 04:20:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 303 transitions. [2022-02-21 04:20:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 261. [2022-02-21 04:20:16,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:16,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states and 303 transitions. Second operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:16,013 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states and 303 transitions. Second operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:16,013 INFO L87 Difference]: Start difference. First operand 270 states and 303 transitions. Second operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:16,014 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:16,022 INFO L93 Difference]: Finished difference Result 428 states and 494 transitions. [2022-02-21 04:20:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 494 transitions. [2022-02-21 04:20:16,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:16,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:16,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) Second operand 270 states and 303 transitions. [2022-02-21 04:20:16,024 INFO L87 Difference]: Start difference. First operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) Second operand 270 states and 303 transitions. [2022-02-21 04:20:16,024 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:16,032 INFO L93 Difference]: Finished difference Result 428 states and 494 transitions. [2022-02-21 04:20:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 494 transitions. [2022-02-21 04:20:16,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:16,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:16,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:16,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 293 transitions. [2022-02-21 04:20:16,037 INFO L704 BuchiCegarLoop]: Abstraction has 261 states and 293 transitions. [2022-02-21 04:20:16,037 INFO L587 BuchiCegarLoop]: Abstraction has 261 states and 293 transitions. [2022-02-21 04:20:16,037 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:20:16,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. [2022-02-21 04:20:16,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:16,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:16,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:16,039 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:16,039 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:16,039 INFO L791 eck$LassoCheckResult]: Stem: 35741#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); 35742#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 := 6; 35774#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 35816#fibo1ENTRY ~n := #in~n; 35966#L10 assume !(~n < 1); 35964#L12 assume !(1 == ~n); 35878#L15 call #t~ret4 := fibo2(~n - 1);< 35879#fibo2ENTRY ~n := #in~n; 35929#L20 assume !(~n < 1); 35927#L22 assume !(1 == ~n); 35907#L25 call #t~ret6 := fibo1(~n - 1);< 35916#fibo1ENTRY ~n := #in~n; 35915#L10 assume !(~n < 1); 35914#L12 assume !(1 == ~n); 35904#L15 call #t~ret4 := fibo2(~n - 1);< 35912#fibo2ENTRY ~n := #in~n; 35913#L20 assume !(~n < 1); 35908#L22 assume !(1 == ~n); 35799#L25 call #t~ret6 := fibo1(~n - 1);< 35890#fibo1ENTRY ~n := #in~n; 35884#L10 assume !(~n < 1); 35883#L12 assume !(1 == ~n); 35798#L15 call #t~ret4 := fibo2(~n - 1);< 35800#fibo2ENTRY ~n := #in~n; 35971#L20 assume !(~n < 1); 35963#L22 assume 1 == ~n;#res := 1; 35946#fibo2FINAL assume true; 35944#fibo2EXIT >#50#return; 35939#L15-1 call #t~ret5 := fibo2(~n - 2);< 35940#fibo2ENTRY ~n := #in~n; 35945#L20 assume ~n < 1;#res := 0; 35943#fibo2FINAL assume true; 35938#fibo2EXIT >#52#return; 35935#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 35931#fibo1FINAL assume true; 35924#fibo1EXIT >#46#return; 35922#L25-1 call #t~ret7 := fibo1(~n - 2);< 35923#fibo1ENTRY ~n := #in~n; 35930#L10 assume !(~n < 1); 35928#L12 assume 1 == ~n;#res := 1; 35926#fibo1FINAL assume true; 35921#fibo1EXIT >#48#return; 35920#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 35919#fibo2FINAL assume true; 35911#fibo2EXIT >#50#return; 35786#L15-1 call #t~ret5 := fibo2(~n - 2);< 35899#fibo2ENTRY ~n := #in~n; 35958#L20 assume !(~n < 1); 35956#L22 assume 1 == ~n;#res := 1; 35955#fibo2FINAL assume true; 35952#fibo2EXIT >#52#return; 35898#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 35950#fibo1FINAL assume true; 35948#fibo1EXIT >#46#return; 35886#L25-1 call #t~ret7 := fibo1(~n - 2);< 35759#fibo1ENTRY ~n := #in~n; 35918#L10 assume !(~n < 1); 35910#L12 assume !(1 == ~n); 35897#L15 call #t~ret4 := fibo2(~n - 1);< 35906#fibo2ENTRY [2022-02-21 04:20:16,039 INFO L793 eck$LassoCheckResult]: Loop: 35906#fibo2ENTRY ~n := #in~n; 35941#L20 assume !(~n < 1); 35936#L22 assume !(1 == ~n); 35811#L25 call #t~ret6 := fibo1(~n - 1);< 35942#fibo1ENTRY ~n := #in~n; 35937#L10 assume !(~n < 1); 35933#L12 assume !(1 == ~n); 35896#L15 call #t~ret4 := fibo2(~n - 1);< 35906#fibo2ENTRY [2022-02-21 04:20:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 699178782, now seen corresponding path program 1 times [2022-02-21 04:20:16,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:16,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959857832] [2022-02-21 04:20:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:20:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,175 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:16,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:16,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,180 INFO L272 TraceCheckUtils]: 3: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,181 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,181 INFO L272 TraceCheckUtils]: 9: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:16,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,183 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,184 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:16,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,189 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,190 INFO L272 TraceCheckUtils]: 3: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:16,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,191 INFO L272 TraceCheckUtils]: 7: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,192 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,192 INFO L272 TraceCheckUtils]: 13: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:16,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,193 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,194 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:16,194 INFO L272 TraceCheckUtils]: 21: Hoare triple {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,195 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} assume true; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,196 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {37679#(<= 3 |fibo2_#in~n|)} {37569#true} #50#return; {37649#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 04:20:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,211 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37649#(<= 4 fibo1_~n)} #52#return; {37570#false} is VALID [2022-02-21 04:20:16,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:16,211 INFO L272 TraceCheckUtils]: 3: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,212 INFO L272 TraceCheckUtils]: 7: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:16,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,213 INFO L272 TraceCheckUtils]: 11: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,214 INFO L272 TraceCheckUtils]: 17: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:16,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,215 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,217 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:16,217 INFO L272 TraceCheckUtils]: 25: Hoare triple {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,218 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} assume true; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,219 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37679#(<= 3 |fibo2_#in~n|)} {37569#true} #50#return; {37649#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:16,219 INFO L272 TraceCheckUtils]: 34: Hoare triple {37649#(<= 4 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,221 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37649#(<= 4 fibo1_~n)} #52#return; {37570#false} is VALID [2022-02-21 04:20:16,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {37570#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37570#false} is VALID [2022-02-21 04:20:16,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {37570#false} assume true; {37570#false} is VALID [2022-02-21 04:20:16,221 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37570#false} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:16,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#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); {37569#true} is VALID [2022-02-21 04:20:16,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#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 := 6; {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:16,222 INFO L272 TraceCheckUtils]: 2: Hoare triple {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {37572#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {37572#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:16,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(~n < 1); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:16,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(1 == ~n); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:16,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {37573#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37574#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {37574#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:16,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(~n < 1); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:16,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(1 == ~n); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:16,224 INFO L272 TraceCheckUtils]: 10: Hoare triple {37575#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:16,225 INFO L272 TraceCheckUtils]: 14: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,225 INFO L272 TraceCheckUtils]: 18: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:16,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,227 INFO L272 TraceCheckUtils]: 22: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,228 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,228 INFO L272 TraceCheckUtils]: 28: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:16,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,229 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,230 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:16,230 INFO L272 TraceCheckUtils]: 36: Hoare triple {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,231 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} assume true; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,232 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {37679#(<= 3 |fibo2_#in~n|)} {37569#true} #50#return; {37649#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:16,232 INFO L272 TraceCheckUtils]: 45: Hoare triple {37649#(<= 4 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,234 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37649#(<= 4 fibo1_~n)} #52#return; {37570#false} is VALID [2022-02-21 04:20:16,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {37570#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37570#false} is VALID [2022-02-21 04:20:16,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {37570#false} assume true; {37570#false} is VALID [2022-02-21 04:20:16,234 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37570#false} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:16,234 INFO L272 TraceCheckUtils]: 54: Hoare triple {37570#false} call #t~ret7 := fibo1(~n - 2); {37570#false} is VALID [2022-02-21 04:20:16,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {37570#false} ~n := #in~n; {37570#false} is VALID [2022-02-21 04:20:16,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {37570#false} assume !(~n < 1); {37570#false} is VALID [2022-02-21 04:20:16,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {37570#false} assume !(1 == ~n); {37570#false} is VALID [2022-02-21 04:20:16,235 INFO L272 TraceCheckUtils]: 58: Hoare triple {37570#false} call #t~ret4 := fibo2(~n - 1); {37570#false} is VALID [2022-02-21 04:20:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 35 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-21 04:20:16,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:16,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959857832] [2022-02-21 04:20:16,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959857832] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:16,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317465879] [2022-02-21 04:20:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:16,237 INFO L229 MonitoredProcess]: Starting monitored process 69 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:16,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-02-21 04:20:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:16,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#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); {37569#true} is VALID [2022-02-21 04:20:16,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#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 := 6; {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:16,533 INFO L272 TraceCheckUtils]: 2: Hoare triple {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {37572#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:16,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {37572#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:16,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(~n < 1); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:16,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(1 == ~n); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:16,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {37573#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37574#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:16,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {37574#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:16,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(~n < 1); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:16,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(1 == ~n); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:16,536 INFO L272 TraceCheckUtils]: 10: Hoare triple {37575#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} ~n := #in~n; {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:16,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:16,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:16,537 INFO L272 TraceCheckUtils]: 14: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:16,537 INFO L272 TraceCheckUtils]: 18: Hoare triple {37569#true} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L272 TraceCheckUtils]: 22: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37569#true} {37569#true} #50#return; {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L272 TraceCheckUtils]: 28: Hoare triple {37569#true} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37569#true} {37569#true} #52#return; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {37569#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37569#true} {37569#true} #46#return; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L272 TraceCheckUtils]: 36: Hoare triple {37569#true} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:16,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:16,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,540 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37569#true} {37569#true} #48#return; {37569#true} is VALID [2022-02-21 04:20:16,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {37569#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37569#true} is VALID [2022-02-21 04:20:16,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:16,541 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {37569#true} {37730#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:16,541 INFO L272 TraceCheckUtils]: 45: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:16,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {37569#true} ~n := #in~n; {37836#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:16,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {37836#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {37836#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:16,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {37836#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:16,543 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37730#(<= |fibo1_#in~n| fibo1_~n)} #52#return; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:16,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {37849#(<= |fibo1_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:16,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {37849#(<= |fibo1_#in~n| 3)} assume true; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:16,545 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37849#(<= |fibo1_#in~n| 3)} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:16,545 INFO L272 TraceCheckUtils]: 54: Hoare triple {37570#false} call #t~ret7 := fibo1(~n - 2); {37570#false} is VALID [2022-02-21 04:20:16,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {37570#false} ~n := #in~n; {37570#false} is VALID [2022-02-21 04:20:16,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {37570#false} assume !(~n < 1); {37570#false} is VALID [2022-02-21 04:20:16,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {37570#false} assume !(1 == ~n); {37570#false} is VALID [2022-02-21 04:20:16,545 INFO L272 TraceCheckUtils]: 58: Hoare triple {37570#false} call #t~ret4 := fibo2(~n - 1); {37570#false} is VALID [2022-02-21 04:20:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 04:20:16,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:17,136 INFO L272 TraceCheckUtils]: 58: Hoare triple {37570#false} call #t~ret4 := fibo2(~n - 1); {37570#false} is VALID [2022-02-21 04:20:17,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {37570#false} assume !(1 == ~n); {37570#false} is VALID [2022-02-21 04:20:17,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {37570#false} assume !(~n < 1); {37570#false} is VALID [2022-02-21 04:20:17,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {37570#false} ~n := #in~n; {37570#false} is VALID [2022-02-21 04:20:17,136 INFO L272 TraceCheckUtils]: 54: Hoare triple {37570#false} call #t~ret7 := fibo1(~n - 2); {37570#false} is VALID [2022-02-21 04:20:17,137 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37849#(<= |fibo1_#in~n| 3)} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:17,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {37849#(<= |fibo1_#in~n| 3)} assume true; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:17,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {37849#(<= |fibo1_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:17,138 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #52#return; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:17,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:17,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:17,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:17,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {37569#true} ~n := #in~n; {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:17,140 INFO L272 TraceCheckUtils]: 45: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:17,140 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {37569#true} {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #50#return; {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:17,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {37569#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37569#true} {37569#true} #48#return; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L272 TraceCheckUtils]: 36: Hoare triple {37569#true} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37569#true} {37569#true} #46#return; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {37569#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37569#true} {37569#true} #52#return; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L272 TraceCheckUtils]: 28: Hoare triple {37569#true} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37569#true} {37569#true} #50#return; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L272 TraceCheckUtils]: 22: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L272 TraceCheckUtils]: 18: Hoare triple {37569#true} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:17,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:17,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:17,142 INFO L272 TraceCheckUtils]: 14: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:17,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(1 == ~n); {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:17,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(~n < 1); {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:17,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} ~n := #in~n; {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:17,143 INFO L272 TraceCheckUtils]: 10: Hoare triple {37575#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:17,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(1 == ~n); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:17,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(~n < 1); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:17,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {37574#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:17,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {37573#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37574#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:17,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(1 == ~n); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:17,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(~n < 1); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:17,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {37572#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:17,146 INFO L272 TraceCheckUtils]: 2: Hoare triple {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {37572#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:17,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#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 := 6; {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:17,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#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); {37569#true} is VALID [2022-02-21 04:20:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 04:20:17,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317465879] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:17,147 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:17,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 21 [2022-02-21 04:20:17,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192126772] [2022-02-21 04:20:17,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:17,148 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 3 times [2022-02-21 04:20:17,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:17,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376870577] [2022-02-21 04:20:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:17,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:17,152 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:17,276 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:17,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:17,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:17,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:17,276 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:17,276 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:17,276 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:17,276 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:17,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration8_Loop [2022-02-21 04:20:17,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:17,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:17,277 INFO L141 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:17,283 INFO L141 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:17,285 INFO L141 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:17,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:20:17,288 INFO L141 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:17,290 INFO L141 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:17,291 INFO L141 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:17,293 INFO L141 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:17,295 INFO L141 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:17,296 INFO L141 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:17,368 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:17,368 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:17,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:17,370 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:17,371 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:17,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:17,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:17,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-02-21 04:20:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:17,395 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:17,396 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:17,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:17,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:17,452 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:17,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 04:20:17,456 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:17,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:17,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:17,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:17,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:17,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:17,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:17,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:17,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration8_Loop [2022-02-21 04:20:17,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:17,456 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:17,456 INFO L141 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:17,462 INFO L141 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:17,463 INFO L141 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:17,465 INFO L141 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:17,466 INFO L141 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:17,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:20:17,469 INFO L141 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:17,470 INFO L141 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:17,472 INFO L141 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:17,473 INFO L141 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:17,558 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:17,558 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:17,560 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:17,561 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:17,562 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:17,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:17,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:17,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:17,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:17,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:17,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:17,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:17,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:17,580 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:20:17,580 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:20:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:17,582 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:17,582 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:17,583 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:17,583 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:17,583 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:17,583 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2022-02-21 04:20:17,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 04:20:17,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:17,603 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:20:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:20:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {38049#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); {38049#unseeded} is VALID [2022-02-21 04:20:18,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {38049#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 := 6; {38049#unseeded} is VALID [2022-02-21 04:20:18,118 INFO L272 TraceCheckUtils]: 2: Hoare triple {38049#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {38049#unseeded} is VALID [2022-02-21 04:20:18,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:18,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:18,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:18,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:18,120 INFO L272 TraceCheckUtils]: 10: Hoare triple {38049#unseeded} call #t~ret6 := fibo1(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,122 INFO L272 TraceCheckUtils]: 14: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,123 INFO L272 TraceCheckUtils]: 18: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,124 INFO L272 TraceCheckUtils]: 22: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,127 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,127 INFO L272 TraceCheckUtils]: 28: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,129 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,130 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,130 INFO L272 TraceCheckUtils]: 36: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,132 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,134 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,134 INFO L272 TraceCheckUtils]: 45: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,136 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,138 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38049#unseeded} #46#return; {38049#unseeded} is VALID [2022-02-21 04:20:18,138 INFO L272 TraceCheckUtils]: 54: Hoare triple {38049#unseeded} call #t~ret7 := fibo1(~n - 2); {38049#unseeded} is VALID [2022-02-21 04:20:18,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:18,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:18,139 INFO L272 TraceCheckUtils]: 58: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {38052#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {38242#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {38242#(<= fibo2_~n oldRank0)} assume !(~n < 1); {38242#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {38242#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {38242#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,249 INFO L272 TraceCheckUtils]: 3: Hoare triple {38242#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {38252#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:18,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {38252#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {38256#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:20:18,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {38256#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:18,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:18,251 INFO L272 TraceCheckUtils]: 7: Hoare triple {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {38062#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:20:18,251 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:20:18,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,281 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:18,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,282 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:20:18,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 279 states and 311 transitions. Complement of second has 15 states. [2022-02-21 04:20:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:18,410 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:18,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:18,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 311 transitions. [2022-02-21 04:20:18,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:18,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,413 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:18,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:18,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:18,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:18,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 279 states and 311 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:18,416 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:18,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:18,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:18,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:18,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:18,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:18,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:18,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:18,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:18,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:18,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,432 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-21 04:20:18,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,433 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:18,494 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:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {38049#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); {38049#unseeded} is VALID [2022-02-21 04:20:18,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {38049#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 := 6; {38049#unseeded} is VALID [2022-02-21 04:20:18,865 INFO L272 TraceCheckUtils]: 2: Hoare triple {38049#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {38049#unseeded} is VALID [2022-02-21 04:20:18,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:18,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:18,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:18,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:18,867 INFO L272 TraceCheckUtils]: 10: Hoare triple {38049#unseeded} call #t~ret6 := fibo1(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,868 INFO L272 TraceCheckUtils]: 14: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,869 INFO L272 TraceCheckUtils]: 18: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,871 INFO L272 TraceCheckUtils]: 22: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,873 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,873 INFO L272 TraceCheckUtils]: 28: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,874 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,876 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,876 INFO L272 TraceCheckUtils]: 36: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,878 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,879 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,879 INFO L272 TraceCheckUtils]: 45: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,881 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:18,882 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38049#unseeded} #46#return; {38049#unseeded} is VALID [2022-02-21 04:20:18,883 INFO L272 TraceCheckUtils]: 54: Hoare triple {38049#unseeded} call #t~ret7 := fibo1(~n - 2); {38049#unseeded} is VALID [2022-02-21 04:20:18,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:18,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:18,884 INFO L272 TraceCheckUtils]: 58: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {38052#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {38750#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {38750#(<= fibo2_~n oldRank0)} assume !(~n < 1); {38750#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {38750#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {38750#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,974 INFO L272 TraceCheckUtils]: 3: Hoare triple {38750#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {38760#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:18,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {38760#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {38764#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:20:18,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {38764#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:18,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:18,976 INFO L272 TraceCheckUtils]: 7: Hoare triple {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {38062#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:20:18,976 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:20:18,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:19,007 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:19,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,007 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:20:19,007 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:19,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 279 states and 311 transitions. Complement of second has 15 states. [2022-02-21 04:20:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:19,112 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:19,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:19,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:19,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:19,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 311 transitions. [2022-02-21 04:20:19,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:19,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,114 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:19,114 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:19,114 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:19,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:19,114 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:19,114 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 279 states and 311 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:19,115 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:19,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:19,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:19,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:19,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:19,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:19,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:19,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:19,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:19,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:19,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:19,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:19,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:19,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:19,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:19,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:19,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:19,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:19,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:19,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:19,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:19,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:19,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:19,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:19,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:19,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:19,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:19,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,131 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-21 04:20:19,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,132 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:20:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:19,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {38049#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); {38049#unseeded} is VALID [2022-02-21 04:20:19,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {38049#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 := 6; {38049#unseeded} is VALID [2022-02-21 04:20:19,726 INFO L272 TraceCheckUtils]: 2: Hoare triple {38049#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {38049#unseeded} is VALID [2022-02-21 04:20:19,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:19,726 INFO L290 TraceCheckUtils]: 4: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:19,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:19,727 INFO L272 TraceCheckUtils]: 6: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:19,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:19,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:19,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:19,729 INFO L272 TraceCheckUtils]: 10: Hoare triple {38049#unseeded} call #t~ret6 := fibo1(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,730 INFO L272 TraceCheckUtils]: 14: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,732 INFO L272 TraceCheckUtils]: 18: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,734 INFO L272 TraceCheckUtils]: 22: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,736 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,737 INFO L272 TraceCheckUtils]: 28: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,739 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,740 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,741 INFO L272 TraceCheckUtils]: 36: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,743 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,745 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,745 INFO L272 TraceCheckUtils]: 45: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,748 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:19,749 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38049#unseeded} #46#return; {38049#unseeded} is VALID [2022-02-21 04:20:19,749 INFO L272 TraceCheckUtils]: 54: Hoare triple {38049#unseeded} call #t~ret7 := fibo1(~n - 2); {38049#unseeded} is VALID [2022-02-21 04:20:19,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:19,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:19,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:19,751 INFO L272 TraceCheckUtils]: 58: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:19,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {38052#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {39258#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:19,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {39258#(<= fibo2_~n oldRank0)} assume !(~n < 1); {39258#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:19,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {39258#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {39258#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:19,879 INFO L272 TraceCheckUtils]: 3: Hoare triple {39258#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {39268#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:19,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {39268#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {39272#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:20:19,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {39272#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:19,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:19,880 INFO L272 TraceCheckUtils]: 7: Hoare triple {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {38062#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:20:19,880 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:20:19,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:19,912 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:19,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:19,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:19,912 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:20:19,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:20,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 410 states and 449 transitions. Complement of second has 27 states. [2022-02-21 04:20:20,153 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:20:20,153 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:20,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:20,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:20,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:20,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:20,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:20,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:20,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:20,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 449 transitions. [2022-02-21 04:20:20,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-02-21 04:20:20,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:20,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:20,158 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:20,158 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:20,158 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:20,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:20,159 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:20,159 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 410 states and 449 transitions. cyclomatic complexity: 42 [2022-02-21 04:20:20,160 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:20:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:20:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:20:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:20,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:20,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:20,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,172 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-21 04:20:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 59 letters. Loop has 16 letters. [2022-02-21 04:20:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:20,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 410 states and 449 transitions. cyclomatic complexity: 42 [2022-02-21 04:20:20,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-02-21 04:20:20,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 410 states to 287 states and 318 transitions. [2022-02-21 04:20:20,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-02-21 04:20:20,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2022-02-21 04:20:20,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 318 transitions. [2022-02-21 04:20:20,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:20,186 INFO L681 BuchiCegarLoop]: Abstraction has 287 states and 318 transitions. [2022-02-21 04:20:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 318 transitions. [2022-02-21 04:20:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2022-02-21 04:20:20,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:20,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states and 318 transitions. Second operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:20,190 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states and 318 transitions. Second operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:20,190 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:20,191 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:20,200 INFO L93 Difference]: Finished difference Result 435 states and 495 transitions. [2022-02-21 04:20:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 495 transitions. [2022-02-21 04:20:20,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:20,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:20,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) Second operand 287 states and 318 transitions. [2022-02-21 04:20:20,202 INFO L87 Difference]: Start difference. First operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) Second operand 287 states and 318 transitions. [2022-02-21 04:20:20,202 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:20,212 INFO L93 Difference]: Finished difference Result 443 states and 505 transitions. [2022-02-21 04:20:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 505 transitions. [2022-02-21 04:20:20,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:20,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:20,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:20,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2022-02-21 04:20:20,217 INFO L704 BuchiCegarLoop]: Abstraction has 266 states and 296 transitions. [2022-02-21 04:20:20,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:20,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 04:20:20,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-02-21 04:20:20,218 INFO L87 Difference]: Start difference. First operand 266 states and 296 transitions. Second operand has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 11 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-21 04:20:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:21,343 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2022-02-21 04:20:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 04:20:21,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 11 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-21 04:20:21,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:21,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 364 transitions. [2022-02-21 04:20:21,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:21,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 289 states and 332 transitions. [2022-02-21 04:20:21,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2022-02-21 04:20:21,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2022-02-21 04:20:21,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 332 transitions. [2022-02-21 04:20:21,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:21,449 INFO L681 BuchiCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-02-21 04:20:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 332 transitions. [2022-02-21 04:20:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 264. [2022-02-21 04:20:21,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:21,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states and 332 transitions. Second operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:21,453 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states and 332 transitions. Second operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:21,454 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:21,454 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:21,466 INFO L93 Difference]: Finished difference Result 491 states and 568 transitions. [2022-02-21 04:20:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 568 transitions. [2022-02-21 04:20:21,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:21,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:21,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) Second operand 289 states and 332 transitions. [2022-02-21 04:20:21,468 INFO L87 Difference]: Start difference. First operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) Second operand 289 states and 332 transitions. [2022-02-21 04:20:21,468 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:21,480 INFO L93 Difference]: Finished difference Result 523 states and 611 transitions. [2022-02-21 04:20:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 611 transitions. [2022-02-21 04:20:21,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:21,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:21,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:21,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 299 transitions. [2022-02-21 04:20:21,486 INFO L704 BuchiCegarLoop]: Abstraction has 264 states and 299 transitions. [2022-02-21 04:20:21,486 INFO L587 BuchiCegarLoop]: Abstraction has 264 states and 299 transitions. [2022-02-21 04:20:21,486 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:20:21,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. [2022-02-21 04:20:21,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:21,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:21,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:21,487 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:21,487 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:21,488 INFO L791 eck$LassoCheckResult]: Stem: 41914#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); 41915#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 := 6; 41947#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 41972#fibo1ENTRY ~n := #in~n; 42085#L10 assume !(~n < 1); 42082#L12 assume !(1 == ~n); 42061#L15 call #t~ret4 := fibo2(~n - 1);< 42076#fibo2ENTRY ~n := #in~n; 42067#L20 assume !(~n < 1); 42064#L22 assume !(1 == ~n); 42059#L25 call #t~ret6 := fibo1(~n - 1);< 42062#fibo1ENTRY ~n := #in~n; 42084#L10 assume !(~n < 1); 42081#L12 assume !(1 == ~n); 42078#L15 call #t~ret4 := fibo2(~n - 1);< 42079#fibo2ENTRY ~n := #in~n; 42097#L20 assume !(~n < 1); 42094#L22 assume !(1 == ~n); 41965#L25 call #t~ret6 := fibo1(~n - 1);< 42091#fibo1ENTRY ~n := #in~n; 42149#L10 assume !(~n < 1); 42014#L12 assume !(1 == ~n); 41964#L15 call #t~ret4 := fibo2(~n - 1);< 41966#fibo2ENTRY ~n := #in~n; 42106#L20 assume !(~n < 1); 42105#L22 assume 1 == ~n;#res := 1; 42104#fibo2FINAL assume true; 42102#fibo2EXIT >#50#return; 42099#L15-1 call #t~ret5 := fibo2(~n - 2);< 42100#fibo2ENTRY ~n := #in~n; 42103#L20 assume ~n < 1;#res := 0; 42101#fibo2FINAL assume true; 42098#fibo2EXIT >#52#return; 42096#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 42093#fibo1FINAL assume true; 42090#fibo1EXIT >#46#return; 42087#L25-1 call #t~ret7 := fibo1(~n - 2);< 42088#fibo1ENTRY ~n := #in~n; 42095#L10 assume !(~n < 1); 42092#L12 assume 1 == ~n;#res := 1; 42089#fibo1FINAL assume true; 42086#fibo1EXIT >#48#return; 42083#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 42080#fibo2FINAL assume true; 42077#fibo2EXIT >#50#return; 42070#L15-1 call #t~ret5 := fibo2(~n - 2);< 42075#fibo2ENTRY ~n := #in~n; 42146#L20 assume !(~n < 1); 42161#L22 assume !(1 == ~n); 41953#L25 call #t~ret6 := fibo1(~n - 1);< 42157#fibo1ENTRY ~n := #in~n; 42174#L10 assume !(~n < 1); 42173#L12 assume !(1 == ~n); 41933#L15 call #t~ret4 := fibo2(~n - 1);< 41967#fibo2ENTRY ~n := #in~n; 42041#L20 assume !(~n < 1); 42042#L22 assume !(1 == ~n); 42027#L25 call #t~ret6 := fibo1(~n - 1);< 42037#fibo1ENTRY ~n := #in~n; 42035#L10 assume !(~n < 1); 42033#L12 assume !(1 == ~n); 42030#L15 [2022-02-21 04:20:21,488 INFO L793 eck$LassoCheckResult]: Loop: 42030#L15 call #t~ret4 := fibo2(~n - 1);< 42031#fibo2ENTRY ~n := #in~n; 42041#L20 assume !(~n < 1); 42042#L22 assume !(1 == ~n); 42027#L25 call #t~ret6 := fibo1(~n - 1);< 42037#fibo1ENTRY ~n := #in~n; 42035#L10 assume !(~n < 1); 42033#L12 assume !(1 == ~n); 42030#L15 [2022-02-21 04:20:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash 78940933, now seen corresponding path program 2 times [2022-02-21 04:20:21,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:21,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178140314] [2022-02-21 04:20:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:20:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,652 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,655 INFO L272 TraceCheckUtils]: 3: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L272 TraceCheckUtils]: 9: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:21,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,657 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:21,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:21,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,657 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:21,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L272 TraceCheckUtils]: 3: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L272 TraceCheckUtils]: 7: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L272 TraceCheckUtils]: 13: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L272 TraceCheckUtils]: 21: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,664 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:21,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:21,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,665 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#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); {44035#true} is VALID [2022-02-21 04:20:21,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#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 := 6; {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:21,666 INFO L272 TraceCheckUtils]: 2: Hoare triple {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44038#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:21,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {44038#(<= |fibo1_#in~n| 6)} ~n := #in~n; {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:21,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {44039#(<= fibo1_~n 6)} assume !(~n < 1); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:21,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {44039#(<= fibo1_~n 6)} assume !(1 == ~n); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:21,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {44039#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {44040#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:21,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {44040#(<= |fibo2_#in~n| 5)} ~n := #in~n; {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:21,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {44041#(<= fibo2_~n 5)} assume !(~n < 1); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:21,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {44041#(<= fibo2_~n 5)} assume !(1 == ~n); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:21,669 INFO L272 TraceCheckUtils]: 10: Hoare triple {44041#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {44042#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:21,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {44042#(<= |fibo1_#in~n| 4)} ~n := #in~n; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {44043#(<= fibo1_~n 4)} assume !(~n < 1); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {44043#(<= fibo1_~n 4)} assume !(1 == ~n); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,670 INFO L272 TraceCheckUtils]: 14: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,670 INFO L272 TraceCheckUtils]: 18: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L272 TraceCheckUtils]: 22: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:21,671 INFO L272 TraceCheckUtils]: 28: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L272 TraceCheckUtils]: 36: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,673 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:21,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:21,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,674 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,674 INFO L272 TraceCheckUtils]: 45: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {44074#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:21,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {44074#(<= |fibo2_#in~n| 2)} ~n := #in~n; {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:21,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {44075#(<= fibo2_~n 2)} assume !(~n < 1); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:21,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {44075#(<= fibo2_~n 2)} assume !(1 == ~n); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:21,676 INFO L272 TraceCheckUtils]: 49: Hoare triple {44075#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {44076#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:21,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {44076#(<= |fibo1_#in~n| 1)} ~n := #in~n; {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:21,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {44077#(<= fibo1_~n 1)} assume !(~n < 1); {44078#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:21,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {44078#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:21,677 INFO L272 TraceCheckUtils]: 53: Hoare triple {44036#false} call #t~ret4 := fibo2(~n - 1); {44036#false} is VALID [2022-02-21 04:20:21,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:21,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:21,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:21,678 INFO L272 TraceCheckUtils]: 57: Hoare triple {44036#false} call #t~ret6 := fibo1(~n - 1); {44036#false} is VALID [2022-02-21 04:20:21,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:21,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:21,678 INFO L290 TraceCheckUtils]: 60: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 04:20:21,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:21,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178140314] [2022-02-21 04:20:21,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178140314] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:21,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178188002] [2022-02-21 04:20:21,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:20:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:21,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:21,688 INFO L229 MonitoredProcess]: Starting monitored process 74 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:21,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-02-21 04:20:21,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 04:20:21,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:20:21,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:21,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:21,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#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); {44035#true} is VALID [2022-02-21 04:20:21,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#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 := 6; {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:21,974 INFO L272 TraceCheckUtils]: 2: Hoare triple {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44038#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:21,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {44038#(<= |fibo1_#in~n| 6)} ~n := #in~n; {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:21,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {44039#(<= fibo1_~n 6)} assume !(~n < 1); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:21,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {44039#(<= fibo1_~n 6)} assume !(1 == ~n); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:21,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {44039#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {44040#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:21,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {44040#(<= |fibo2_#in~n| 5)} ~n := #in~n; {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:21,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {44041#(<= fibo2_~n 5)} assume !(~n < 1); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:21,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {44041#(<= fibo2_~n 5)} assume !(1 == ~n); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:21,976 INFO L272 TraceCheckUtils]: 10: Hoare triple {44041#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {44042#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:21,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {44042#(<= |fibo1_#in~n| 4)} ~n := #in~n; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {44043#(<= fibo1_~n 4)} assume !(~n < 1); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {44043#(<= fibo1_~n 4)} assume !(1 == ~n); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,977 INFO L272 TraceCheckUtils]: 14: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L272 TraceCheckUtils]: 18: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L272 TraceCheckUtils]: 22: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L272 TraceCheckUtils]: 28: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L272 TraceCheckUtils]: 36: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:21,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:21,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:21,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:21,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,980 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:21,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:21,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:21,981 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:21,981 INFO L272 TraceCheckUtils]: 45: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {44074#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:21,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {44074#(<= |fibo2_#in~n| 2)} ~n := #in~n; {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:21,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {44075#(<= fibo2_~n 2)} assume !(~n < 1); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:21,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {44075#(<= fibo2_~n 2)} assume !(1 == ~n); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:21,983 INFO L272 TraceCheckUtils]: 49: Hoare triple {44075#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {44076#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:21,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {44076#(<= |fibo1_#in~n| 1)} ~n := #in~n; {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:21,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {44077#(<= fibo1_~n 1)} assume !(~n < 1); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:21,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {44077#(<= fibo1_~n 1)} assume !(1 == ~n); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:21,984 INFO L272 TraceCheckUtils]: 53: Hoare triple {44077#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {44272#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:20:21,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {44272#(<= |fibo2_#in~n| 0)} ~n := #in~n; {44276#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:21,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {44276#(<= fibo2_~n 0)} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:21,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:21,986 INFO L272 TraceCheckUtils]: 57: Hoare triple {44036#false} call #t~ret6 := fibo1(~n - 1); {44036#false} is VALID [2022-02-21 04:20:21,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:21,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:21,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 04:20:21,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:22,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:22,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:22,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:22,232 INFO L272 TraceCheckUtils]: 57: Hoare triple {44036#false} call #t~ret6 := fibo1(~n - 1); {44036#false} is VALID [2022-02-21 04:20:22,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:22,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {44276#(<= fibo2_~n 0)} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:22,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {44272#(<= |fibo2_#in~n| 0)} ~n := #in~n; {44276#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:22,234 INFO L272 TraceCheckUtils]: 53: Hoare triple {44077#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {44272#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:20:22,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {44077#(<= fibo1_~n 1)} assume !(1 == ~n); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:22,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {44077#(<= fibo1_~n 1)} assume !(~n < 1); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:22,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {44076#(<= |fibo1_#in~n| 1)} ~n := #in~n; {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:22,235 INFO L272 TraceCheckUtils]: 49: Hoare triple {44075#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {44076#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:22,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {44075#(<= fibo2_~n 2)} assume !(1 == ~n); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:22,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {44075#(<= fibo2_~n 2)} assume !(~n < 1); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:22,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {44074#(<= |fibo2_#in~n| 2)} ~n := #in~n; {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:22,237 INFO L272 TraceCheckUtils]: 45: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {44074#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:22,238 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:22,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:22,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:22,238 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:22,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L272 TraceCheckUtils]: 36: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:22,239 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L272 TraceCheckUtils]: 28: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:22,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L272 TraceCheckUtils]: 22: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L272 TraceCheckUtils]: 18: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:22,241 INFO L272 TraceCheckUtils]: 14: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:22,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {44043#(<= fibo1_~n 4)} assume !(1 == ~n); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:22,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {44043#(<= fibo1_~n 4)} assume !(~n < 1); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:22,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {44042#(<= |fibo1_#in~n| 4)} ~n := #in~n; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:22,243 INFO L272 TraceCheckUtils]: 10: Hoare triple {44041#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {44042#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:22,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {44041#(<= fibo2_~n 5)} assume !(1 == ~n); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:22,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {44041#(<= fibo2_~n 5)} assume !(~n < 1); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:22,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {44040#(<= |fibo2_#in~n| 5)} ~n := #in~n; {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:22,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {44039#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {44040#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:22,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {44039#(<= fibo1_~n 6)} assume !(1 == ~n); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:22,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {44039#(<= fibo1_~n 6)} assume !(~n < 1); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:22,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {44038#(<= |fibo1_#in~n| 6)} ~n := #in~n; {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:22,247 INFO L272 TraceCheckUtils]: 2: Hoare triple {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44038#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:22,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#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 := 6; {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:22,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#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); {44035#true} is VALID [2022-02-21 04:20:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 04:20:22,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178188002] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:22,248 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:22,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 16 [2022-02-21 04:20:22,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380757151] [2022-02-21 04:20:22,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:22,249 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 519237434, now seen corresponding path program 4 times [2022-02-21 04:20:22,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:22,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191375067] [2022-02-21 04:20:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:22,253 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:22,254 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:22,420 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:22,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:22,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:22,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:22,421 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:22,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:22,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:22,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration9_Loop [2022-02-21 04:20:22,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:22,421 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:22,423 INFO L141 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:22,425 INFO L141 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:22,426 INFO L141 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:22,433 INFO L141 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:22,435 INFO L141 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:22,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:22,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:22,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:22,441 INFO L141 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:22,521 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:22,521 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,523 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:22,524 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:22,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:22,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:22,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:22,533 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:22,548 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:22,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,549 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:22,550 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:22,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:22,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:22,559 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:22,559 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:22,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:22,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,576 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:22,576 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:22,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:22,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:22,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:22,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,606 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:22,607 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:22,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:22,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:24,105 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:24,109 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:24,109 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:24,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:24,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:24,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:24,109 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:24,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:24,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:24,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:24,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-2.c_Iteration9_Loop [2022-02-21 04:20:24,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:24,110 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:24,110 INFO L141 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:24,112 INFO L141 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:24,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:20:24,120 INFO L141 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:24,122 INFO L141 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:24,124 INFO L141 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:24,126 INFO L141 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:24,127 INFO L141 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:24,129 INFO L141 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:24,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:24,210 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:24,211 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:24,212 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:24,214 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:24,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:24,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:24,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:24,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:24,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:24,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:24,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:24,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:24,236 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:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:24,237 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:24,238 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:24,240 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:24,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:24,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:24,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:24,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:24,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:24,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:24,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:24,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:24,263 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:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:24,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:24,278 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:24,279 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:24,280 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:24,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:24,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:24,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:24,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:24,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:24,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:24,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:24,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:24,291 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:20:24,291 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:20:24,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:24,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:24,292 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:24,293 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:24,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:24,294 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:24,294 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:24,294 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:24,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 04:20:24,313 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:24,315 INFO L390 LassoCheck]: Loop: "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);" [2022-02-21 04:20:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 04:20:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:24,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {44474#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); {44474#unseeded} is VALID [2022-02-21 04:20:24,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {44474#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 := 6; {44474#unseeded} is VALID [2022-02-21 04:20:24,707 INFO L272 TraceCheckUtils]: 2: Hoare triple {44474#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44474#unseeded} is VALID [2022-02-21 04:20:24,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,709 INFO L272 TraceCheckUtils]: 10: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,710 INFO L272 TraceCheckUtils]: 14: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,711 INFO L272 TraceCheckUtils]: 18: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,713 INFO L272 TraceCheckUtils]: 22: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,715 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,715 INFO L272 TraceCheckUtils]: 28: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,741 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,743 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,743 INFO L272 TraceCheckUtils]: 36: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,745 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,746 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44474#unseeded} #50#return; {44474#unseeded} is VALID [2022-02-21 04:20:24,747 INFO L272 TraceCheckUtils]: 45: Hoare triple {44474#unseeded} call #t~ret5 := fibo2(~n - 2); {44474#unseeded} is VALID [2022-02-21 04:20:24,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,748 INFO L272 TraceCheckUtils]: 49: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,763 INFO L272 TraceCheckUtils]: 53: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,764 INFO L272 TraceCheckUtils]: 57: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,765 INFO L290 TraceCheckUtils]: 58: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,777 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:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:24,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {44477#(>= oldRank0 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {44673#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:24,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {44673#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {44677#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:24,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {44677#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {44677#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:24,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {44677#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {44677#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:24,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {44677#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret6 := fibo1(~n - 1); {44687#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:24,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {44687#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {44691#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:20:24,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {44691#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {44695#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:24,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {44695#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {44487#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:24,916 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:20:24,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:24,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:24,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,949 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 04:20:24,949 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 288 states and 323 transitions. Complement of second has 19 states. [2022-02-21 04:20:25,101 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:20:25,101 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:25,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:25,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:25,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:25,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:25,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:25,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:25,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 323 transitions. [2022-02-21 04:20:25,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:25,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:25,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:25,104 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:25,104 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:25,104 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:25,105 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:25,105 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 288 states and 323 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:25,105 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,111 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-02-21 04:20:25,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,112 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:25,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 04:20:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:25,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:25,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {44474#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); {44474#unseeded} is VALID [2022-02-21 04:20:25,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {44474#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 := 6; {44474#unseeded} is VALID [2022-02-21 04:20:25,588 INFO L272 TraceCheckUtils]: 2: Hoare triple {44474#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44474#unseeded} is VALID [2022-02-21 04:20:25,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,591 INFO L272 TraceCheckUtils]: 10: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,593 INFO L272 TraceCheckUtils]: 14: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,594 INFO L272 TraceCheckUtils]: 18: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,596 INFO L272 TraceCheckUtils]: 22: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,598 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,599 INFO L272 TraceCheckUtils]: 28: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,601 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,602 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,603 INFO L272 TraceCheckUtils]: 36: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,605 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:25,607 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44474#unseeded} #50#return; {44474#unseeded} is VALID [2022-02-21 04:20:25,607 INFO L272 TraceCheckUtils]: 45: Hoare triple {44474#unseeded} call #t~ret5 := fibo2(~n - 2); {44474#unseeded} is VALID [2022-02-21 04:20:25,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,609 INFO L272 TraceCheckUtils]: 49: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,610 INFO L272 TraceCheckUtils]: 53: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,611 INFO L272 TraceCheckUtils]: 57: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:25,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:25,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:25,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:25,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:25,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {44477#(>= oldRank0 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {45201#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:25,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {45201#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {45205#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:25,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {45205#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {45205#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:25,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {45205#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {45205#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:25,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {45205#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret6 := fibo1(~n - 1); {45215#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:25,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {45215#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {45219#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:20:25,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {45219#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {45223#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:25,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {45223#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {44487#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:25,775 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:20:25,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:25,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,810 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 04:20:25,810 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 288 states and 323 transitions. Complement of second has 21 states. [2022-02-21 04:20:25,972 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:25,972 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:25,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:25,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:25,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:25,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:25,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:25,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:25,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 323 transitions. [2022-02-21 04:20:25,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:25,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:25,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:25,976 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:25,976 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:25,976 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:25,977 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:25,977 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 288 states and 323 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:25,977 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:25,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:25,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:25,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:25,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:25,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:25,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,985 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2022-02-21 04:20:25,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:25,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:25,986 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:26,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 04:20:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:26,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:26,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {44474#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); {44474#unseeded} is VALID [2022-02-21 04:20:26,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {44474#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 := 6; {44474#unseeded} is VALID [2022-02-21 04:20:26,464 INFO L272 TraceCheckUtils]: 2: Hoare triple {44474#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44474#unseeded} is VALID [2022-02-21 04:20:26,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,467 INFO L272 TraceCheckUtils]: 10: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,468 INFO L272 TraceCheckUtils]: 14: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,470 INFO L272 TraceCheckUtils]: 18: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,472 INFO L272 TraceCheckUtils]: 22: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,474 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,475 INFO L272 TraceCheckUtils]: 28: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,477 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,479 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,480 INFO L272 TraceCheckUtils]: 36: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,482 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:26,484 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44474#unseeded} #50#return; {44474#unseeded} is VALID [2022-02-21 04:20:26,484 INFO L272 TraceCheckUtils]: 45: Hoare triple {44474#unseeded} call #t~ret5 := fibo2(~n - 2); {44474#unseeded} is VALID [2022-02-21 04:20:26,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,485 INFO L272 TraceCheckUtils]: 49: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,487 INFO L272 TraceCheckUtils]: 53: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,488 INFO L272 TraceCheckUtils]: 57: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:26,489 INFO L290 TraceCheckUtils]: 59: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:26,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:26,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:26,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:26,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {44477#(>= oldRank0 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {45733#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:26,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {45733#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {45737#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:26,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {45737#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {45737#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:26,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {45737#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {45737#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:26,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {45737#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret6 := fibo1(~n - 1); {45747#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:26,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {45747#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {45751#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:20:26,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {45751#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {45755#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:26,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {45755#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {44487#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:26,665 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:20:26,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:26,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:26,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:26,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,700 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 6 loop predicates [2022-02-21 04:20:26,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:26,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 573 states and 653 transitions. Complement of second has 33 states. [2022-02-21 04:20:26,923 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:20:26,923 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:26,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:26,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:26,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:26,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:26,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:26,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:26,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:26,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 653 transitions. [2022-02-21 04:20:26,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:26,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:26,941 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:26,941 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:26,941 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:26,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:26,942 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:26,942 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 573 states and 653 transitions. cyclomatic complexity: 85 [2022-02-21 04:20:26,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 653 transitions. cyclomatic complexity: 85 [2022-02-21 04:20:26,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:26,942 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:26,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:26,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:26,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 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:20:26,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:26,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,945 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-21 04:20:26,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:26,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:26,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 61 letters. Loop has 16 letters. [2022-02-21 04:20:26,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:26,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 653 transitions. cyclomatic complexity: 85 [2022-02-21 04:20:26,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:26,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 0 states and 0 transitions. [2022-02-21 04:20:26,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:26,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:26,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:26,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:26,958 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:26,958 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:26,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:26,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:20:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:20:26,958 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:26,959 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:20:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:20:26,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:27,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:27,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:20:27,021 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:27,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:20:27,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:27,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:27,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:27,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:27,021 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:27,021 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:27,021 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:27,021 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:20:27,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:20:27,022 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:27,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:27,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:20:27 BoogieIcfgContainer [2022-02-21 04:20:27,027 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:20:27,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:20:27,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:20:27,028 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:20:27,028 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:46" (3/4) ... [2022-02-21 04:20:27,030 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:20:27,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:20:27,031 INFO L158 Benchmark]: Toolchain (without parser) took 40665.47ms. Allocated memory was 81.8MB in the beginning and 383.8MB in the end (delta: 302.0MB). Free memory was 49.7MB in the beginning and 306.1MB in the end (delta: -256.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2022-02-21 04:20:27,031 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:27,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.64ms. Allocated memory was 81.8MB in the beginning and 123.7MB in the end (delta: 41.9MB). Free memory was 49.4MB in the beginning and 99.4MB in the end (delta: -50.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-21 04:20:27,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.78ms. Allocated memory is still 123.7MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:27,032 INFO L158 Benchmark]: Boogie Preprocessor took 24.45ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 96.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:27,032 INFO L158 Benchmark]: RCFGBuilder took 265.79ms. Allocated memory is still 123.7MB. Free memory was 96.6MB in the beginning and 87.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:27,033 INFO L158 Benchmark]: BuchiAutomizer took 40101.61ms. Allocated memory was 123.7MB in the beginning and 383.8MB in the end (delta: 260.0MB). Free memory was 86.8MB in the beginning and 306.1MB in the end (delta: -219.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2022-02-21 04:20:27,033 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 383.8MB. Free memory is still 306.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:27,040 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.17ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.64ms. Allocated memory was 81.8MB in the beginning and 123.7MB in the end (delta: 41.9MB). Free memory was 49.4MB in the beginning and 99.4MB in the end (delta: -50.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.78ms. Allocated memory is still 123.7MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.45ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 96.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 265.79ms. Allocated memory is still 123.7MB. Free memory was 96.6MB in the beginning and 87.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 40101.61ms. Allocated memory was 123.7MB in the beginning and 383.8MB in the end (delta: 260.0MB). Free memory was 86.8MB in the beginning and 306.1MB in the end (delta: -219.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 383.8MB. Free memory is still 306.1MB. 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, 2 deterministic, 4 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 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 \old(n) and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.0s and 10 iterations. TraceHistogramMax:8. Analysis of lassos took 19.1s. Construction of modules took 3.9s. Büchi inclusion checks took 15.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 408 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 394 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1208 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1182 mSDsluCounter, 1811 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1349 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3244 IncrementalHoareTripleChecker+Invalid, 3987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 462 mSDtfsCounter, 3244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI3 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf94 smp65 dnf100 smp100 tf110 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:20:27,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:27,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:27,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:27,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-02-21 04:20:27,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:28,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:28,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-02-21 04:20:28,480 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:28,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:28,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE