./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:06:12,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:06:12,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:06:12,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:06:12,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:06:12,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:06:12,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:06:12,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:06:12,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:06:12,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:06:12,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:06:12,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:06:12,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:06:12,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:06:12,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:06:12,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:06:12,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:06:12,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:06:12,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:06:12,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:06:12,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:06:12,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:06:12,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:06:12,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:06:12,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:06:12,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:06:12,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:06:12,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:06:12,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:06:12,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:06:12,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:06:12,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:06:12,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:06:12,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:06:12,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:06:12,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:06:12,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:06:12,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:06:12,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:06:12,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:06:12,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:06:12,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:06:12,524 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:06:12,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:06:12,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:06:12,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:06:12,527 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:06:12,527 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:06:12,527 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:06:12,528 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:06:12,528 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:06:12,528 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:06:12,529 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:06:12,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:06:12,530 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:06:12,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:06:12,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:06:12,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:06:12,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:06:12,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:06:12,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:06:12,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:06:12,532 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:06:12,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:06:12,533 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:06:12,533 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:06:12,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:06:12,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:06:12,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:06:12,534 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:06:12,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:06:12,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:06:12,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:06:12,536 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:06:12,538 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:06:12,538 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 [2020-07-29 03:06:12,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:06:12,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:06:12,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:06:12,869 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:06:12,870 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:06:12,871 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2020-07-29 03:06:12,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ae4ac0b/44f438901489463688d8945b28869384/FLAGb483bdb1a [2020-07-29 03:06:13,397 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:06:13,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2020-07-29 03:06:13,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ae4ac0b/44f438901489463688d8945b28869384/FLAGb483bdb1a [2020-07-29 03:06:13,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ae4ac0b/44f438901489463688d8945b28869384 [2020-07-29 03:06:13,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:06:13,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:06:13,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:06:13,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:06:13,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:06:13,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:06:13" (1/1) ... [2020-07-29 03:06:13,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8310ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:13, skipping insertion in model container [2020-07-29 03:06:13,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:06:13" (1/1) ... [2020-07-29 03:06:13,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:06:13,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:06:14,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:06:14,079 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:06:14,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:06:14,131 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:06:14,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14 WrapperNode [2020-07-29 03:06:14,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:06:14,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:06:14,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:06:14,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:06:14,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:06:14,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:06:14,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:06:14,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:06:14,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... [2020-07-29 03:06:14,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:06:14,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:06:14,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:06:14,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:06:14,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:14,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:06:14,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:06:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-29 03:06:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-29 03:06:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-29 03:06:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-29 03:06:14,654 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:06:14,654 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 03:06:14,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:06:14 BoogieIcfgContainer [2020-07-29 03:06:14,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:06:14,659 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:06:14,659 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:06:14,663 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:06:14,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:06:14,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:06:13" (1/3) ... [2020-07-29 03:06:14,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@552ecb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:06:14, skipping insertion in model container [2020-07-29 03:06:14,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:06:14,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:06:14" (2/3) ... [2020-07-29 03:06:14,668 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@552ecb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:06:14, skipping insertion in model container [2020-07-29 03:06:14,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:06:14,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:06:14" (3/3) ... [2020-07-29 03:06:14,670 INFO L371 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-07-29 03:06:14,735 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:06:14,736 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:06:14,736 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:06:14,736 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:06:14,736 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:06:14,736 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:06:14,737 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:06:14,737 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:06:14,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:06:14,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:14,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:14,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:14,812 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:06:14,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:14,812 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:06:14,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:06:14,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:14,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:14,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:14,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:06:14,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:14,833 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 16#L37true call main_#t~ret4 := fibo1(main_~x~0);< 24#fibo1ENTRYtrue [2020-07-29 03:06:14,833 INFO L796 eck$LassoCheckResult]: Loop: 24#fibo1ENTRYtrue ~n := #in~n; 12#L8true assume !(~n < 1); 4#L10true assume !(1 == ~n); 18#L13true call #t~ret0 := fibo2(~n - 1);< 10#fibo2ENTRYtrue ~n := #in~n; 27#L18true assume !(~n < 1); 25#L20true assume !(1 == ~n); 3#L23true call #t~ret2 := fibo1(~n - 1);< 24#fibo1ENTRYtrue [2020-07-29 03:06:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1034, now seen corresponding path program 1 times [2020-07-29 03:06:14,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:14,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686110391] [2020-07-29 03:06:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:14,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:14,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:14,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1816359656, now seen corresponding path program 1 times [2020-07-29 03:06:14,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:14,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426821120] [2020-07-29 03:06:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:14,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:14,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:14,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1268294159, now seen corresponding path program 1 times [2020-07-29 03:06:14,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:14,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657403335] [2020-07-29 03:06:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:14,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:15,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:15,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:15,322 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:15,323 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:15,323 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:15,324 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:15,324 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:06:15,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:15,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:15,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration1_Loop [2020-07-29 03:06:15,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:15,325 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:15,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:15,630 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:15,631 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:15,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,639 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,649 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:15,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,692 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:15,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,734 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:15,781 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,781 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,818 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:15,823 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,823 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:15,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,866 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:15,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,914 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,922 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,922 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:15,952 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:15,952 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:15,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:15,978 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:06:16,006 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,064 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:06:16,066 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:16,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:16,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:16,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:16,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:06:16,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:16,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:16,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration1_Loop [2020-07-29 03:06:16,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:16,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:16,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:16,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:16,332 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:16,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:16,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:16,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:16,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:16,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:16,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:16,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:16,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:16,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:06:16,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:06:16,730 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:16,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:06:16,744 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:06:16,745 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:06:16,746 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:16,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:06:16,827 INFO L393 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< [2020-07-29 03:06:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:16,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:06:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:16,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:16,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {35#unseeded} is VALID [2020-07-29 03:06:16,905 INFO L263 TraceCheckUtils]: 1: Hoare triple {35#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {35#unseeded} is VALID [2020-07-29 03:06:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:16,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:06:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:16,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:17,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(>= oldRank0 |fibo1_#in~n|)} ~n := #in~n; {56#(<= fibo1_~n oldRank0)} is VALID [2020-07-29 03:06:17,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(<= fibo1_~n oldRank0)} assume !(~n < 1); {56#(<= fibo1_~n oldRank0)} is VALID [2020-07-29 03:06:17,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {56#(<= fibo1_~n oldRank0)} assume !(1 == ~n); {56#(<= fibo1_~n oldRank0)} is VALID [2020-07-29 03:06:17,195 INFO L263 TraceCheckUtils]: 3: Hoare triple {56#(<= fibo1_~n oldRank0)} call #t~ret0 := fibo2(~n - 1); {66#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2020-07-29 03:06:17,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {66#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {70#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:17,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {70#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {74#(and (<= (+ fibo2_~n 1) oldRank0) (<= 1 fibo2_~n))} is VALID [2020-07-29 03:06:17,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {74#(and (<= (+ fibo2_~n 1) oldRank0) (<= 1 fibo2_~n))} assume !(1 == ~n); {74#(and (<= (+ fibo2_~n 1) oldRank0) (<= 1 fibo2_~n))} is VALID [2020-07-29 03:06:17,202 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#(and (<= (+ fibo2_~n 1) oldRank0) (<= 1 fibo2_~n))} call #t~ret2 := fibo1(~n - 1); {48#(or (and (> oldRank0 |fibo1_#in~n|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:17,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:06:17,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:17,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,275 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 [2020-07-29 03:06:17,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2020-07-29 03:06:17,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 83 states and 115 transitions. Complement of second has 24 states. [2020-07-29 03:06:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 03:06:17,823 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:17,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:06:17,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:17,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:17,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:17,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:06:17,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:17,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:17,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:17,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 115 transitions. [2020-07-29 03:06:17,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:17,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:17,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:17,845 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states. [2020-07-29 03:06:17,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:17,855 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:17,855 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:06:17,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:17,862 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:17,863 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 83 states and 115 transitions. cyclomatic complexity: 34 [2020-07-29 03:06:17,874 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:17,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 03:06:17,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 03:06:17,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 5 letters. [2020-07-29 03:06:17,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 14 letters. Loop has 25 letters. [2020-07-29 03:06:17,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 25 letters. [2020-07-29 03:06:17,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 25 letters. [2020-07-29 03:06:17,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 83 letters. Loop has 83 letters. [2020-07-29 03:06:17,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 83 letters. Loop has 83 letters. [2020-07-29 03:06:17,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 83 letters. Loop has 83 letters. [2020-07-29 03:06:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:06:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:06:17,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:06:17,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 03:06:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 03:06:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 8 letters. [2020-07-29 03:06:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:06:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:06:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:06:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 13 letters. [2020-07-29 03:06:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 13 letters. [2020-07-29 03:06:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 13 letters. [2020-07-29 03:06:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 4 letters. Loop has 8 letters. [2020-07-29 03:06:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 8 letters. [2020-07-29 03:06:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 8 letters. [2020-07-29 03:06:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 03:06:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 03:06:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 13 letters. [2020-07-29 03:06:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:17,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:17,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:17,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 03:06:17,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 03:06:17,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 8 letters. [2020-07-29 03:06:17,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 03:06:17,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 03:06:17,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 8 letters. [2020-07-29 03:06:17,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 3 letters. Loop has 8 letters. [2020-07-29 03:06:17,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 8 letters. [2020-07-29 03:06:17,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 8 letters. [2020-07-29 03:06:17,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 13 letters. [2020-07-29 03:06:17,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 13 letters. [2020-07-29 03:06:17,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 13 letters. [2020-07-29 03:06:17,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 03:06:17,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 03:06:17,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 13 letters. [2020-07-29 03:06:17,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 03:06:17,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 03:06:17,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 5 letters. [2020-07-29 03:06:17,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:06:17,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:06:17,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:06:17,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:06:17,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:06:17,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:06:17,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:06:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:06:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:06:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 03:06:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 03:06:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 8 letters. [2020-07-29 03:06:17,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:06:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:06:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:06:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:06:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:06:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:06:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 14 letters. Loop has 25 letters. [2020-07-29 03:06:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 25 letters. [2020-07-29 03:06:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 25 letters. [2020-07-29 03:06:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:06:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:06:17,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:06:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:06:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:06:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:06:17,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:06:17,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:06:17,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:06:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 14 letters. Loop has 49 letters. [2020-07-29 03:06:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 49 letters. [2020-07-29 03:06:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 49 letters. [2020-07-29 03:06:17,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 34 letters. Loop has 49 letters. [2020-07-29 03:06:17,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 34 letters. Loop has 49 letters. [2020-07-29 03:06:17,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 115 transitions. cyclomatic complexity: 34 Stem has 34 letters. Loop has 49 letters. [2020-07-29 03:06:17,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,946 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:06:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-29 03:06:17,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:06:17,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:06:17,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2020-07-29 03:06:17,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:17,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 115 transitions. cyclomatic complexity: 34 [2020-07-29 03:06:17,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:17,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 81 transitions. [2020-07-29 03:06:17,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2020-07-29 03:06:17,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-07-29 03:06:17,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2020-07-29 03:06:17,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:17,985 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2020-07-29 03:06:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2020-07-29 03:06:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2020-07-29 03:06:18,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:18,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states and 81 transitions. Second operand 53 states. [2020-07-29 03:06:18,020 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states and 81 transitions. Second operand 53 states. [2020-07-29 03:06:18,023 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 53 states. [2020-07-29 03:06:18,028 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:18,051 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-29 03:06:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-29 03:06:18,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:18,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:18,056 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 60 states and 81 transitions. [2020-07-29 03:06:18,056 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 60 states and 81 transitions. [2020-07-29 03:06:18,057 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:18,088 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2020-07-29 03:06:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2020-07-29 03:06:18,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:18,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:18,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:18,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 03:06:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2020-07-29 03:06:18,106 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2020-07-29 03:06:18,106 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2020-07-29 03:06:18,106 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:06:18,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2020-07-29 03:06:18,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:18,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:18,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:18,113 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:18,113 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:18,113 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 216#L37 call main_#t~ret4 := fibo1(main_~x~0);< 218#fibo1ENTRY ~n := #in~n; 229#L8 assume !(~n < 1); 215#L10 assume !(1 == ~n); 205#L13 call #t~ret0 := fibo2(~n - 1);< 223#fibo2ENTRY ~n := #in~n; 246#L18 assume !(~n < 1); 247#L20 assume !(1 == ~n); 201#L23 call #t~ret2 := fibo1(~n - 1);< 204#fibo1ENTRY ~n := #in~n; 231#L8 assume ~n < 1;#res := 0; 213#fibo1FINAL assume true; 221#fibo1EXIT >#45#return; 217#L23-1 [2020-07-29 03:06:18,114 INFO L796 eck$LassoCheckResult]: Loop: 217#L23-1 call #t~ret3 := fibo1(~n - 2);< 200#fibo1ENTRY ~n := #in~n; 245#L8 assume !(~n < 1); 242#L10 assume !(1 == ~n); 198#L13 call #t~ret0 := fibo2(~n - 1);< 241#fibo2ENTRY ~n := #in~n; 244#L18 assume !(~n < 1); 239#L20 assume !(1 == ~n); 197#L23 call #t~ret2 := fibo1(~n - 1);< 200#fibo1ENTRY ~n := #in~n; 245#L8 assume ~n < 1;#res := 0; 226#fibo1FINAL assume true; 227#fibo1EXIT >#45#return; 217#L23-1 [2020-07-29 03:06:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1422043512, now seen corresponding path program 1 times [2020-07-29 03:06:18,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:18,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927942473] [2020-07-29 03:06:18,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {731#true} ~n := #in~n; {742#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:18,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {742#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {743#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,264 INFO L280 TraceCheckUtils]: 2: Hoare triple {743#(<= |fibo1_#in~n| 0)} assume true; {743#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,265 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {743#(<= |fibo1_#in~n| 0)} {737#(<= 4 fibo2_~n)} #45#return; {732#false} is VALID [2020-07-29 03:06:18,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {731#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {733#(<= 5 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 03:06:18,268 INFO L263 TraceCheckUtils]: 1: Hoare triple {733#(<= 5 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {734#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:18,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {734#(<= 5 |fibo1_#in~n|)} ~n := #in~n; {735#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:18,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {735#(<= 5 fibo1_~n)} assume !(~n < 1); {735#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:18,270 INFO L280 TraceCheckUtils]: 4: Hoare triple {735#(<= 5 fibo1_~n)} assume !(1 == ~n); {735#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:18,271 INFO L263 TraceCheckUtils]: 5: Hoare triple {735#(<= 5 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {736#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:18,272 INFO L280 TraceCheckUtils]: 6: Hoare triple {736#(<= 4 |fibo2_#in~n|)} ~n := #in~n; {737#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:18,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {737#(<= 4 fibo2_~n)} assume !(~n < 1); {737#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:18,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {737#(<= 4 fibo2_~n)} assume !(1 == ~n); {737#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:18,273 INFO L263 TraceCheckUtils]: 9: Hoare triple {737#(<= 4 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {731#true} is VALID [2020-07-29 03:06:18,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#true} ~n := #in~n; {742#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:18,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {742#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {743#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {743#(<= |fibo1_#in~n| 0)} assume true; {743#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,277 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {743#(<= |fibo1_#in~n| 0)} {737#(<= 4 fibo2_~n)} #45#return; {732#false} is VALID [2020-07-29 03:06:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:18,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927942473] [2020-07-29 03:06:18,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077611903] [2020-07-29 03:06:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 03:06:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:18,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {731#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {733#(<= 5 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 03:06:18,478 INFO L263 TraceCheckUtils]: 1: Hoare triple {733#(<= 5 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {734#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:18,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {734#(<= 5 |fibo1_#in~n|)} ~n := #in~n; {735#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:18,479 INFO L280 TraceCheckUtils]: 3: Hoare triple {735#(<= 5 fibo1_~n)} assume !(~n < 1); {735#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:18,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {735#(<= 5 fibo1_~n)} assume !(1 == ~n); {735#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:18,482 INFO L263 TraceCheckUtils]: 5: Hoare triple {735#(<= 5 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {736#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:18,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {736#(<= 4 |fibo2_#in~n|)} ~n := #in~n; {737#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:18,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {737#(<= 4 fibo2_~n)} assume !(~n < 1); {737#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:18,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {737#(<= 4 fibo2_~n)} assume !(1 == ~n); {737#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:18,485 INFO L263 TraceCheckUtils]: 9: Hoare triple {737#(<= 4 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {731#true} is VALID [2020-07-29 03:06:18,486 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#true} ~n := #in~n; {777#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-29 03:06:18,487 INFO L280 TraceCheckUtils]: 11: Hoare triple {777#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {743#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,487 INFO L280 TraceCheckUtils]: 12: Hoare triple {743#(<= |fibo1_#in~n| 0)} assume true; {743#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,489 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {743#(<= |fibo1_#in~n| 0)} {737#(<= 4 fibo2_~n)} #45#return; {732#false} is VALID [2020-07-29 03:06:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:18,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:18,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 03:06:18,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474826874] [2020-07-29 03:06:18,495 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1259120325, now seen corresponding path program 1 times [2020-07-29 03:06:18,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:18,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429302675] [2020-07-29 03:06:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#true} ~n := #in~n; {792#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:18,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {792#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {793#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {793#(<= |fibo1_#in~n| 0)} assume true; {793#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,572 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {793#(<= |fibo1_#in~n| 0)} {787#(< 1 fibo2_~n)} #45#return; {785#false} is VALID [2020-07-29 03:06:18,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {784#true} call #t~ret3 := fibo1(~n - 2); {784#true} is VALID [2020-07-29 03:06:18,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#true} ~n := #in~n; {784#true} is VALID [2020-07-29 03:06:18,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {784#true} assume !(~n < 1); {784#true} is VALID [2020-07-29 03:06:18,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {784#true} assume !(1 == ~n); {784#true} is VALID [2020-07-29 03:06:18,574 INFO L263 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret0 := fibo2(~n - 1); {784#true} is VALID [2020-07-29 03:06:18,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {784#true} ~n := #in~n; {784#true} is VALID [2020-07-29 03:06:18,575 INFO L280 TraceCheckUtils]: 6: Hoare triple {784#true} assume !(~n < 1); {786#(< 0 fibo2_~n)} is VALID [2020-07-29 03:06:18,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {786#(< 0 fibo2_~n)} assume !(1 == ~n); {787#(< 1 fibo2_~n)} is VALID [2020-07-29 03:06:18,577 INFO L263 TraceCheckUtils]: 8: Hoare triple {787#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {784#true} is VALID [2020-07-29 03:06:18,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#true} ~n := #in~n; {792#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:18,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {792#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {793#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,579 INFO L280 TraceCheckUtils]: 11: Hoare triple {793#(<= |fibo1_#in~n| 0)} assume true; {793#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:18,581 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {793#(<= |fibo1_#in~n| 0)} {787#(< 1 fibo2_~n)} #45#return; {785#false} is VALID [2020-07-29 03:06:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:06:18,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429302675] [2020-07-29 03:06:18,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:06:18,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:06:18,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031351812] [2020-07-29 03:06:18,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:06:18,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:18,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:06:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:06:18,588 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 20 Second operand 6 states. [2020-07-29 03:06:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:18,795 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2020-07-29 03:06:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:06:18,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:06:18,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:18,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 87 transitions. [2020-07-29 03:06:18,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:18,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 85 transitions. [2020-07-29 03:06:18,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-07-29 03:06:18,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-07-29 03:06:18,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 85 transitions. [2020-07-29 03:06:18,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:18,836 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 85 transitions. [2020-07-29 03:06:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 85 transitions. [2020-07-29 03:06:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2020-07-29 03:06:18,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:18,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states and 85 transitions. Second operand 57 states. [2020-07-29 03:06:18,843 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states and 85 transitions. Second operand 57 states. [2020-07-29 03:06:18,843 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand 57 states. [2020-07-29 03:06:18,844 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:18,857 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2020-07-29 03:06:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2020-07-29 03:06:18,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:18,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:18,860 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 65 states and 85 transitions. [2020-07-29 03:06:18,860 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 65 states and 85 transitions. [2020-07-29 03:06:18,861 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:18,873 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2020-07-29 03:06:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2020-07-29 03:06:18,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:18,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:18,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:18,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-29 03:06:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2020-07-29 03:06:18,879 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2020-07-29 03:06:18,879 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2020-07-29 03:06:18,879 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:06:18,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2020-07-29 03:06:18,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:06:18,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:18,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:18,881 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:18,882 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:18,882 INFO L794 eck$LassoCheckResult]: Stem: 895#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 873#L37 call main_#t~ret4 := fibo1(main_~x~0);< 874#fibo1ENTRY ~n := #in~n; 896#L8 assume !(~n < 1); 914#L10 assume !(1 == ~n); 870#L13 call #t~ret0 := fibo2(~n - 1);< 888#fibo2ENTRY ~n := #in~n; 916#L18 assume !(~n < 1); 917#L20 assume !(1 == ~n); 867#L23 call #t~ret2 := fibo1(~n - 1);< 872#fibo1ENTRY ~n := #in~n; 898#L8 assume !(~n < 1); 875#L10 assume 1 == ~n;#res := 1; 876#fibo1FINAL assume true; 892#fibo1EXIT >#45#return; 883#L23-1 [2020-07-29 03:06:18,882 INFO L796 eck$LassoCheckResult]: Loop: 883#L23-1 call #t~ret3 := fibo1(~n - 2);< 866#fibo1ENTRY ~n := #in~n; 912#L8 assume !(~n < 1); 911#L10 assume !(1 == ~n); 864#L13 call #t~ret0 := fibo2(~n - 1);< 910#fibo2ENTRY ~n := #in~n; 915#L18 assume !(~n < 1); 906#L20 assume !(1 == ~n); 863#L23 call #t~ret2 := fibo1(~n - 1);< 866#fibo1ENTRY ~n := #in~n; 912#L8 assume !(~n < 1); 911#L10 assume 1 == ~n;#res := 1; 894#fibo1FINAL assume true; 907#fibo1EXIT >#45#return; 883#L23-1 [2020-07-29 03:06:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1133700819, now seen corresponding path program 1 times [2020-07-29 03:06:18,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:18,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112872421] [2020-07-29 03:06:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:18,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:19,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} ~n := #in~n; {1431#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:19,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {1431#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1431#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:19,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {1431#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {1432#(<= |fibo1_#in~n| 1)} is VALID [2020-07-29 03:06:19,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {1432#(<= |fibo1_#in~n| 1)} assume true; {1432#(<= |fibo1_#in~n| 1)} is VALID [2020-07-29 03:06:19,051 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1432#(<= |fibo1_#in~n| 1)} {1425#(<= 4 fibo2_~n)} #45#return; {1420#false} is VALID [2020-07-29 03:06:19,052 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {1421#(<= 5 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 03:06:19,052 INFO L263 TraceCheckUtils]: 1: Hoare triple {1421#(<= 5 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {1422#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:19,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {1422#(<= 5 |fibo1_#in~n|)} ~n := #in~n; {1423#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:19,055 INFO L280 TraceCheckUtils]: 3: Hoare triple {1423#(<= 5 fibo1_~n)} assume !(~n < 1); {1423#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:19,055 INFO L280 TraceCheckUtils]: 4: Hoare triple {1423#(<= 5 fibo1_~n)} assume !(1 == ~n); {1423#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:19,056 INFO L263 TraceCheckUtils]: 5: Hoare triple {1423#(<= 5 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {1424#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:19,057 INFO L280 TraceCheckUtils]: 6: Hoare triple {1424#(<= 4 |fibo2_#in~n|)} ~n := #in~n; {1425#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:19,057 INFO L280 TraceCheckUtils]: 7: Hoare triple {1425#(<= 4 fibo2_~n)} assume !(~n < 1); {1425#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:19,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {1425#(<= 4 fibo2_~n)} assume !(1 == ~n); {1425#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:19,058 INFO L263 TraceCheckUtils]: 9: Hoare triple {1425#(<= 4 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1419#true} is VALID [2020-07-29 03:06:19,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {1419#true} ~n := #in~n; {1431#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:19,060 INFO L280 TraceCheckUtils]: 11: Hoare triple {1431#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1431#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:19,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {1431#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {1432#(<= |fibo1_#in~n| 1)} is VALID [2020-07-29 03:06:19,062 INFO L280 TraceCheckUtils]: 13: Hoare triple {1432#(<= |fibo1_#in~n| 1)} assume true; {1432#(<= |fibo1_#in~n| 1)} is VALID [2020-07-29 03:06:19,064 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1432#(<= |fibo1_#in~n| 1)} {1425#(<= 4 fibo2_~n)} #45#return; {1420#false} is VALID [2020-07-29 03:06:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:19,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112872421] [2020-07-29 03:06:19,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277786516] [2020-07-29 03:06:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:19,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:19,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:19,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {1419#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {1421#(<= 5 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 03:06:19,250 INFO L263 TraceCheckUtils]: 1: Hoare triple {1421#(<= 5 ULTIMATE.start_main_~x~0)} call main_#t~ret4 := fibo1(main_~x~0); {1422#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:19,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {1422#(<= 5 |fibo1_#in~n|)} ~n := #in~n; {1423#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:19,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {1423#(<= 5 fibo1_~n)} assume !(~n < 1); {1423#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:19,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {1423#(<= 5 fibo1_~n)} assume !(1 == ~n); {1423#(<= 5 fibo1_~n)} is VALID [2020-07-29 03:06:19,253 INFO L263 TraceCheckUtils]: 5: Hoare triple {1423#(<= 5 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {1424#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:19,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {1424#(<= 4 |fibo2_#in~n|)} ~n := #in~n; {1425#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:19,255 INFO L280 TraceCheckUtils]: 7: Hoare triple {1425#(<= 4 fibo2_~n)} assume !(~n < 1); {1425#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:19,255 INFO L280 TraceCheckUtils]: 8: Hoare triple {1425#(<= 4 fibo2_~n)} assume !(1 == ~n); {1425#(<= 4 fibo2_~n)} is VALID [2020-07-29 03:06:19,256 INFO L263 TraceCheckUtils]: 9: Hoare triple {1425#(<= 4 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1419#true} is VALID [2020-07-29 03:06:19,257 INFO L280 TraceCheckUtils]: 10: Hoare triple {1419#true} ~n := #in~n; {1466#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-29 03:06:19,257 INFO L280 TraceCheckUtils]: 11: Hoare triple {1466#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1466#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-29 03:06:19,258 INFO L280 TraceCheckUtils]: 12: Hoare triple {1466#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {1432#(<= |fibo1_#in~n| 1)} is VALID [2020-07-29 03:06:19,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {1432#(<= |fibo1_#in~n| 1)} assume true; {1432#(<= |fibo1_#in~n| 1)} is VALID [2020-07-29 03:06:19,261 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1432#(<= |fibo1_#in~n| 1)} {1425#(<= 4 fibo2_~n)} #45#return; {1420#false} is VALID [2020-07-29 03:06:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:19,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:19,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 03:06:19,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823294638] [2020-07-29 03:06:19,262 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -377999504, now seen corresponding path program 1 times [2020-07-29 03:06:19,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:19,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732111698] [2020-07-29 03:06:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:19,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:19,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:19,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:19,546 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:19,546 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:19,547 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:19,547 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:19,547 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:06:19,547 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:19,547 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:19,547 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:19,548 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration3_Loop [2020-07-29 03:06:19,548 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:19,548 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:19,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:19,760 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:19,761 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:19,768 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:19,773 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:19,773 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:19,816 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:19,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:19,820 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:19,855 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:19,859 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:19,859 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=1} Honda state: {fibo2_#t~ret2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:19,896 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:19,900 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:19,900 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:19,940 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:19,945 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:19,945 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:19,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:19,982 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:20,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:06:20,024 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:20,600 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:06:20,601 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:20,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:20,602 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:20,602 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:20,602 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:06:20,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:20,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:20,602 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:20,602 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration3_Loop [2020-07-29 03:06:20,602 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:20,603 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:20,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:20,838 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:20,838 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:20,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:20,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:20,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:20,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:20,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:20,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:20,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:20,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:20,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:20,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:20,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:20,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:20,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:20,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:20,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:20,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:20,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:20,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:20,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:20,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:20,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:20,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:20,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:20,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:20,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:20,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:20,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:21,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:21,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:21,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:21,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:21,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:21,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:21,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:21,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:21,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:21,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:21,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:21,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:21,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:21,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:21,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:21,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:21,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:21,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:21,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:21,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:21,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:21,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:21,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:21,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:21,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:21,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:21,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:06:21,103 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:06:21,103 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:21,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:06:21,107 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:06:21,107 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:06:21,107 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2020-07-29 03:06:21,133 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:06:21,137 INFO L393 LassoCheck]: Loop: "call #t~ret3 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#45#return;" [2020-07-29 03:06:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:21,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:06:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:21,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:21,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {1478#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {1478#unseeded} is VALID [2020-07-29 03:06:21,266 INFO L263 TraceCheckUtils]: 1: Hoare triple {1478#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {1478#unseeded} is VALID [2020-07-29 03:06:21,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {1478#unseeded} ~n := #in~n; {1478#unseeded} is VALID [2020-07-29 03:06:21,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {1478#unseeded} assume !(~n < 1); {1478#unseeded} is VALID [2020-07-29 03:06:21,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {1478#unseeded} assume !(1 == ~n); {1478#unseeded} is VALID [2020-07-29 03:06:21,268 INFO L263 TraceCheckUtils]: 5: Hoare triple {1478#unseeded} call #t~ret0 := fibo2(~n - 1); {1478#unseeded} is VALID [2020-07-29 03:06:21,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {1478#unseeded} ~n := #in~n; {1478#unseeded} is VALID [2020-07-29 03:06:21,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {1478#unseeded} assume !(~n < 1); {1478#unseeded} is VALID [2020-07-29 03:06:21,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {1478#unseeded} assume !(1 == ~n); {1478#unseeded} is VALID [2020-07-29 03:06:21,270 INFO L263 TraceCheckUtils]: 9: Hoare triple {1478#unseeded} call #t~ret2 := fibo1(~n - 1); {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:21,271 INFO L280 TraceCheckUtils]: 10: Hoare triple {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:21,271 INFO L280 TraceCheckUtils]: 11: Hoare triple {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:21,272 INFO L280 TraceCheckUtils]: 12: Hoare triple {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:21,272 INFO L280 TraceCheckUtils]: 13: Hoare triple {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:21,274 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1523#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1478#unseeded} #45#return; {1478#unseeded} is VALID [2020-07-29 03:06:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:21,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 03:06:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:21,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:21,704 INFO L263 TraceCheckUtils]: 0: Hoare triple {1481#(>= oldRank0 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {1539#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:21,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {1539#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {1543#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:21,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {1543#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {1543#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:21,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {1543#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {1543#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:21,709 INFO L263 TraceCheckUtils]: 4: Hoare triple {1543#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret0 := fibo2(~n - 1); {1553#(<= (+ |fibo2_#in~n| 3) oldRank0)} is VALID [2020-07-29 03:06:21,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {1553#(<= (+ |fibo2_#in~n| 3) oldRank0)} ~n := #in~n; {1557#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:21,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {1557#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {1557#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:21,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {1557#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {1557#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:21,711 INFO L263 TraceCheckUtils]: 8: Hoare triple {1557#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret2 := fibo1(~n - 1); {1567#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:21,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {1567#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {1571#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:21,713 INFO L280 TraceCheckUtils]: 10: Hoare triple {1571#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {1575#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:21,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {1575#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {1575#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:21,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {1575#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {1575#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:21,729 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1575#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {1557#(<= (+ fibo2_~n 3) oldRank0)} #45#return; {1491#(or (and (> oldRank0 fibo2_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:21,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:06:21,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:21,774 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 [2020-07-29 03:06:21,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20 Second operand 10 states. [2020-07-29 03:06:23,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 75 transitions. cyclomatic complexity: 20. Second operand 10 states. Result 190 states and 262 transitions. Complement of second has 40 states. [2020-07-29 03:06:23,269 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 [2020-07-29 03:06:23,269 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:23,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. cyclomatic complexity: 20 [2020-07-29 03:06:23,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:23,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:23,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 03:06:23,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:06:23,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:23,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:23,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 262 transitions. [2020-07-29 03:06:23,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:06:23,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:23,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:23,300 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 75 transitions. cyclomatic complexity: 20 [2020-07-29 03:06:23,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 03:06:23,306 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states. [2020-07-29 03:06:23,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:06:23,316 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:23,316 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 190 states and 262 transitions. cyclomatic complexity: 77 [2020-07-29 03:06:23,338 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2020-07-29 03:06:23,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:23,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:23,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:23,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 190 letters. Loop has 190 letters. [2020-07-29 03:06:23,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 190 letters. Loop has 190 letters. [2020-07-29 03:06:23,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 190 letters. Loop has 190 letters. [2020-07-29 03:06:23,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:06:23,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:06:23,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:06:23,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:06:23,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:06:23,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:06:23,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:06:23,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:06:23,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:06:23,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2020-07-29 03:06:23,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 03:06:23,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 17 letters. Loop has 8 letters. [2020-07-29 03:06:23,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:06:23,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:06:23,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:06:23,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:06:23,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:06:23,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:06:23,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:06:23,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:06:23,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:06:23,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:06:23,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:06:23,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:06:23,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:06:23,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:06:23,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:06:23,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:06:23,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:06:23,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:06:23,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 26 letters. [2020-07-29 03:06:23,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 26 letters. [2020-07-29 03:06:23,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 26 letters. [2020-07-29 03:06:23,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:23,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:23,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:23,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:06:23,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:06:23,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:06:23,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 8 letters. [2020-07-29 03:06:23,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 31 letters. Loop has 8 letters. [2020-07-29 03:06:23,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 31 letters. Loop has 8 letters. [2020-07-29 03:06:23,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:06:23,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:06:23,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:06:23,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:06:23,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:06:23,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:06:23,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 28 letters. Loop has 8 letters. [2020-07-29 03:06:23,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 28 letters. Loop has 8 letters. [2020-07-29 03:06:23,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 28 letters. Loop has 8 letters. [2020-07-29 03:06:23,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:06:23,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:06:23,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:06:23,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 8 letters. [2020-07-29 03:06:23,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 30 letters. Loop has 8 letters. [2020-07-29 03:06:23,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 30 letters. Loop has 8 letters. [2020-07-29 03:06:23,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:06:23,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:06:23,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:06:23,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 8 letters. [2020-07-29 03:06:23,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 29 letters. Loop has 8 letters. [2020-07-29 03:06:23,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 29 letters. Loop has 8 letters. [2020-07-29 03:06:23,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:06:23,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:06:23,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 39 letters. Loop has 25 letters. [2020-07-29 03:06:23,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 13 letters. [2020-07-29 03:06:23,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 49 letters. [2020-07-29 03:06:23,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 8 letters. [2020-07-29 03:06:23,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 32 letters. Loop has 8 letters. [2020-07-29 03:06:23,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 32 letters. Loop has 8 letters. [2020-07-29 03:06:23,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 8 letters. [2020-07-29 03:06:23,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 31 letters. Loop has 8 letters. [2020-07-29 03:06:23,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 31 letters. Loop has 8 letters. [2020-07-29 03:06:23,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 37 letters. Loop has 14 letters. [2020-07-29 03:06:23,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 37 letters. Loop has 14 letters. [2020-07-29 03:06:23,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 37 letters. Loop has 14 letters. [2020-07-29 03:06:23,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 34 letters. Loop has 8 letters. [2020-07-29 03:06:23,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 34 letters. Loop has 8 letters. [2020-07-29 03:06:23,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 34 letters. Loop has 8 letters. [2020-07-29 03:06:23,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 8 letters. [2020-07-29 03:06:23,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 30 letters. Loop has 8 letters. [2020-07-29 03:06:23,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 30 letters. Loop has 8 letters. [2020-07-29 03:06:23,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 28 letters. Loop has 8 letters. [2020-07-29 03:06:23,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 28 letters. Loop has 8 letters. [2020-07-29 03:06:23,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 28 letters. Loop has 8 letters. [2020-07-29 03:06:23,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 33 letters. Loop has 8 letters. [2020-07-29 03:06:23,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 33 letters. Loop has 8 letters. [2020-07-29 03:06:23,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 33 letters. Loop has 8 letters. [2020-07-29 03:06:23,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 8 letters. [2020-07-29 03:06:23,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 29 letters. Loop has 8 letters. [2020-07-29 03:06:23,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 29 letters. Loop has 8 letters. [2020-07-29 03:06:23,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 13 letters. [2020-07-29 03:06:23,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 40 letters. Loop has 13 letters. [2020-07-29 03:06:23,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 13 letters. [2020-07-29 03:06:23,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 8 letters. [2020-07-29 03:06:23,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 35 letters. Loop has 8 letters. [2020-07-29 03:06:23,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 35 letters. Loop has 8 letters. [2020-07-29 03:06:23,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 37 letters. Loop has 14 letters. [2020-07-29 03:06:23,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 37 letters. Loop has 14 letters. [2020-07-29 03:06:23,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 37 letters. Loop has 14 letters. [2020-07-29 03:06:23,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 13 letters. [2020-07-29 03:06:23,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 40 letters. Loop has 13 letters. [2020-07-29 03:06:23,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 13 letters. [2020-07-29 03:06:23,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 75 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 26 letters. [2020-07-29 03:06:23,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 40 letters. Loop has 26 letters. [2020-07-29 03:06:23,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 190 states and 262 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 26 letters. [2020-07-29 03:06:23,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,429 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 03:06:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2020-07-29 03:06:23,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 72 transitions. Stem has 15 letters. Loop has 14 letters. [2020-07-29 03:06:23,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 72 transitions. Stem has 29 letters. Loop has 14 letters. [2020-07-29 03:06:23,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 72 transitions. Stem has 15 letters. Loop has 28 letters. [2020-07-29 03:06:23,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:23,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 262 transitions. cyclomatic complexity: 77 [2020-07-29 03:06:23,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:06:23,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 168 states and 236 transitions. [2020-07-29 03:06:23,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2020-07-29 03:06:23,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2020-07-29 03:06:23,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 236 transitions. [2020-07-29 03:06:23,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:23,482 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 236 transitions. [2020-07-29 03:06:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 236 transitions. [2020-07-29 03:06:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2020-07-29 03:06:23,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:23,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states and 236 transitions. Second operand 151 states. [2020-07-29 03:06:23,499 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states and 236 transitions. Second operand 151 states. [2020-07-29 03:06:23,500 INFO L87 Difference]: Start difference. First operand 168 states and 236 transitions. Second operand 151 states. [2020-07-29 03:06:23,501 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:23,531 INFO L93 Difference]: Finished difference Result 363 states and 491 transitions. [2020-07-29 03:06:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 491 transitions. [2020-07-29 03:06:23,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:23,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:23,535 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 168 states and 236 transitions. [2020-07-29 03:06:23,535 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 168 states and 236 transitions. [2020-07-29 03:06:23,536 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:23,568 INFO L93 Difference]: Finished difference Result 389 states and 525 transitions. [2020-07-29 03:06:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 525 transitions. [2020-07-29 03:06:23,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:23,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:23,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:23,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-29 03:06:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2020-07-29 03:06:23,580 INFO L711 BuchiCegarLoop]: Abstraction has 151 states and 205 transitions. [2020-07-29 03:06:23,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:06:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:06:23,581 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand 10 states. [2020-07-29 03:06:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:24,272 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2020-07-29 03:06:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:06:24,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:06:24,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:24,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 243 transitions. [2020-07-29 03:06:24,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:06:24,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 239 transitions. [2020-07-29 03:06:24,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-07-29 03:06:24,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-07-29 03:06:24,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 239 transitions. [2020-07-29 03:06:24,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:24,359 INFO L688 BuchiCegarLoop]: Abstraction has 179 states and 239 transitions. [2020-07-29 03:06:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 239 transitions. [2020-07-29 03:06:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2020-07-29 03:06:24,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:24,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states and 239 transitions. Second operand 166 states. [2020-07-29 03:06:24,371 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states and 239 transitions. Second operand 166 states. [2020-07-29 03:06:24,371 INFO L87 Difference]: Start difference. First operand 179 states and 239 transitions. Second operand 166 states. [2020-07-29 03:06:24,372 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:24,402 INFO L93 Difference]: Finished difference Result 400 states and 551 transitions. [2020-07-29 03:06:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 551 transitions. [2020-07-29 03:06:24,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:24,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:24,405 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 179 states and 239 transitions. [2020-07-29 03:06:24,405 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 179 states and 239 transitions. [2020-07-29 03:06:24,406 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:24,446 INFO L93 Difference]: Finished difference Result 400 states and 551 transitions. [2020-07-29 03:06:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 551 transitions. [2020-07-29 03:06:24,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:24,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:24,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:24,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-07-29 03:06:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2020-07-29 03:06:24,458 INFO L711 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2020-07-29 03:06:24,459 INFO L591 BuchiCegarLoop]: Abstraction has 166 states and 224 transitions. [2020-07-29 03:06:24,459 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:06:24,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 224 transitions. [2020-07-29 03:06:24,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:06:24,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:24,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:24,462 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 03:06:24,462 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:24,463 INFO L794 eck$LassoCheckResult]: Stem: 3524#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 3487#L37 call main_#t~ret4 := fibo1(main_~x~0);< 3492#fibo1ENTRY ~n := #in~n; 3589#L8 assume !(~n < 1); 3486#L10 assume !(1 == ~n); 3476#L13 call #t~ret0 := fibo2(~n - 1);< 3506#fibo2ENTRY ~n := #in~n; 3630#L18 assume !(~n < 1); 3629#L20 assume !(1 == ~n); 3475#L23 call #t~ret2 := fibo1(~n - 1);< 3477#fibo1ENTRY ~n := #in~n; 3522#L8 assume !(~n < 1); 3533#L10 assume !(1 == ~n); 3530#L13 call #t~ret0 := fibo2(~n - 1);< 3560#fibo2ENTRY ~n := #in~n; 3561#L18 assume !(~n < 1); 3562#L20 assume !(1 == ~n); 3513#L23 call #t~ret2 := fibo1(~n - 1);< 3477#fibo1ENTRY ~n := #in~n; 3522#L8 assume !(~n < 1); 3533#L10 assume !(1 == ~n); 3530#L13 call #t~ret0 := fibo2(~n - 1);< 3560#fibo2ENTRY ~n := #in~n; 3561#L18 assume ~n < 1;#res := 0; 3559#fibo2FINAL assume true; 3529#fibo2EXIT >#49#return; 3512#L13-1 call #t~ret1 := fibo2(~n - 2);< 3514#fibo2ENTRY ~n := #in~n; 3526#L18 assume !(~n < 1); 3536#L20 assume !(1 == ~n); 3513#L23 call #t~ret2 := fibo1(~n - 1);< 3477#fibo1ENTRY ~n := #in~n; 3523#L8 assume !(~n < 1); 3573#L10 assume 1 == ~n;#res := 1; 3571#fibo1FINAL assume true; 3570#fibo1EXIT >#45#return; 3508#L23-1 call #t~ret3 := fibo1(~n - 2);< 3482#fibo1ENTRY ~n := #in~n; 3564#L8 assume !(~n < 1); 3563#L10 assume !(1 == ~n); 3481#L13 call #t~ret0 := fibo2(~n - 1);< 3556#fibo2ENTRY ~n := #in~n; 3554#L18 assume ~n < 1;#res := 0; 3490#fibo2FINAL assume true; 3491#fibo2EXIT >#49#return; 3480#L13-1 call #t~ret1 := fibo2(~n - 2);< 3556#fibo2ENTRY ~n := #in~n; 3554#L18 assume !(~n < 1); 3549#L20 assume 1 == ~n;#res := 1; 3550#fibo2FINAL assume true; 3527#fibo2EXIT >#51#return; 3528#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3631#fibo1FINAL assume true; 3628#fibo1EXIT >#47#return; 3626#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 3622#fibo2FINAL assume true; 3621#fibo2EXIT >#51#return; 3528#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3631#fibo1FINAL assume true; 3628#fibo1EXIT >#45#return; 3484#L23-1 call #t~ret3 := fibo1(~n - 2);< 3474#fibo1ENTRY ~n := #in~n; 3617#L8 assume !(~n < 1); 3483#L10 assume !(1 == ~n); 3471#L13 call #t~ret0 := fibo2(~n - 1);< 3505#fibo2ENTRY ~n := #in~n; 3525#L18 assume ~n < 1;#res := 0; 3535#fibo2FINAL assume true; 3620#fibo2EXIT >#49#return; 3473#L13-1 call #t~ret1 := fibo2(~n - 2);< 3505#fibo2ENTRY ~n := #in~n; 3525#L18 assume ~n < 1;#res := 0; 3535#fibo2FINAL assume true; 3620#fibo2EXIT >#51#return; 3528#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 3631#fibo1FINAL assume true; 3628#fibo1EXIT >#47#return; 3626#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 3622#fibo2FINAL assume true; 3621#fibo2EXIT >#49#return; 3473#L13-1 [2020-07-29 03:06:24,463 INFO L796 eck$LassoCheckResult]: Loop: 3473#L13-1 call #t~ret1 := fibo2(~n - 2);< 3505#fibo2ENTRY ~n := #in~n; 3525#L18 assume !(~n < 1); 3534#L20 assume !(1 == ~n); 3470#L23 call #t~ret2 := fibo1(~n - 1);< 3474#fibo1ENTRY ~n := #in~n; 3617#L8 assume !(~n < 1); 3483#L10 assume !(1 == ~n); 3471#L13 call #t~ret0 := fibo2(~n - 1);< 3505#fibo2ENTRY ~n := #in~n; 3525#L18 assume ~n < 1;#res := 0; 3535#fibo2FINAL assume true; 3620#fibo2EXIT >#49#return; 3473#L13-1 [2020-07-29 03:06:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1634459699, now seen corresponding path program 1 times [2020-07-29 03:06:24,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:24,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527177176] [2020-07-29 03:06:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-07-29 03:06:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,744 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,797 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,798 INFO L280 TraceCheckUtils]: 3: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,803 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5020#true} {5020#true} #45#return; {5020#true} is VALID [2020-07-29 03:06:24,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,831 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:24,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,841 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:24,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,842 INFO L263 TraceCheckUtils]: 3: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,843 INFO L280 TraceCheckUtils]: 6: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,843 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:24,843 INFO L263 TraceCheckUtils]: 8: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,844 INFO L280 TraceCheckUtils]: 9: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,845 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:24,845 INFO L280 TraceCheckUtils]: 14: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:24,845 INFO L280 TraceCheckUtils]: 15: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,846 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {5020#true} {5020#true} #47#return; {5020#true} is VALID [2020-07-29 03:06:24,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,847 INFO L263 TraceCheckUtils]: 3: Hoare triple {5020#true} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,848 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {5020#true} {5020#true} #45#return; {5020#true} is VALID [2020-07-29 03:06:24,848 INFO L263 TraceCheckUtils]: 9: Hoare triple {5020#true} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,849 INFO L280 TraceCheckUtils]: 12: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,849 INFO L263 TraceCheckUtils]: 13: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,850 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:24,851 INFO L263 TraceCheckUtils]: 18: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,851 INFO L280 TraceCheckUtils]: 19: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,851 INFO L280 TraceCheckUtils]: 20: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,852 INFO L280 TraceCheckUtils]: 21: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,852 INFO L280 TraceCheckUtils]: 22: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,852 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:24,852 INFO L280 TraceCheckUtils]: 24: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:24,853 INFO L280 TraceCheckUtils]: 25: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,853 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {5020#true} {5020#true} #47#return; {5020#true} is VALID [2020-07-29 03:06:24,853 INFO L280 TraceCheckUtils]: 27: Hoare triple {5020#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5020#true} is VALID [2020-07-29 03:06:24,853 INFO L280 TraceCheckUtils]: 28: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,854 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5153#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:24,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {5153#(< 0 fibo1_~n)} assume !(1 == ~n); {5154#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:24,860 INFO L263 TraceCheckUtils]: 3: Hoare triple {5154#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,863 INFO L280 TraceCheckUtils]: 6: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,864 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,864 INFO L263 TraceCheckUtils]: 8: Hoare triple {5021#false} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,864 INFO L280 TraceCheckUtils]: 9: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,865 INFO L280 TraceCheckUtils]: 10: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,865 INFO L280 TraceCheckUtils]: 11: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,865 INFO L263 TraceCheckUtils]: 12: Hoare triple {5020#true} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,866 INFO L280 TraceCheckUtils]: 14: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,866 INFO L280 TraceCheckUtils]: 15: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,866 INFO L280 TraceCheckUtils]: 16: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,871 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {5020#true} {5020#true} #45#return; {5020#true} is VALID [2020-07-29 03:06:24,871 INFO L263 TraceCheckUtils]: 18: Hoare triple {5020#true} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,871 INFO L280 TraceCheckUtils]: 20: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,872 INFO L280 TraceCheckUtils]: 21: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,872 INFO L263 TraceCheckUtils]: 22: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,872 INFO L280 TraceCheckUtils]: 23: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,872 INFO L280 TraceCheckUtils]: 24: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,873 INFO L280 TraceCheckUtils]: 25: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,873 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:24,873 INFO L263 TraceCheckUtils]: 27: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,873 INFO L280 TraceCheckUtils]: 28: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,874 INFO L280 TraceCheckUtils]: 29: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,874 INFO L280 TraceCheckUtils]: 30: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,874 INFO L280 TraceCheckUtils]: 31: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,874 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:24,874 INFO L280 TraceCheckUtils]: 33: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:24,875 INFO L280 TraceCheckUtils]: 34: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,875 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {5020#true} {5020#true} #47#return; {5020#true} is VALID [2020-07-29 03:06:24,876 INFO L280 TraceCheckUtils]: 36: Hoare triple {5020#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5020#true} is VALID [2020-07-29 03:06:24,876 INFO L280 TraceCheckUtils]: 37: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,876 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,876 INFO L280 TraceCheckUtils]: 39: Hoare triple {5021#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5021#false} is VALID [2020-07-29 03:06:24,877 INFO L280 TraceCheckUtils]: 40: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:24,877 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {5021#false} {5020#true} #45#return; {5021#false} is VALID [2020-07-29 03:06:24,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-07-29 03:06:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,916 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:24,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5153#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:24,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {5153#(< 0 fibo1_~n)} assume !(1 == ~n); {5154#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:24,923 INFO L263 TraceCheckUtils]: 3: Hoare triple {5154#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,924 INFO L280 TraceCheckUtils]: 5: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,926 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,926 INFO L263 TraceCheckUtils]: 8: Hoare triple {5021#false} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,927 INFO L280 TraceCheckUtils]: 9: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,927 INFO L280 TraceCheckUtils]: 10: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,927 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {5021#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5021#false} is VALID [2020-07-29 03:06:24,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:24,928 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {5021#false} {5021#false} #47#return; {5021#false} is VALID [2020-07-29 03:06:24,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,929 INFO L263 TraceCheckUtils]: 3: Hoare triple {5020#true} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {5020#true} assume !(~n < 1); {5153#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:24,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {5153#(< 0 fibo1_~n)} assume !(1 == ~n); {5154#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:24,931 INFO L263 TraceCheckUtils]: 7: Hoare triple {5154#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,934 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,935 INFO L263 TraceCheckUtils]: 12: Hoare triple {5021#false} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,935 INFO L280 TraceCheckUtils]: 15: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,936 INFO L263 TraceCheckUtils]: 16: Hoare triple {5020#true} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,936 INFO L280 TraceCheckUtils]: 17: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,936 INFO L280 TraceCheckUtils]: 18: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,936 INFO L280 TraceCheckUtils]: 19: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,936 INFO L280 TraceCheckUtils]: 20: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,937 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {5020#true} {5020#true} #45#return; {5020#true} is VALID [2020-07-29 03:06:24,937 INFO L263 TraceCheckUtils]: 22: Hoare triple {5020#true} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,937 INFO L280 TraceCheckUtils]: 25: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,938 INFO L263 TraceCheckUtils]: 26: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,938 INFO L280 TraceCheckUtils]: 27: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,938 INFO L280 TraceCheckUtils]: 28: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,938 INFO L280 TraceCheckUtils]: 29: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,939 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:24,939 INFO L263 TraceCheckUtils]: 31: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,939 INFO L280 TraceCheckUtils]: 32: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,939 INFO L280 TraceCheckUtils]: 33: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,939 INFO L280 TraceCheckUtils]: 34: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,940 INFO L280 TraceCheckUtils]: 35: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,940 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:24,940 INFO L280 TraceCheckUtils]: 37: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:24,940 INFO L280 TraceCheckUtils]: 38: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,941 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5020#true} {5020#true} #47#return; {5020#true} is VALID [2020-07-29 03:06:24,941 INFO L280 TraceCheckUtils]: 40: Hoare triple {5020#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5020#true} is VALID [2020-07-29 03:06:24,941 INFO L280 TraceCheckUtils]: 41: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,941 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,941 INFO L280 TraceCheckUtils]: 43: Hoare triple {5021#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5021#false} is VALID [2020-07-29 03:06:24,942 INFO L280 TraceCheckUtils]: 44: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:24,942 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5021#false} {5020#true} #45#return; {5021#false} is VALID [2020-07-29 03:06:24,942 INFO L263 TraceCheckUtils]: 46: Hoare triple {5021#false} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,942 INFO L280 TraceCheckUtils]: 47: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,943 INFO L280 TraceCheckUtils]: 48: Hoare triple {5020#true} assume !(~n < 1); {5153#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:24,944 INFO L280 TraceCheckUtils]: 49: Hoare triple {5153#(< 0 fibo1_~n)} assume !(1 == ~n); {5154#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:24,944 INFO L263 TraceCheckUtils]: 50: Hoare triple {5154#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,945 INFO L280 TraceCheckUtils]: 51: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,945 INFO L280 TraceCheckUtils]: 52: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,946 INFO L280 TraceCheckUtils]: 53: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,947 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,947 INFO L263 TraceCheckUtils]: 55: Hoare triple {5021#false} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,948 INFO L280 TraceCheckUtils]: 56: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,948 INFO L280 TraceCheckUtils]: 57: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,948 INFO L280 TraceCheckUtils]: 58: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,948 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,948 INFO L280 TraceCheckUtils]: 60: Hoare triple {5021#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5021#false} is VALID [2020-07-29 03:06:24,949 INFO L280 TraceCheckUtils]: 61: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:24,949 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {5021#false} {5021#false} #47#return; {5021#false} is VALID [2020-07-29 03:06:24,949 INFO L280 TraceCheckUtils]: 63: Hoare triple {5021#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5021#false} is VALID [2020-07-29 03:06:24,949 INFO L280 TraceCheckUtils]: 64: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:24,950 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {5021#false} {5028#(<= fibo1_~n 3)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {5022#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:24,954 INFO L263 TraceCheckUtils]: 1: Hoare triple {5022#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {5023#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:24,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {5023#(<= |fibo1_#in~n| 5)} ~n := #in~n; {5024#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:24,955 INFO L280 TraceCheckUtils]: 3: Hoare triple {5024#(<= fibo1_~n 5)} assume !(~n < 1); {5024#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:24,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {5024#(<= fibo1_~n 5)} assume !(1 == ~n); {5024#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:24,963 INFO L263 TraceCheckUtils]: 5: Hoare triple {5024#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {5025#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:24,970 INFO L280 TraceCheckUtils]: 6: Hoare triple {5025#(<= |fibo2_#in~n| 4)} ~n := #in~n; {5026#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:24,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {5026#(<= fibo2_~n 4)} assume !(~n < 1); {5026#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:24,975 INFO L280 TraceCheckUtils]: 8: Hoare triple {5026#(<= fibo2_~n 4)} assume !(1 == ~n); {5026#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:24,980 INFO L263 TraceCheckUtils]: 9: Hoare triple {5026#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {5027#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:24,981 INFO L280 TraceCheckUtils]: 10: Hoare triple {5027#(<= |fibo1_#in~n| 3)} ~n := #in~n; {5028#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:24,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {5028#(<= fibo1_~n 3)} assume !(~n < 1); {5028#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:24,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {5028#(<= fibo1_~n 3)} assume !(1 == ~n); {5028#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:24,982 INFO L263 TraceCheckUtils]: 13: Hoare triple {5028#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,983 INFO L280 TraceCheckUtils]: 14: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,983 INFO L280 TraceCheckUtils]: 16: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,983 INFO L263 TraceCheckUtils]: 17: Hoare triple {5020#true} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,985 INFO L280 TraceCheckUtils]: 19: Hoare triple {5020#true} assume !(~n < 1); {5153#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:24,985 INFO L280 TraceCheckUtils]: 20: Hoare triple {5153#(< 0 fibo1_~n)} assume !(1 == ~n); {5154#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:24,985 INFO L263 TraceCheckUtils]: 21: Hoare triple {5154#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,986 INFO L280 TraceCheckUtils]: 22: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:24,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,987 INFO L280 TraceCheckUtils]: 24: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:24,988 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:24,988 INFO L263 TraceCheckUtils]: 26: Hoare triple {5021#false} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,988 INFO L280 TraceCheckUtils]: 27: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,989 INFO L280 TraceCheckUtils]: 28: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,989 INFO L280 TraceCheckUtils]: 29: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,989 INFO L263 TraceCheckUtils]: 30: Hoare triple {5020#true} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,989 INFO L280 TraceCheckUtils]: 31: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,989 INFO L280 TraceCheckUtils]: 32: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,989 INFO L280 TraceCheckUtils]: 33: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,990 INFO L280 TraceCheckUtils]: 34: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,990 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {5020#true} {5020#true} #45#return; {5020#true} is VALID [2020-07-29 03:06:24,990 INFO L263 TraceCheckUtils]: 36: Hoare triple {5020#true} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,990 INFO L280 TraceCheckUtils]: 37: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,990 INFO L280 TraceCheckUtils]: 38: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,990 INFO L280 TraceCheckUtils]: 39: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:24,991 INFO L263 TraceCheckUtils]: 40: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:24,991 INFO L280 TraceCheckUtils]: 41: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,991 INFO L280 TraceCheckUtils]: 42: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:24,991 INFO L280 TraceCheckUtils]: 43: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,991 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:24,992 INFO L263 TraceCheckUtils]: 45: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,992 INFO L280 TraceCheckUtils]: 46: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:24,992 INFO L280 TraceCheckUtils]: 47: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:24,992 INFO L280 TraceCheckUtils]: 48: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:24,992 INFO L280 TraceCheckUtils]: 49: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,992 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:24,993 INFO L280 TraceCheckUtils]: 51: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:24,993 INFO L280 TraceCheckUtils]: 52: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,993 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {5020#true} {5020#true} #47#return; {5020#true} is VALID [2020-07-29 03:06:24,993 INFO L280 TraceCheckUtils]: 54: Hoare triple {5020#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5020#true} is VALID [2020-07-29 03:06:24,993 INFO L280 TraceCheckUtils]: 55: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:24,993 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:24,994 INFO L280 TraceCheckUtils]: 57: Hoare triple {5021#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5021#false} is VALID [2020-07-29 03:06:24,994 INFO L280 TraceCheckUtils]: 58: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:24,994 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {5021#false} {5020#true} #45#return; {5021#false} is VALID [2020-07-29 03:06:24,994 INFO L263 TraceCheckUtils]: 60: Hoare triple {5021#false} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:24,994 INFO L280 TraceCheckUtils]: 61: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,001 INFO L280 TraceCheckUtils]: 62: Hoare triple {5020#true} assume !(~n < 1); {5153#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:25,005 INFO L280 TraceCheckUtils]: 63: Hoare triple {5153#(< 0 fibo1_~n)} assume !(1 == ~n); {5154#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:25,005 INFO L263 TraceCheckUtils]: 64: Hoare triple {5154#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,007 INFO L280 TraceCheckUtils]: 65: Hoare triple {5020#true} ~n := #in~n; {5189#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,008 INFO L280 TraceCheckUtils]: 66: Hoare triple {5189#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:25,009 INFO L280 TraceCheckUtils]: 67: Hoare triple {5190#(<= |fibo2_#in~n| 0)} assume true; {5190#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:25,010 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {5190#(<= |fibo2_#in~n| 0)} {5154#(< 1 fibo1_~n)} #49#return; {5021#false} is VALID [2020-07-29 03:06:25,010 INFO L263 TraceCheckUtils]: 69: Hoare triple {5021#false} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:25,010 INFO L280 TraceCheckUtils]: 70: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,010 INFO L280 TraceCheckUtils]: 71: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:25,010 INFO L280 TraceCheckUtils]: 72: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,011 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {5020#true} {5021#false} #51#return; {5021#false} is VALID [2020-07-29 03:06:25,011 INFO L280 TraceCheckUtils]: 74: Hoare triple {5021#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5021#false} is VALID [2020-07-29 03:06:25,011 INFO L280 TraceCheckUtils]: 75: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:25,011 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {5021#false} {5021#false} #47#return; {5021#false} is VALID [2020-07-29 03:06:25,011 INFO L280 TraceCheckUtils]: 77: Hoare triple {5021#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5021#false} is VALID [2020-07-29 03:06:25,012 INFO L280 TraceCheckUtils]: 78: Hoare triple {5021#false} assume true; {5021#false} is VALID [2020-07-29 03:06:25,012 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {5021#false} {5028#(<= fibo1_~n 3)} #49#return; {5021#false} is VALID [2020-07-29 03:06:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 43 proven. 68 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-07-29 03:06:25,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527177176] [2020-07-29 03:06:25,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48702905] [2020-07-29 03:06:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:06:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:25,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:25,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {5020#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {5022#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:25,570 INFO L263 TraceCheckUtils]: 1: Hoare triple {5022#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {5023#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:25,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {5023#(<= |fibo1_#in~n| 5)} ~n := #in~n; {5024#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:25,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {5024#(<= fibo1_~n 5)} assume !(~n < 1); {5024#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:25,577 INFO L280 TraceCheckUtils]: 4: Hoare triple {5024#(<= fibo1_~n 5)} assume !(1 == ~n); {5024#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:25,578 INFO L263 TraceCheckUtils]: 5: Hoare triple {5024#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {5025#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:25,579 INFO L280 TraceCheckUtils]: 6: Hoare triple {5025#(<= |fibo2_#in~n| 4)} ~n := #in~n; {5026#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:25,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {5026#(<= fibo2_~n 4)} assume !(~n < 1); {5026#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:25,580 INFO L280 TraceCheckUtils]: 8: Hoare triple {5026#(<= fibo2_~n 4)} assume !(1 == ~n); {5026#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:25,581 INFO L263 TraceCheckUtils]: 9: Hoare triple {5026#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {5027#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:25,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {5027#(<= |fibo1_#in~n| 3)} ~n := #in~n; {5028#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:25,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {5028#(<= fibo1_~n 3)} assume !(~n < 1); {5028#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:25,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {5028#(<= fibo1_~n 3)} assume !(1 == ~n); {5028#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:25,583 INFO L263 TraceCheckUtils]: 13: Hoare triple {5028#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {5020#true} ~n := #in~n; {5275#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {5275#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5275#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {5275#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {5275#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,585 INFO L263 TraceCheckUtils]: 17: Hoare triple {5275#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {5020#true} ~n := #in~n; {5288#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {5288#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {5288#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {5288#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {5288#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,587 INFO L263 TraceCheckUtils]: 21: Hoare triple {5288#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,588 INFO L280 TraceCheckUtils]: 23: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:25,588 INFO L280 TraceCheckUtils]: 24: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,589 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {5020#true} {5288#(<= fibo1_~n |fibo1_#in~n|)} #49#return; {5288#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,589 INFO L263 TraceCheckUtils]: 26: Hoare triple {5288#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:25,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {5020#true} ~n := #in~n; {5275#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {5275#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {5319#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,591 INFO L280 TraceCheckUtils]: 29: Hoare triple {5319#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {5319#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,591 INFO L263 TraceCheckUtils]: 30: Hoare triple {5319#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,591 INFO L280 TraceCheckUtils]: 31: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,592 INFO L280 TraceCheckUtils]: 32: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:25,592 INFO L280 TraceCheckUtils]: 33: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:25,592 INFO L280 TraceCheckUtils]: 34: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,593 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {5020#true} {5319#(<= 1 |fibo2_#in~n|)} #45#return; {5319#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,594 INFO L263 TraceCheckUtils]: 36: Hoare triple {5319#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:25,594 INFO L280 TraceCheckUtils]: 37: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,594 INFO L280 TraceCheckUtils]: 38: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:25,594 INFO L280 TraceCheckUtils]: 39: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:25,595 INFO L263 TraceCheckUtils]: 40: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,595 INFO L280 TraceCheckUtils]: 41: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,595 INFO L280 TraceCheckUtils]: 42: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:25,595 INFO L280 TraceCheckUtils]: 43: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,595 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:25,596 INFO L263 TraceCheckUtils]: 45: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:25,596 INFO L280 TraceCheckUtils]: 46: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,596 INFO L280 TraceCheckUtils]: 47: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:25,596 INFO L280 TraceCheckUtils]: 48: Hoare triple {5020#true} assume 1 == ~n;#res := 1; {5020#true} is VALID [2020-07-29 03:06:25,596 INFO L280 TraceCheckUtils]: 49: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,596 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:25,597 INFO L280 TraceCheckUtils]: 51: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:25,597 INFO L280 TraceCheckUtils]: 52: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,598 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {5020#true} {5319#(<= 1 |fibo2_#in~n|)} #47#return; {5319#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,598 INFO L280 TraceCheckUtils]: 54: Hoare triple {5319#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5319#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,598 INFO L280 TraceCheckUtils]: 55: Hoare triple {5319#(<= 1 |fibo2_#in~n|)} assume true; {5319#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,599 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {5319#(<= 1 |fibo2_#in~n|)} {5288#(<= fibo1_~n |fibo1_#in~n|)} #51#return; {5404#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,600 INFO L280 TraceCheckUtils]: 57: Hoare triple {5404#(<= 3 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5404#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,600 INFO L280 TraceCheckUtils]: 58: Hoare triple {5404#(<= 3 |fibo1_#in~n|)} assume true; {5404#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:25,601 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {5404#(<= 3 |fibo1_#in~n|)} {5275#(<= fibo2_~n |fibo2_#in~n|)} #45#return; {5414#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,602 INFO L263 TraceCheckUtils]: 60: Hoare triple {5414#(<= 4 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {5020#true} is VALID [2020-07-29 03:06:25,602 INFO L280 TraceCheckUtils]: 61: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,602 INFO L280 TraceCheckUtils]: 62: Hoare triple {5020#true} assume !(~n < 1); {5020#true} is VALID [2020-07-29 03:06:25,603 INFO L280 TraceCheckUtils]: 63: Hoare triple {5020#true} assume !(1 == ~n); {5020#true} is VALID [2020-07-29 03:06:25,603 INFO L263 TraceCheckUtils]: 64: Hoare triple {5020#true} call #t~ret0 := fibo2(~n - 1); {5020#true} is VALID [2020-07-29 03:06:25,603 INFO L280 TraceCheckUtils]: 65: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,603 INFO L280 TraceCheckUtils]: 66: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:25,604 INFO L280 TraceCheckUtils]: 67: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,604 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {5020#true} {5020#true} #49#return; {5020#true} is VALID [2020-07-29 03:06:25,604 INFO L263 TraceCheckUtils]: 69: Hoare triple {5020#true} call #t~ret1 := fibo2(~n - 2); {5020#true} is VALID [2020-07-29 03:06:25,604 INFO L280 TraceCheckUtils]: 70: Hoare triple {5020#true} ~n := #in~n; {5020#true} is VALID [2020-07-29 03:06:25,604 INFO L280 TraceCheckUtils]: 71: Hoare triple {5020#true} assume ~n < 1;#res := 0; {5020#true} is VALID [2020-07-29 03:06:25,605 INFO L280 TraceCheckUtils]: 72: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,605 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {5020#true} {5020#true} #51#return; {5020#true} is VALID [2020-07-29 03:06:25,605 INFO L280 TraceCheckUtils]: 74: Hoare triple {5020#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {5020#true} is VALID [2020-07-29 03:06:25,605 INFO L280 TraceCheckUtils]: 75: Hoare triple {5020#true} assume true; {5020#true} is VALID [2020-07-29 03:06:25,613 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {5020#true} {5414#(<= 4 |fibo2_#in~n|)} #47#return; {5414#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,614 INFO L280 TraceCheckUtils]: 77: Hoare triple {5414#(<= 4 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {5414#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,615 INFO L280 TraceCheckUtils]: 78: Hoare triple {5414#(<= 4 |fibo2_#in~n|)} assume true; {5414#(<= 4 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,617 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {5414#(<= 4 |fibo2_#in~n|)} {5028#(<= fibo1_~n 3)} #49#return; {5021#false} is VALID [2020-07-29 03:06:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 30 proven. 79 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-29 03:06:25,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:25,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2020-07-29 03:06:25,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624397687] [2020-07-29 03:06:25,625 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash -820900976, now seen corresponding path program 1 times [2020-07-29 03:06:25,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:25,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171843828] [2020-07-29 03:06:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:25,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:25,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {5472#true} ~n := #in~n; {5480#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {5480#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5481#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:25,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {5481#(<= |fibo2_#in~n| 0)} assume true; {5481#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:25,733 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5481#(<= |fibo2_#in~n| 0)} {5475#(< 1 fibo1_~n)} #49#return; {5473#false} is VALID [2020-07-29 03:06:25,734 INFO L263 TraceCheckUtils]: 0: Hoare triple {5472#true} call #t~ret1 := fibo2(~n - 2); {5472#true} is VALID [2020-07-29 03:06:25,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {5472#true} ~n := #in~n; {5472#true} is VALID [2020-07-29 03:06:25,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {5472#true} assume !(~n < 1); {5472#true} is VALID [2020-07-29 03:06:25,734 INFO L280 TraceCheckUtils]: 3: Hoare triple {5472#true} assume !(1 == ~n); {5472#true} is VALID [2020-07-29 03:06:25,735 INFO L263 TraceCheckUtils]: 4: Hoare triple {5472#true} call #t~ret2 := fibo1(~n - 1); {5472#true} is VALID [2020-07-29 03:06:25,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {5472#true} ~n := #in~n; {5472#true} is VALID [2020-07-29 03:06:25,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {5472#true} assume !(~n < 1); {5474#(< 0 fibo1_~n)} is VALID [2020-07-29 03:06:25,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {5474#(< 0 fibo1_~n)} assume !(1 == ~n); {5475#(< 1 fibo1_~n)} is VALID [2020-07-29 03:06:25,737 INFO L263 TraceCheckUtils]: 8: Hoare triple {5475#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {5472#true} is VALID [2020-07-29 03:06:25,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {5472#true} ~n := #in~n; {5480#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:25,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {5480#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5481#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:25,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {5481#(<= |fibo2_#in~n| 0)} assume true; {5481#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:25,741 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5481#(<= |fibo2_#in~n| 0)} {5475#(< 1 fibo1_~n)} #49#return; {5473#false} is VALID [2020-07-29 03:06:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:06:25,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171843828] [2020-07-29 03:06:25,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:06:25,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:06:25,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812840302] [2020-07-29 03:06:25,745 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:06:25,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:25,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:06:25,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:06:25,746 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. cyclomatic complexity: 63 Second operand 6 states. [2020-07-29 03:06:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:25,959 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2020-07-29 03:06:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:06:25,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:06:25,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:25,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 235 transitions. [2020-07-29 03:06:25,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:06:26,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 171 states and 221 transitions. [2020-07-29 03:06:26,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2020-07-29 03:06:26,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2020-07-29 03:06:26,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 221 transitions. [2020-07-29 03:06:26,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:26,021 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 221 transitions. [2020-07-29 03:06:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 221 transitions. [2020-07-29 03:06:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2020-07-29 03:06:26,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:26,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states and 221 transitions. Second operand 157 states. [2020-07-29 03:06:26,047 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states and 221 transitions. Second operand 157 states. [2020-07-29 03:06:26,047 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand 157 states. [2020-07-29 03:06:26,049 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:26,073 INFO L93 Difference]: Finished difference Result 361 states and 492 transitions. [2020-07-29 03:06:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 492 transitions. [2020-07-29 03:06:26,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:26,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:26,077 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 171 states and 221 transitions. [2020-07-29 03:06:26,077 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 171 states and 221 transitions. [2020-07-29 03:06:26,078 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:26,102 INFO L93 Difference]: Finished difference Result 361 states and 492 transitions. [2020-07-29 03:06:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 492 transitions. [2020-07-29 03:06:26,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:26,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:26,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:26,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-29 03:06:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2020-07-29 03:06:26,113 INFO L711 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2020-07-29 03:06:26,113 INFO L591 BuchiCegarLoop]: Abstraction has 157 states and 205 transitions. [2020-07-29 03:06:26,114 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:06:26,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 205 transitions. [2020-07-29 03:06:26,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:06:26,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:26,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:26,118 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2020-07-29 03:06:26,118 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 03:06:26,118 INFO L794 eck$LassoCheckResult]: Stem: 5716#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 5685#L37 call main_#t~ret4 := fibo1(main_~x~0);< 5686#fibo1ENTRY ~n := #in~n; 5726#L8 assume !(~n < 1); 5690#L10 assume !(1 == ~n); 5691#L13 call #t~ret0 := fibo2(~n - 1);< 5704#fibo2ENTRY ~n := #in~n; 5805#L18 assume !(~n < 1); 5804#L20 assume !(1 == ~n); 5711#L23 call #t~ret2 := fibo1(~n - 1);< 5676#fibo1ENTRY ~n := #in~n; 5749#L8 assume !(~n < 1); 5745#L10 assume !(1 == ~n); 5674#L13 call #t~ret0 := fibo2(~n - 1);< 5739#fibo2ENTRY ~n := #in~n; 5760#L18 assume !(~n < 1); 5759#L20 assume !(1 == ~n); 5673#L23 call #t~ret2 := fibo1(~n - 1);< 5676#fibo1ENTRY ~n := #in~n; 5749#L8 assume !(~n < 1); 5745#L10 assume !(1 == ~n); 5674#L13 call #t~ret0 := fibo2(~n - 1);< 5739#fibo2ENTRY ~n := #in~n; 5760#L18 assume !(~n < 1); 5759#L20 assume 1 == ~n;#res := 1; 5683#fibo2FINAL assume true; 5684#fibo2EXIT >#49#return; 5675#L13-1 call #t~ret1 := fibo2(~n - 2);< 5712#fibo2ENTRY ~n := #in~n; 5722#L18 assume !(~n < 1); 5728#L20 assume !(1 == ~n); 5673#L23 call #t~ret2 := fibo1(~n - 1);< 5676#fibo1ENTRY ~n := #in~n; 5751#L8 assume !(~n < 1); 5762#L10 assume 1 == ~n;#res := 1; 5761#fibo1FINAL assume true; 5758#fibo1EXIT >#45#return; 5688#L23-1 call #t~ret3 := fibo1(~n - 2);< 5680#fibo1ENTRY ~n := #in~n; 5754#L8 assume !(~n < 1); 5753#L10 assume !(1 == ~n); 5679#L13 call #t~ret0 := fibo2(~n - 1);< 5750#fibo2ENTRY ~n := #in~n; 5748#L18 assume !(~n < 1); 5741#L20 assume 1 == ~n;#res := 1; 5742#fibo2FINAL assume true; 5723#fibo2EXIT >#49#return; 5724#L13-1 call #t~ret1 := fibo2(~n - 2);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume ~n < 1;#res := 0; 5803#fibo2FINAL assume true; 5810#fibo2EXIT >#51#return; 5781#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5808#fibo1FINAL assume true; 5795#fibo1EXIT >#47#return; 5789#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5786#fibo2FINAL assume true; 5779#fibo2EXIT >#51#return; 5781#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5808#fibo1FINAL assume true; 5795#fibo1EXIT >#45#return; 5785#L23-1 call #t~ret3 := fibo1(~n - 2);< 5797#fibo1ENTRY ~n := #in~n; 5799#L8 assume !(~n < 1); 5790#L10 assume !(1 == ~n); 5780#L13 call #t~ret0 := fibo2(~n - 1);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume !(~n < 1); 5801#L20 assume 1 == ~n;#res := 1; 5793#fibo2FINAL assume true; 5788#fibo2EXIT >#49#return; 5724#L13-1 call #t~ret1 := fibo2(~n - 2);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume ~n < 1;#res := 0; 5803#fibo2FINAL assume true; 5810#fibo2EXIT >#51#return; 5781#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5808#fibo1FINAL assume true; 5795#fibo1EXIT >#47#return; 5789#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5786#fibo2FINAL assume true; 5779#fibo2EXIT >#49#return; 5724#L13-1 [2020-07-29 03:06:26,119 INFO L796 eck$LassoCheckResult]: Loop: 5724#L13-1 call #t~ret1 := fibo2(~n - 2);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume !(~n < 1); 5801#L20 assume !(1 == ~n); 5784#L23 call #t~ret2 := fibo1(~n - 1);< 5797#fibo1ENTRY ~n := #in~n; 5799#L8 assume !(~n < 1); 5790#L10 assume !(1 == ~n); 5780#L13 call #t~ret0 := fibo2(~n - 1);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume !(~n < 1); 5801#L20 assume !(1 == ~n); 5784#L23 call #t~ret2 := fibo1(~n - 1);< 5797#fibo1ENTRY ~n := #in~n; 5799#L8 assume !(~n < 1); 5790#L10 assume !(1 == ~n); 5780#L13 call #t~ret0 := fibo2(~n - 1);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume !(~n < 1); 5801#L20 assume 1 == ~n;#res := 1; 5793#fibo2FINAL assume true; 5788#fibo2EXIT >#49#return; 5724#L13-1 call #t~ret1 := fibo2(~n - 2);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume ~n < 1;#res := 0; 5803#fibo2FINAL assume true; 5810#fibo2EXIT >#51#return; 5781#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5808#fibo1FINAL assume true; 5795#fibo1EXIT >#45#return; 5785#L23-1 call #t~ret3 := fibo1(~n - 2);< 5797#fibo1ENTRY ~n := #in~n; 5799#L8 assume !(~n < 1); 5790#L10 assume !(1 == ~n); 5780#L13 call #t~ret0 := fibo2(~n - 1);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume !(~n < 1); 5801#L20 assume 1 == ~n;#res := 1; 5793#fibo2FINAL assume true; 5788#fibo2EXIT >#49#return; 5724#L13-1 call #t~ret1 := fibo2(~n - 2);< 5710#fibo2ENTRY ~n := #in~n; 5802#L18 assume ~n < 1;#res := 0; 5803#fibo2FINAL assume true; 5810#fibo2EXIT >#51#return; 5781#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 5808#fibo1FINAL assume true; 5795#fibo1EXIT >#47#return; 5789#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 5786#fibo2FINAL assume true; 5779#fibo2EXIT >#49#return; 5724#L13-1 [2020-07-29 03:06:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1470409633, now seen corresponding path program 2 times [2020-07-29 03:06:26,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:26,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177388560] [2020-07-29 03:06:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-07-29 03:06:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {7263#(<= |fibo2_#in~n| 1)} assume true; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,328 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7263#(<= |fibo2_#in~n| 1)} {7089#true} #49#return; {7231#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:26,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,363 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #45#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,377 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,381 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,382 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,383 INFO L263 TraceCheckUtils]: 3: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,384 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,384 INFO L263 TraceCheckUtils]: 9: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,385 INFO L280 TraceCheckUtils]: 10: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,385 INFO L280 TraceCheckUtils]: 11: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,386 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,397 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #47#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,405 INFO L263 TraceCheckUtils]: 3: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,405 INFO L280 TraceCheckUtils]: 5: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,405 INFO L280 TraceCheckUtils]: 7: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,412 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #45#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,413 INFO L263 TraceCheckUtils]: 9: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,414 INFO L263 TraceCheckUtils]: 13: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,414 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,414 INFO L280 TraceCheckUtils]: 15: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,415 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,415 INFO L263 TraceCheckUtils]: 19: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,416 INFO L280 TraceCheckUtils]: 22: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,416 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,416 INFO L280 TraceCheckUtils]: 24: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,416 INFO L280 TraceCheckUtils]: 25: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,418 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #47#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,419 INFO L280 TraceCheckUtils]: 27: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,419 INFO L280 TraceCheckUtils]: 28: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume true; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,421 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {7264#(<= 1 |fibo2_#in~n|)} {7231#(<= fibo1_~n 2)} #51#return; {7090#false} is VALID [2020-07-29 03:06:26,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,422 INFO L263 TraceCheckUtils]: 3: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,426 INFO L280 TraceCheckUtils]: 6: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {7263#(<= |fibo2_#in~n| 1)} assume true; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,427 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7263#(<= |fibo2_#in~n| 1)} {7089#true} #49#return; {7231#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:26,428 INFO L263 TraceCheckUtils]: 9: Hoare triple {7231#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,432 INFO L280 TraceCheckUtils]: 12: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,432 INFO L263 TraceCheckUtils]: 13: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,433 INFO L280 TraceCheckUtils]: 16: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,433 INFO L280 TraceCheckUtils]: 17: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,434 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #45#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,435 INFO L263 TraceCheckUtils]: 19: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,435 INFO L280 TraceCheckUtils]: 20: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,435 INFO L280 TraceCheckUtils]: 21: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,435 INFO L280 TraceCheckUtils]: 22: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,435 INFO L263 TraceCheckUtils]: 23: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,436 INFO L280 TraceCheckUtils]: 24: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,436 INFO L280 TraceCheckUtils]: 25: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,436 INFO L280 TraceCheckUtils]: 26: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,436 INFO L280 TraceCheckUtils]: 27: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,436 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,436 INFO L263 TraceCheckUtils]: 29: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,437 INFO L280 TraceCheckUtils]: 30: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,437 INFO L280 TraceCheckUtils]: 31: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,437 INFO L280 TraceCheckUtils]: 32: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,438 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,438 INFO L280 TraceCheckUtils]: 34: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,438 INFO L280 TraceCheckUtils]: 35: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,439 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #47#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,440 INFO L280 TraceCheckUtils]: 37: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,440 INFO L280 TraceCheckUtils]: 38: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume true; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,442 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {7264#(<= 1 |fibo2_#in~n|)} {7231#(<= fibo1_~n 2)} #51#return; {7090#false} is VALID [2020-07-29 03:06:26,442 INFO L280 TraceCheckUtils]: 40: Hoare triple {7090#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7090#false} is VALID [2020-07-29 03:06:26,442 INFO L280 TraceCheckUtils]: 41: Hoare triple {7090#false} assume true; {7090#false} is VALID [2020-07-29 03:06:26,442 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {7090#false} {7089#true} #45#return; {7090#false} is VALID [2020-07-29 03:06:26,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-07-29 03:06:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,460 INFO L280 TraceCheckUtils]: 3: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,460 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,466 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,466 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,466 INFO L263 TraceCheckUtils]: 3: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,467 INFO L280 TraceCheckUtils]: 4: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,467 INFO L280 TraceCheckUtils]: 5: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,467 INFO L280 TraceCheckUtils]: 6: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,467 INFO L280 TraceCheckUtils]: 7: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,467 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,468 INFO L263 TraceCheckUtils]: 9: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,468 INFO L280 TraceCheckUtils]: 10: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,469 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,469 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {7089#true} {7090#false} #47#return; {7090#false} is VALID [2020-07-29 03:06:26,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,470 INFO L263 TraceCheckUtils]: 3: Hoare triple {7089#true} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,471 INFO L263 TraceCheckUtils]: 7: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,475 INFO L280 TraceCheckUtils]: 10: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,476 INFO L280 TraceCheckUtils]: 11: Hoare triple {7263#(<= |fibo2_#in~n| 1)} assume true; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,477 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {7263#(<= |fibo2_#in~n| 1)} {7089#true} #49#return; {7231#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:26,478 INFO L263 TraceCheckUtils]: 13: Hoare triple {7231#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,479 INFO L280 TraceCheckUtils]: 15: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,480 INFO L280 TraceCheckUtils]: 16: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,480 INFO L263 TraceCheckUtils]: 17: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,480 INFO L280 TraceCheckUtils]: 18: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,480 INFO L280 TraceCheckUtils]: 19: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,482 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #45#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,482 INFO L263 TraceCheckUtils]: 23: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,483 INFO L280 TraceCheckUtils]: 24: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,483 INFO L280 TraceCheckUtils]: 25: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,483 INFO L280 TraceCheckUtils]: 26: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,483 INFO L263 TraceCheckUtils]: 27: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,484 INFO L280 TraceCheckUtils]: 28: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,484 INFO L280 TraceCheckUtils]: 29: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,484 INFO L280 TraceCheckUtils]: 30: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,484 INFO L280 TraceCheckUtils]: 31: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,484 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,485 INFO L263 TraceCheckUtils]: 33: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,485 INFO L280 TraceCheckUtils]: 34: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,485 INFO L280 TraceCheckUtils]: 35: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,485 INFO L280 TraceCheckUtils]: 36: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,485 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,485 INFO L280 TraceCheckUtils]: 38: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,486 INFO L280 TraceCheckUtils]: 39: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,487 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #47#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,488 INFO L280 TraceCheckUtils]: 41: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,489 INFO L280 TraceCheckUtils]: 42: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume true; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,490 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {7264#(<= 1 |fibo2_#in~n|)} {7231#(<= fibo1_~n 2)} #51#return; {7090#false} is VALID [2020-07-29 03:06:26,490 INFO L280 TraceCheckUtils]: 44: Hoare triple {7090#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7090#false} is VALID [2020-07-29 03:06:26,491 INFO L280 TraceCheckUtils]: 45: Hoare triple {7090#false} assume true; {7090#false} is VALID [2020-07-29 03:06:26,491 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {7090#false} {7089#true} #45#return; {7090#false} is VALID [2020-07-29 03:06:26,491 INFO L263 TraceCheckUtils]: 47: Hoare triple {7090#false} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,491 INFO L280 TraceCheckUtils]: 48: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,491 INFO L280 TraceCheckUtils]: 49: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,491 INFO L280 TraceCheckUtils]: 50: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,492 INFO L263 TraceCheckUtils]: 51: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,492 INFO L280 TraceCheckUtils]: 52: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,492 INFO L280 TraceCheckUtils]: 53: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,493 INFO L280 TraceCheckUtils]: 54: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,493 INFO L280 TraceCheckUtils]: 55: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,493 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,493 INFO L263 TraceCheckUtils]: 57: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,493 INFO L280 TraceCheckUtils]: 58: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,494 INFO L280 TraceCheckUtils]: 59: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,494 INFO L280 TraceCheckUtils]: 60: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,494 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,495 INFO L280 TraceCheckUtils]: 62: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,495 INFO L280 TraceCheckUtils]: 63: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,495 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {7089#true} {7090#false} #47#return; {7090#false} is VALID [2020-07-29 03:06:26,495 INFO L280 TraceCheckUtils]: 65: Hoare triple {7090#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7090#false} is VALID [2020-07-29 03:06:26,495 INFO L280 TraceCheckUtils]: 66: Hoare triple {7090#false} assume true; {7090#false} is VALID [2020-07-29 03:06:26,495 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {7090#false} {7097#(<= fibo1_~n 3)} #49#return; {7090#false} is VALID [2020-07-29 03:06:26,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {7091#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:26,501 INFO L263 TraceCheckUtils]: 1: Hoare triple {7091#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {7092#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:26,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {7092#(<= |fibo1_#in~n| 5)} ~n := #in~n; {7093#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:26,502 INFO L280 TraceCheckUtils]: 3: Hoare triple {7093#(<= fibo1_~n 5)} assume !(~n < 1); {7093#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:26,503 INFO L280 TraceCheckUtils]: 4: Hoare triple {7093#(<= fibo1_~n 5)} assume !(1 == ~n); {7093#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:26,504 INFO L263 TraceCheckUtils]: 5: Hoare triple {7093#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {7094#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:26,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {7094#(<= |fibo2_#in~n| 4)} ~n := #in~n; {7095#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:26,505 INFO L280 TraceCheckUtils]: 7: Hoare triple {7095#(<= fibo2_~n 4)} assume !(~n < 1); {7095#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:26,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {7095#(<= fibo2_~n 4)} assume !(1 == ~n); {7095#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:26,507 INFO L263 TraceCheckUtils]: 9: Hoare triple {7095#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {7096#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:26,508 INFO L280 TraceCheckUtils]: 10: Hoare triple {7096#(<= |fibo1_#in~n| 3)} ~n := #in~n; {7097#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:26,512 INFO L280 TraceCheckUtils]: 11: Hoare triple {7097#(<= fibo1_~n 3)} assume !(~n < 1); {7097#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:26,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {7097#(<= fibo1_~n 3)} assume !(1 == ~n); {7097#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:26,513 INFO L263 TraceCheckUtils]: 13: Hoare triple {7097#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,513 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,513 INFO L280 TraceCheckUtils]: 15: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,513 INFO L280 TraceCheckUtils]: 16: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,514 INFO L263 TraceCheckUtils]: 17: Hoare triple {7089#true} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,514 INFO L280 TraceCheckUtils]: 18: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,514 INFO L280 TraceCheckUtils]: 19: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,514 INFO L280 TraceCheckUtils]: 20: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,514 INFO L263 TraceCheckUtils]: 21: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,515 INFO L280 TraceCheckUtils]: 22: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,516 INFO L280 TraceCheckUtils]: 23: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,516 INFO L280 TraceCheckUtils]: 24: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,517 INFO L280 TraceCheckUtils]: 25: Hoare triple {7263#(<= |fibo2_#in~n| 1)} assume true; {7263#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:26,518 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {7263#(<= |fibo2_#in~n| 1)} {7089#true} #49#return; {7231#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:26,519 INFO L263 TraceCheckUtils]: 27: Hoare triple {7231#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,519 INFO L280 TraceCheckUtils]: 28: Hoare triple {7089#true} ~n := #in~n; {7262#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,520 INFO L280 TraceCheckUtils]: 29: Hoare triple {7262#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,521 INFO L280 TraceCheckUtils]: 30: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,521 INFO L263 TraceCheckUtils]: 31: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,521 INFO L280 TraceCheckUtils]: 32: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,521 INFO L280 TraceCheckUtils]: 33: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,521 INFO L280 TraceCheckUtils]: 34: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,521 INFO L280 TraceCheckUtils]: 35: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,523 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #45#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,523 INFO L263 TraceCheckUtils]: 37: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,523 INFO L280 TraceCheckUtils]: 38: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,523 INFO L280 TraceCheckUtils]: 39: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,523 INFO L280 TraceCheckUtils]: 40: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,524 INFO L263 TraceCheckUtils]: 41: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,524 INFO L280 TraceCheckUtils]: 42: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,524 INFO L280 TraceCheckUtils]: 43: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,524 INFO L280 TraceCheckUtils]: 44: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,524 INFO L280 TraceCheckUtils]: 45: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,525 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,525 INFO L263 TraceCheckUtils]: 47: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,525 INFO L280 TraceCheckUtils]: 48: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,525 INFO L280 TraceCheckUtils]: 49: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,526 INFO L280 TraceCheckUtils]: 50: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,526 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,526 INFO L280 TraceCheckUtils]: 52: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,526 INFO L280 TraceCheckUtils]: 53: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,528 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {7089#true} {7264#(<= 1 |fibo2_#in~n|)} #47#return; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,528 INFO L280 TraceCheckUtils]: 55: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,529 INFO L280 TraceCheckUtils]: 56: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume true; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:26,530 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {7264#(<= 1 |fibo2_#in~n|)} {7231#(<= fibo1_~n 2)} #51#return; {7090#false} is VALID [2020-07-29 03:06:26,530 INFO L280 TraceCheckUtils]: 58: Hoare triple {7090#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7090#false} is VALID [2020-07-29 03:06:26,531 INFO L280 TraceCheckUtils]: 59: Hoare triple {7090#false} assume true; {7090#false} is VALID [2020-07-29 03:06:26,531 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {7090#false} {7089#true} #45#return; {7090#false} is VALID [2020-07-29 03:06:26,531 INFO L263 TraceCheckUtils]: 61: Hoare triple {7090#false} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,531 INFO L280 TraceCheckUtils]: 62: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,532 INFO L280 TraceCheckUtils]: 63: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,532 INFO L280 TraceCheckUtils]: 64: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:26,532 INFO L263 TraceCheckUtils]: 65: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:26,532 INFO L280 TraceCheckUtils]: 66: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,532 INFO L280 TraceCheckUtils]: 67: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:26,533 INFO L280 TraceCheckUtils]: 68: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:26,533 INFO L280 TraceCheckUtils]: 69: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,533 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:26,533 INFO L263 TraceCheckUtils]: 71: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:26,533 INFO L280 TraceCheckUtils]: 72: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:26,533 INFO L280 TraceCheckUtils]: 73: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:26,534 INFO L280 TraceCheckUtils]: 74: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,534 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:26,534 INFO L280 TraceCheckUtils]: 76: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:26,535 INFO L280 TraceCheckUtils]: 77: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:26,535 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {7089#true} {7090#false} #47#return; {7090#false} is VALID [2020-07-29 03:06:26,535 INFO L280 TraceCheckUtils]: 79: Hoare triple {7090#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7090#false} is VALID [2020-07-29 03:06:26,535 INFO L280 TraceCheckUtils]: 80: Hoare triple {7090#false} assume true; {7090#false} is VALID [2020-07-29 03:06:26,535 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {7090#false} {7097#(<= fibo1_~n 3)} #49#return; {7090#false} is VALID [2020-07-29 03:06:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 32 proven. 83 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-07-29 03:06:26,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177388560] [2020-07-29 03:06:26,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375583538] [2020-07-29 03:06:26,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:26,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:06:26,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:06:26,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:06:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:26,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:27,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {7089#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {7091#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:27,072 INFO L263 TraceCheckUtils]: 1: Hoare triple {7091#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {7092#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:27,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {7092#(<= |fibo1_#in~n| 5)} ~n := #in~n; {7093#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:27,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {7093#(<= fibo1_~n 5)} assume !(~n < 1); {7093#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:27,073 INFO L280 TraceCheckUtils]: 4: Hoare triple {7093#(<= fibo1_~n 5)} assume !(1 == ~n); {7093#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:27,074 INFO L263 TraceCheckUtils]: 5: Hoare triple {7093#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {7094#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:27,075 INFO L280 TraceCheckUtils]: 6: Hoare triple {7094#(<= |fibo2_#in~n| 4)} ~n := #in~n; {7095#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:27,075 INFO L280 TraceCheckUtils]: 7: Hoare triple {7095#(<= fibo2_~n 4)} assume !(~n < 1); {7095#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:27,076 INFO L280 TraceCheckUtils]: 8: Hoare triple {7095#(<= fibo2_~n 4)} assume !(1 == ~n); {7095#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:27,076 INFO L263 TraceCheckUtils]: 9: Hoare triple {7095#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {7096#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:27,077 INFO L280 TraceCheckUtils]: 10: Hoare triple {7096#(<= |fibo1_#in~n| 3)} ~n := #in~n; {7097#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:27,077 INFO L280 TraceCheckUtils]: 11: Hoare triple {7097#(<= fibo1_~n 3)} assume !(~n < 1); {7097#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:27,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {7097#(<= fibo1_~n 3)} assume !(1 == ~n); {7097#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:27,078 INFO L263 TraceCheckUtils]: 13: Hoare triple {7097#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:27,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {7089#true} ~n := #in~n; {7350#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,079 INFO L280 TraceCheckUtils]: 15: Hoare triple {7350#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7350#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,079 INFO L280 TraceCheckUtils]: 16: Hoare triple {7350#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {7350#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,079 INFO L263 TraceCheckUtils]: 17: Hoare triple {7350#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:27,080 INFO L280 TraceCheckUtils]: 18: Hoare triple {7089#true} ~n := #in~n; {7363#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {7363#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7363#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,080 INFO L280 TraceCheckUtils]: 20: Hoare triple {7363#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7363#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,081 INFO L263 TraceCheckUtils]: 21: Hoare triple {7363#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:27,081 INFO L280 TraceCheckUtils]: 22: Hoare triple {7089#true} ~n := #in~n; {7350#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,082 INFO L280 TraceCheckUtils]: 23: Hoare triple {7350#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,082 INFO L280 TraceCheckUtils]: 24: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,082 INFO L280 TraceCheckUtils]: 25: Hoare triple {7264#(<= 1 |fibo2_#in~n|)} assume true; {7264#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,084 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {7264#(<= 1 |fibo2_#in~n|)} {7363#(<= fibo1_~n |fibo1_#in~n|)} #49#return; {7388#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,084 INFO L263 TraceCheckUtils]: 27: Hoare triple {7388#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:27,084 INFO L280 TraceCheckUtils]: 28: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,085 INFO L280 TraceCheckUtils]: 29: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:27,085 INFO L280 TraceCheckUtils]: 30: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:27,085 INFO L263 TraceCheckUtils]: 31: Hoare triple {7089#true} call #t~ret2 := fibo1(~n - 1); {7089#true} is VALID [2020-07-29 03:06:27,085 INFO L280 TraceCheckUtils]: 32: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,085 INFO L280 TraceCheckUtils]: 33: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:27,086 INFO L280 TraceCheckUtils]: 34: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:27,086 INFO L280 TraceCheckUtils]: 35: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,086 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {7089#true} {7089#true} #45#return; {7089#true} is VALID [2020-07-29 03:06:27,086 INFO L263 TraceCheckUtils]: 37: Hoare triple {7089#true} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:27,087 INFO L280 TraceCheckUtils]: 38: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,087 INFO L280 TraceCheckUtils]: 39: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:27,087 INFO L280 TraceCheckUtils]: 40: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:27,087 INFO L263 TraceCheckUtils]: 41: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L280 TraceCheckUtils]: 42: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L280 TraceCheckUtils]: 43: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L280 TraceCheckUtils]: 44: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L280 TraceCheckUtils]: 45: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L263 TraceCheckUtils]: 47: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:27,088 INFO L280 TraceCheckUtils]: 48: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L280 TraceCheckUtils]: 49: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L280 TraceCheckUtils]: 50: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L280 TraceCheckUtils]: 52: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L280 TraceCheckUtils]: 53: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {7089#true} {7089#true} #47#return; {7089#true} is VALID [2020-07-29 03:06:27,089 INFO L280 TraceCheckUtils]: 55: Hoare triple {7089#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7089#true} is VALID [2020-07-29 03:06:27,090 INFO L280 TraceCheckUtils]: 56: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,090 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {7089#true} {7388#(<= 2 |fibo1_#in~n|)} #51#return; {7388#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,091 INFO L280 TraceCheckUtils]: 58: Hoare triple {7388#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7388#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,091 INFO L280 TraceCheckUtils]: 59: Hoare triple {7388#(<= 2 |fibo1_#in~n|)} assume true; {7388#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,092 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {7388#(<= 2 |fibo1_#in~n|)} {7350#(<= fibo2_~n |fibo2_#in~n|)} #45#return; {7491#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,092 INFO L263 TraceCheckUtils]: 61: Hoare triple {7491#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {7089#true} is VALID [2020-07-29 03:06:27,092 INFO L280 TraceCheckUtils]: 62: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,093 INFO L280 TraceCheckUtils]: 63: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:27,093 INFO L280 TraceCheckUtils]: 64: Hoare triple {7089#true} assume !(1 == ~n); {7089#true} is VALID [2020-07-29 03:06:27,093 INFO L263 TraceCheckUtils]: 65: Hoare triple {7089#true} call #t~ret0 := fibo2(~n - 1); {7089#true} is VALID [2020-07-29 03:06:27,093 INFO L280 TraceCheckUtils]: 66: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,094 INFO L280 TraceCheckUtils]: 67: Hoare triple {7089#true} assume !(~n < 1); {7089#true} is VALID [2020-07-29 03:06:27,094 INFO L280 TraceCheckUtils]: 68: Hoare triple {7089#true} assume 1 == ~n;#res := 1; {7089#true} is VALID [2020-07-29 03:06:27,094 INFO L280 TraceCheckUtils]: 69: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,095 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {7089#true} {7089#true} #49#return; {7089#true} is VALID [2020-07-29 03:06:27,095 INFO L263 TraceCheckUtils]: 71: Hoare triple {7089#true} call #t~ret1 := fibo2(~n - 2); {7089#true} is VALID [2020-07-29 03:06:27,095 INFO L280 TraceCheckUtils]: 72: Hoare triple {7089#true} ~n := #in~n; {7089#true} is VALID [2020-07-29 03:06:27,096 INFO L280 TraceCheckUtils]: 73: Hoare triple {7089#true} assume ~n < 1;#res := 0; {7089#true} is VALID [2020-07-29 03:06:27,096 INFO L280 TraceCheckUtils]: 74: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,096 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {7089#true} {7089#true} #51#return; {7089#true} is VALID [2020-07-29 03:06:27,096 INFO L280 TraceCheckUtils]: 76: Hoare triple {7089#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7089#true} is VALID [2020-07-29 03:06:27,096 INFO L280 TraceCheckUtils]: 77: Hoare triple {7089#true} assume true; {7089#true} is VALID [2020-07-29 03:06:27,100 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {7089#true} {7491#(<= 3 |fibo2_#in~n|)} #47#return; {7491#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,101 INFO L280 TraceCheckUtils]: 79: Hoare triple {7491#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7491#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,101 INFO L280 TraceCheckUtils]: 80: Hoare triple {7491#(<= 3 |fibo2_#in~n|)} assume true; {7491#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,102 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {7491#(<= 3 |fibo2_#in~n|)} {7097#(<= fibo1_~n 3)} #49#return; {7090#false} is VALID [2020-07-29 03:06:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 92 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-07-29 03:06:27,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:27,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2020-07-29 03:06:27,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982091948] [2020-07-29 03:06:27,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash 532984890, now seen corresponding path program 1 times [2020-07-29 03:06:27,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:27,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895561291] [2020-07-29 03:06:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,211 INFO L280 TraceCheckUtils]: 3: Hoare triple {7643#(<= |fibo2_#in~n| 1)} assume true; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,213 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7643#(<= |fibo2_#in~n| 1)} {7631#(= fibo1_~n |fibo1_#in~n|)} #49#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,220 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7552#true} {7637#(<= |fibo1_#in~n| 2)} #51#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,222 INFO L263 TraceCheckUtils]: 3: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,223 INFO L280 TraceCheckUtils]: 4: Hoare triple {7552#true} ~n := #in~n; {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {7643#(<= |fibo2_#in~n| 1)} assume true; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,226 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7643#(<= |fibo2_#in~n| 1)} {7631#(= fibo1_~n |fibo1_#in~n|)} #49#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,226 INFO L263 TraceCheckUtils]: 9: Hoare triple {7637#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,226 INFO L280 TraceCheckUtils]: 10: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,226 INFO L280 TraceCheckUtils]: 11: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,226 INFO L280 TraceCheckUtils]: 12: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,227 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {7552#true} {7637#(<= |fibo1_#in~n| 2)} #51#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,228 INFO L280 TraceCheckUtils]: 14: Hoare triple {7637#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,228 INFO L280 TraceCheckUtils]: 15: Hoare triple {7637#(<= |fibo1_#in~n| 2)} assume true; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,229 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {7637#(<= |fibo1_#in~n| 2)} {7552#true} #45#return; {7613#(<= fibo2_~n 3)} is VALID [2020-07-29 03:06:27,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:06:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {7552#true} assume 1 == ~n;#res := 1; {7552#true} is VALID [2020-07-29 03:06:27,298 INFO L280 TraceCheckUtils]: 3: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,299 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #49#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,305 INFO L280 TraceCheckUtils]: 2: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #51#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7644#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:27,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {7644#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,312 INFO L263 TraceCheckUtils]: 3: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {7552#true} assume 1 == ~n;#res := 1; {7552#true} is VALID [2020-07-29 03:06:27,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,314 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #49#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,314 INFO L263 TraceCheckUtils]: 9: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,314 INFO L280 TraceCheckUtils]: 11: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,316 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #51#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} assume true; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,319 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {7645#(<= 2 |fibo1_#in~n|)} {7613#(<= fibo2_~n 3)} #47#return; {7553#false} is VALID [2020-07-29 03:06:27,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,320 INFO L263 TraceCheckUtils]: 3: Hoare triple {7552#true} call #t~ret2 := fibo1(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {7552#true} ~n := #in~n; {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,323 INFO L263 TraceCheckUtils]: 7: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {7552#true} ~n := #in~n; {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,325 INFO L280 TraceCheckUtils]: 10: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {7643#(<= |fibo2_#in~n| 1)} assume true; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,327 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {7643#(<= |fibo2_#in~n| 1)} {7631#(= fibo1_~n |fibo1_#in~n|)} #49#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,328 INFO L263 TraceCheckUtils]: 13: Hoare triple {7637#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,328 INFO L280 TraceCheckUtils]: 16: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,329 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {7552#true} {7637#(<= |fibo1_#in~n| 2)} #51#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,330 INFO L280 TraceCheckUtils]: 18: Hoare triple {7637#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {7637#(<= |fibo1_#in~n| 2)} assume true; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,333 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {7637#(<= |fibo1_#in~n| 2)} {7552#true} #45#return; {7613#(<= fibo2_~n 3)} is VALID [2020-07-29 03:06:27,333 INFO L263 TraceCheckUtils]: 21: Hoare triple {7613#(<= fibo2_~n 3)} call #t~ret3 := fibo1(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,334 INFO L280 TraceCheckUtils]: 22: Hoare triple {7552#true} ~n := #in~n; {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,334 INFO L280 TraceCheckUtils]: 23: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7644#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:27,335 INFO L280 TraceCheckUtils]: 24: Hoare triple {7644#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,336 INFO L263 TraceCheckUtils]: 25: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,336 INFO L280 TraceCheckUtils]: 26: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,336 INFO L280 TraceCheckUtils]: 27: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,336 INFO L280 TraceCheckUtils]: 28: Hoare triple {7552#true} assume 1 == ~n;#res := 1; {7552#true} is VALID [2020-07-29 03:06:27,336 INFO L280 TraceCheckUtils]: 29: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,338 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #49#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,338 INFO L263 TraceCheckUtils]: 31: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,338 INFO L280 TraceCheckUtils]: 32: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,338 INFO L280 TraceCheckUtils]: 33: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,339 INFO L280 TraceCheckUtils]: 34: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,340 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #51#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,341 INFO L280 TraceCheckUtils]: 36: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,345 INFO L280 TraceCheckUtils]: 37: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} assume true; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,346 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {7645#(<= 2 |fibo1_#in~n|)} {7613#(<= fibo2_~n 3)} #47#return; {7553#false} is VALID [2020-07-29 03:06:27,346 INFO L280 TraceCheckUtils]: 39: Hoare triple {7553#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7553#false} is VALID [2020-07-29 03:06:27,347 INFO L280 TraceCheckUtils]: 40: Hoare triple {7553#false} assume true; {7553#false} is VALID [2020-07-29 03:06:27,347 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {7553#false} {7552#true} #49#return; {7553#false} is VALID [2020-07-29 03:06:27,349 INFO L263 TraceCheckUtils]: 0: Hoare triple {7552#true} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,350 INFO L263 TraceCheckUtils]: 4: Hoare triple {7552#true} call #t~ret2 := fibo1(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,350 INFO L280 TraceCheckUtils]: 5: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,350 INFO L263 TraceCheckUtils]: 8: Hoare triple {7552#true} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,351 INFO L263 TraceCheckUtils]: 12: Hoare triple {7552#true} call #t~ret2 := fibo1(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {7552#true} ~n := #in~n; {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,354 INFO L280 TraceCheckUtils]: 15: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,354 INFO L263 TraceCheckUtils]: 16: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,355 INFO L280 TraceCheckUtils]: 17: Hoare triple {7552#true} ~n := #in~n; {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,356 INFO L280 TraceCheckUtils]: 18: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7642#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,357 INFO L280 TraceCheckUtils]: 19: Hoare triple {7642#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,357 INFO L280 TraceCheckUtils]: 20: Hoare triple {7643#(<= |fibo2_#in~n| 1)} assume true; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,359 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {7643#(<= |fibo2_#in~n| 1)} {7631#(= fibo1_~n |fibo1_#in~n|)} #49#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,359 INFO L263 TraceCheckUtils]: 22: Hoare triple {7637#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,359 INFO L280 TraceCheckUtils]: 23: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,360 INFO L280 TraceCheckUtils]: 24: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,360 INFO L280 TraceCheckUtils]: 25: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,361 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {7552#true} {7637#(<= |fibo1_#in~n| 2)} #51#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,362 INFO L280 TraceCheckUtils]: 27: Hoare triple {7637#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,363 INFO L280 TraceCheckUtils]: 28: Hoare triple {7637#(<= |fibo1_#in~n| 2)} assume true; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,364 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {7637#(<= |fibo1_#in~n| 2)} {7552#true} #45#return; {7613#(<= fibo2_~n 3)} is VALID [2020-07-29 03:06:27,364 INFO L263 TraceCheckUtils]: 30: Hoare triple {7613#(<= fibo2_~n 3)} call #t~ret3 := fibo1(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,365 INFO L280 TraceCheckUtils]: 31: Hoare triple {7552#true} ~n := #in~n; {7631#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,366 INFO L280 TraceCheckUtils]: 32: Hoare triple {7631#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7644#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:27,367 INFO L280 TraceCheckUtils]: 33: Hoare triple {7644#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,367 INFO L263 TraceCheckUtils]: 34: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,367 INFO L280 TraceCheckUtils]: 35: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,367 INFO L280 TraceCheckUtils]: 36: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,367 INFO L280 TraceCheckUtils]: 37: Hoare triple {7552#true} assume 1 == ~n;#res := 1; {7552#true} is VALID [2020-07-29 03:06:27,368 INFO L280 TraceCheckUtils]: 38: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,369 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #49#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,369 INFO L263 TraceCheckUtils]: 40: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,369 INFO L280 TraceCheckUtils]: 41: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,369 INFO L280 TraceCheckUtils]: 42: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,370 INFO L280 TraceCheckUtils]: 43: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,372 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #51#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,373 INFO L280 TraceCheckUtils]: 45: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,373 INFO L280 TraceCheckUtils]: 46: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} assume true; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,375 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {7645#(<= 2 |fibo1_#in~n|)} {7613#(<= fibo2_~n 3)} #47#return; {7553#false} is VALID [2020-07-29 03:06:27,375 INFO L280 TraceCheckUtils]: 48: Hoare triple {7553#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7553#false} is VALID [2020-07-29 03:06:27,375 INFO L280 TraceCheckUtils]: 49: Hoare triple {7553#false} assume true; {7553#false} is VALID [2020-07-29 03:06:27,376 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {7553#false} {7552#true} #49#return; {7553#false} is VALID [2020-07-29 03:06:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-07-29 03:06:27,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895561291] [2020-07-29 03:06:27,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085205907] [2020-07-29 03:06:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:06:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:27,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:27,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {7552#true} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,767 INFO L263 TraceCheckUtils]: 4: Hoare triple {7552#true} call #t~ret2 := fibo1(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,768 INFO L263 TraceCheckUtils]: 8: Hoare triple {7552#true} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {7552#true} assume !(~n < 1); {7552#true} is VALID [2020-07-29 03:06:27,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {7552#true} assume !(1 == ~n); {7552#true} is VALID [2020-07-29 03:06:27,770 INFO L263 TraceCheckUtils]: 12: Hoare triple {7552#true} call #t~ret2 := fibo1(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,772 INFO L280 TraceCheckUtils]: 13: Hoare triple {7552#true} ~n := #in~n; {7697#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-29 03:06:27,772 INFO L280 TraceCheckUtils]: 14: Hoare triple {7697#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {7697#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-29 03:06:27,774 INFO L280 TraceCheckUtils]: 15: Hoare triple {7697#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {7697#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-29 03:06:27,774 INFO L263 TraceCheckUtils]: 16: Hoare triple {7697#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,774 INFO L280 TraceCheckUtils]: 17: Hoare triple {7552#true} ~n := #in~n; {7710#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-29 03:06:27,775 INFO L280 TraceCheckUtils]: 18: Hoare triple {7710#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {7710#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-29 03:06:27,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {7710#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {7643#(<= |fibo2_#in~n| 1)} assume true; {7643#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:27,777 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {7643#(<= |fibo2_#in~n| 1)} {7697#(<= |fibo1_#in~n| fibo1_~n)} #49#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,777 INFO L263 TraceCheckUtils]: 22: Hoare triple {7637#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,778 INFO L280 TraceCheckUtils]: 23: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,778 INFO L280 TraceCheckUtils]: 24: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,778 INFO L280 TraceCheckUtils]: 25: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,779 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {7552#true} {7637#(<= |fibo1_#in~n| 2)} #51#return; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,779 INFO L280 TraceCheckUtils]: 27: Hoare triple {7637#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,779 INFO L280 TraceCheckUtils]: 28: Hoare triple {7637#(<= |fibo1_#in~n| 2)} assume true; {7637#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:27,780 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {7637#(<= |fibo1_#in~n| 2)} {7552#true} #45#return; {7613#(<= fibo2_~n 3)} is VALID [2020-07-29 03:06:27,780 INFO L263 TraceCheckUtils]: 30: Hoare triple {7613#(<= fibo2_~n 3)} call #t~ret3 := fibo1(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,781 INFO L280 TraceCheckUtils]: 31: Hoare triple {7552#true} ~n := #in~n; {7753#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,781 INFO L280 TraceCheckUtils]: 32: Hoare triple {7753#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {7753#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,782 INFO L280 TraceCheckUtils]: 33: Hoare triple {7753#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {7753#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,782 INFO L263 TraceCheckUtils]: 34: Hoare triple {7753#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {7552#true} is VALID [2020-07-29 03:06:27,783 INFO L280 TraceCheckUtils]: 35: Hoare triple {7552#true} ~n := #in~n; {7766#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,784 INFO L280 TraceCheckUtils]: 36: Hoare triple {7766#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {7770#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,784 INFO L280 TraceCheckUtils]: 37: Hoare triple {7770#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {7770#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,785 INFO L280 TraceCheckUtils]: 38: Hoare triple {7770#(<= 1 |fibo2_#in~n|)} assume true; {7770#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:27,786 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {7770#(<= 1 |fibo2_#in~n|)} {7753#(<= fibo1_~n |fibo1_#in~n|)} #49#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,786 INFO L263 TraceCheckUtils]: 40: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {7552#true} is VALID [2020-07-29 03:06:27,786 INFO L280 TraceCheckUtils]: 41: Hoare triple {7552#true} ~n := #in~n; {7552#true} is VALID [2020-07-29 03:06:27,786 INFO L280 TraceCheckUtils]: 42: Hoare triple {7552#true} assume ~n < 1;#res := 0; {7552#true} is VALID [2020-07-29 03:06:27,786 INFO L280 TraceCheckUtils]: 43: Hoare triple {7552#true} assume true; {7552#true} is VALID [2020-07-29 03:06:27,787 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {7552#true} {7645#(<= 2 |fibo1_#in~n|)} #51#return; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,787 INFO L280 TraceCheckUtils]: 45: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,788 INFO L280 TraceCheckUtils]: 46: Hoare triple {7645#(<= 2 |fibo1_#in~n|)} assume true; {7645#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:27,789 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {7645#(<= 2 |fibo1_#in~n|)} {7613#(<= fibo2_~n 3)} #47#return; {7553#false} is VALID [2020-07-29 03:06:27,789 INFO L280 TraceCheckUtils]: 48: Hoare triple {7553#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {7553#false} is VALID [2020-07-29 03:06:27,789 INFO L280 TraceCheckUtils]: 49: Hoare triple {7553#false} assume true; {7553#false} is VALID [2020-07-29 03:06:27,789 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {7553#false} {7552#true} #49#return; {7553#false} is VALID [2020-07-29 03:06:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-29 03:06:27,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:27,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2020-07-29 03:06:27,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190814646] [2020-07-29 03:06:27,792 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:06:27,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:06:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:06:27,792 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. cyclomatic complexity: 53 Second operand 14 states. [2020-07-29 03:06:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:28,994 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2020-07-29 03:06:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-29 03:06:28,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:06:29,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:29,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 141 transitions. [2020-07-29 03:06:29,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 03:06:29,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 91 states and 113 transitions. [2020-07-29 03:06:29,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-07-29 03:06:29,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-07-29 03:06:29,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 113 transitions. [2020-07-29 03:06:29,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:29,088 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2020-07-29 03:06:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 113 transitions. [2020-07-29 03:06:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2020-07-29 03:06:29,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:29,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 113 transitions. Second operand 87 states. [2020-07-29 03:06:29,091 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 113 transitions. Second operand 87 states. [2020-07-29 03:06:29,092 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand 87 states. [2020-07-29 03:06:29,092 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:29,106 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2020-07-29 03:06:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2020-07-29 03:06:29,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:29,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:29,108 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 91 states and 113 transitions. [2020-07-29 03:06:29,108 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 91 states and 113 transitions. [2020-07-29 03:06:29,109 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:29,118 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2020-07-29 03:06:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2020-07-29 03:06:29,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:29,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:29,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:29,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-29 03:06:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2020-07-29 03:06:29,123 INFO L711 BuchiCegarLoop]: Abstraction has 87 states and 109 transitions. [2020-07-29 03:06:29,123 INFO L591 BuchiCegarLoop]: Abstraction has 87 states and 109 transitions. [2020-07-29 03:06:29,123 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:06:29,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 109 transitions. [2020-07-29 03:06:29,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 03:06:29,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:29,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:29,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:29,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:29,126 INFO L794 eck$LassoCheckResult]: Stem: 7977#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 7958#L37 call main_#t~ret4 := fibo1(main_~x~0);< 7959#fibo1ENTRY ~n := #in~n; 7988#L8 assume !(~n < 1); 7965#L10 assume !(1 == ~n); 7954#L13 call #t~ret0 := fibo2(~n - 1);< 7973#fibo2ENTRY ~n := #in~n; 7985#L18 assume !(~n < 1); 7991#L20 assume !(1 == ~n); 7953#L23 call #t~ret2 := fibo1(~n - 1);< 7955#fibo1ENTRY ~n := #in~n; 7980#L8 assume !(~n < 1); 8012#L10 assume !(1 == ~n); 8009#L13 call #t~ret0 := fibo2(~n - 1);< 8011#fibo2ENTRY ~n := #in~n; 8021#L18 assume !(~n < 1); 8020#L20 assume !(1 == ~n); 7969#L23 call #t~ret2 := fibo1(~n - 1);< 7955#fibo1ENTRY ~n := #in~n; 7981#L8 assume !(~n < 1); 7999#L10 assume 1 == ~n;#res := 1; 7975#fibo1FINAL assume true; 7968#fibo1EXIT >#45#return; 7963#L23-1 call #t~ret3 := fibo1(~n - 2);< 7978#fibo1ENTRY ~n := #in~n; 7979#L8 assume ~n < 1;#res := 0; 7964#fibo1FINAL assume true; 8016#fibo1EXIT >#47#return; 8015#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8013#fibo2FINAL assume true; 8008#fibo2EXIT >#49#return; 7950#L13-1 [2020-07-29 03:06:29,126 INFO L796 eck$LassoCheckResult]: Loop: 7950#L13-1 call #t~ret1 := fibo2(~n - 2);< 7974#fibo2ENTRY ~n := #in~n; 8031#L18 assume !(~n < 1); 7993#L20 assume !(1 == ~n); 7948#L23 call #t~ret2 := fibo1(~n - 1);< 7952#fibo1ENTRY ~n := #in~n; 8000#L8 assume !(~n < 1); 7997#L10 assume !(1 == ~n); 7949#L13 call #t~ret0 := fibo2(~n - 1);< 7972#fibo2ENTRY ~n := #in~n; 7994#L18 assume !(~n < 1); 7993#L20 assume !(1 == ~n); 7948#L23 call #t~ret2 := fibo1(~n - 1);< 7952#fibo1ENTRY ~n := #in~n; 8000#L8 assume !(~n < 1); 7997#L10 assume 1 == ~n;#res := 1; 7998#fibo1FINAL assume true; 8025#fibo1EXIT >#45#return; 7956#L23-1 call #t~ret3 := fibo1(~n - 2);< 7957#fibo1ENTRY ~n := #in~n; 8023#L8 assume ~n < 1;#res := 0; 8001#fibo1FINAL assume true; 8017#fibo1EXIT >#47#return; 8018#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 8022#fibo2FINAL assume true; 8007#fibo2EXIT >#49#return; 7950#L13-1 [2020-07-29 03:06:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash -440961883, now seen corresponding path program 1 times [2020-07-29 03:06:29,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:29,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336056022] [2020-07-29 03:06:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:29,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:29,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:29,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1737996717, now seen corresponding path program 1 times [2020-07-29 03:06:29,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:29,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903135856] [2020-07-29 03:06:29,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:29,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:29,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:29,151 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2048190801, now seen corresponding path program 1 times [2020-07-29 03:06:29,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:29,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073492423] [2020-07-29 03:06:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-07-29 03:06:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,320 INFO L280 TraceCheckUtils]: 3: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,321 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,326 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {8772#true} assume !(1 == ~n); {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L263 TraceCheckUtils]: 3: Hoare triple {8772#true} call #t~ret2 := fibo1(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L280 TraceCheckUtils]: 4: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L280 TraceCheckUtils]: 5: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,328 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,328 INFO L263 TraceCheckUtils]: 9: Hoare triple {8772#true} call #t~ret3 := fibo1(~n - 2); {8772#true} is VALID [2020-07-29 03:06:29,328 INFO L280 TraceCheckUtils]: 10: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,328 INFO L280 TraceCheckUtils]: 11: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,329 INFO L280 TraceCheckUtils]: 12: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,329 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,329 INFO L280 TraceCheckUtils]: 14: Hoare triple {8772#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {8772#true} is VALID [2020-07-29 03:06:29,329 INFO L280 TraceCheckUtils]: 15: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,332 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {8772#true} {8780#(<= fibo1_~n 3)} #49#return; {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-07-29 03:06:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,349 INFO L280 TraceCheckUtils]: 3: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,349 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,362 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {8772#true} assume !(1 == ~n); {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L263 TraceCheckUtils]: 3: Hoare triple {8772#true} call #t~ret2 := fibo1(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L280 TraceCheckUtils]: 6: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L280 TraceCheckUtils]: 7: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,363 INFO L263 TraceCheckUtils]: 9: Hoare triple {8772#true} call #t~ret3 := fibo1(~n - 2); {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {8772#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L280 TraceCheckUtils]: 15: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,364 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {8772#true} {8773#false} #49#return; {8773#false} is VALID [2020-07-29 03:06:29,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {8774#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:29,366 INFO L263 TraceCheckUtils]: 1: Hoare triple {8774#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {8775#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:29,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {8775#(<= |fibo1_#in~n| 5)} ~n := #in~n; {8776#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:29,367 INFO L280 TraceCheckUtils]: 3: Hoare triple {8776#(<= fibo1_~n 5)} assume !(~n < 1); {8776#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:29,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {8776#(<= fibo1_~n 5)} assume !(1 == ~n); {8776#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:29,369 INFO L263 TraceCheckUtils]: 5: Hoare triple {8776#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {8777#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:29,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {8777#(<= |fibo2_#in~n| 4)} ~n := #in~n; {8778#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:29,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {8778#(<= fibo2_~n 4)} assume !(~n < 1); {8778#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:29,370 INFO L280 TraceCheckUtils]: 8: Hoare triple {8778#(<= fibo2_~n 4)} assume !(1 == ~n); {8778#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:29,371 INFO L263 TraceCheckUtils]: 9: Hoare triple {8778#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {8779#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:29,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {8779#(<= |fibo1_#in~n| 3)} ~n := #in~n; {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,373 INFO L280 TraceCheckUtils]: 11: Hoare triple {8780#(<= fibo1_~n 3)} assume !(~n < 1); {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,373 INFO L280 TraceCheckUtils]: 12: Hoare triple {8780#(<= fibo1_~n 3)} assume !(1 == ~n); {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,373 INFO L263 TraceCheckUtils]: 13: Hoare triple {8780#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,374 INFO L280 TraceCheckUtils]: 16: Hoare triple {8772#true} assume !(1 == ~n); {8772#true} is VALID [2020-07-29 03:06:29,374 INFO L263 TraceCheckUtils]: 17: Hoare triple {8772#true} call #t~ret2 := fibo1(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,374 INFO L280 TraceCheckUtils]: 18: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,374 INFO L280 TraceCheckUtils]: 19: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,375 INFO L280 TraceCheckUtils]: 21: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,375 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,375 INFO L263 TraceCheckUtils]: 23: Hoare triple {8772#true} call #t~ret3 := fibo1(~n - 2); {8772#true} is VALID [2020-07-29 03:06:29,375 INFO L280 TraceCheckUtils]: 24: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,375 INFO L280 TraceCheckUtils]: 25: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,376 INFO L280 TraceCheckUtils]: 26: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,376 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,376 INFO L280 TraceCheckUtils]: 28: Hoare triple {8772#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {8772#true} is VALID [2020-07-29 03:06:29,376 INFO L280 TraceCheckUtils]: 29: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,377 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {8772#true} {8780#(<= fibo1_~n 3)} #49#return; {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,378 INFO L263 TraceCheckUtils]: 31: Hoare triple {8780#(<= fibo1_~n 3)} call #t~ret1 := fibo2(~n - 2); {8798#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:29,379 INFO L280 TraceCheckUtils]: 32: Hoare triple {8798#(<= |fibo2_#in~n| 1)} ~n := #in~n; {8799#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:29,380 INFO L280 TraceCheckUtils]: 33: Hoare triple {8799#(<= fibo2_~n 1)} assume !(~n < 1); {8800#(and (< 0 fibo2_~n) (<= fibo2_~n 1))} is VALID [2020-07-29 03:06:29,381 INFO L280 TraceCheckUtils]: 34: Hoare triple {8800#(and (< 0 fibo2_~n) (<= fibo2_~n 1))} assume !(1 == ~n); {8773#false} is VALID [2020-07-29 03:06:29,381 INFO L263 TraceCheckUtils]: 35: Hoare triple {8773#false} call #t~ret2 := fibo1(~n - 1); {8773#false} is VALID [2020-07-29 03:06:29,381 INFO L280 TraceCheckUtils]: 36: Hoare triple {8773#false} ~n := #in~n; {8773#false} is VALID [2020-07-29 03:06:29,381 INFO L280 TraceCheckUtils]: 37: Hoare triple {8773#false} assume !(~n < 1); {8773#false} is VALID [2020-07-29 03:06:29,382 INFO L280 TraceCheckUtils]: 38: Hoare triple {8773#false} assume !(1 == ~n); {8773#false} is VALID [2020-07-29 03:06:29,382 INFO L263 TraceCheckUtils]: 39: Hoare triple {8773#false} call #t~ret0 := fibo2(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,382 INFO L280 TraceCheckUtils]: 40: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,382 INFO L280 TraceCheckUtils]: 41: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,382 INFO L280 TraceCheckUtils]: 42: Hoare triple {8772#true} assume !(1 == ~n); {8772#true} is VALID [2020-07-29 03:06:29,383 INFO L263 TraceCheckUtils]: 43: Hoare triple {8772#true} call #t~ret2 := fibo1(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,383 INFO L280 TraceCheckUtils]: 44: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,383 INFO L280 TraceCheckUtils]: 45: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,383 INFO L280 TraceCheckUtils]: 46: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,383 INFO L280 TraceCheckUtils]: 47: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,384 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,384 INFO L263 TraceCheckUtils]: 49: Hoare triple {8772#true} call #t~ret3 := fibo1(~n - 2); {8772#true} is VALID [2020-07-29 03:06:29,384 INFO L280 TraceCheckUtils]: 50: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,384 INFO L280 TraceCheckUtils]: 51: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,384 INFO L280 TraceCheckUtils]: 52: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,385 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,385 INFO L280 TraceCheckUtils]: 54: Hoare triple {8772#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {8772#true} is VALID [2020-07-29 03:06:29,385 INFO L280 TraceCheckUtils]: 55: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,385 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {8772#true} {8773#false} #49#return; {8773#false} is VALID [2020-07-29 03:06:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-29 03:06:29,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073492423] [2020-07-29 03:06:29,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338931670] [2020-07-29 03:06:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 03:06:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:29,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:29,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {8772#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {8774#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:29,753 INFO L263 TraceCheckUtils]: 1: Hoare triple {8774#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {8775#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:29,754 INFO L280 TraceCheckUtils]: 2: Hoare triple {8775#(<= |fibo1_#in~n| 5)} ~n := #in~n; {8776#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:29,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {8776#(<= fibo1_~n 5)} assume !(~n < 1); {8776#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:29,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {8776#(<= fibo1_~n 5)} assume !(1 == ~n); {8776#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:29,757 INFO L263 TraceCheckUtils]: 5: Hoare triple {8776#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {8777#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:29,758 INFO L280 TraceCheckUtils]: 6: Hoare triple {8777#(<= |fibo2_#in~n| 4)} ~n := #in~n; {8778#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:29,759 INFO L280 TraceCheckUtils]: 7: Hoare triple {8778#(<= fibo2_~n 4)} assume !(~n < 1); {8778#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:29,759 INFO L280 TraceCheckUtils]: 8: Hoare triple {8778#(<= fibo2_~n 4)} assume !(1 == ~n); {8778#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:29,760 INFO L263 TraceCheckUtils]: 9: Hoare triple {8778#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {8779#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:29,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {8779#(<= |fibo1_#in~n| 3)} ~n := #in~n; {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {8780#(<= fibo1_~n 3)} assume !(~n < 1); {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {8780#(<= fibo1_~n 3)} assume !(1 == ~n); {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,763 INFO L263 TraceCheckUtils]: 13: Hoare triple {8780#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,764 INFO L280 TraceCheckUtils]: 16: Hoare triple {8772#true} assume !(1 == ~n); {8772#true} is VALID [2020-07-29 03:06:29,764 INFO L263 TraceCheckUtils]: 17: Hoare triple {8772#true} call #t~ret2 := fibo1(~n - 1); {8772#true} is VALID [2020-07-29 03:06:29,764 INFO L280 TraceCheckUtils]: 18: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,764 INFO L280 TraceCheckUtils]: 19: Hoare triple {8772#true} assume !(~n < 1); {8772#true} is VALID [2020-07-29 03:06:29,765 INFO L280 TraceCheckUtils]: 20: Hoare triple {8772#true} assume 1 == ~n;#res := 1; {8772#true} is VALID [2020-07-29 03:06:29,765 INFO L280 TraceCheckUtils]: 21: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,765 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {8772#true} {8772#true} #45#return; {8772#true} is VALID [2020-07-29 03:06:29,765 INFO L263 TraceCheckUtils]: 23: Hoare triple {8772#true} call #t~ret3 := fibo1(~n - 2); {8772#true} is VALID [2020-07-29 03:06:29,766 INFO L280 TraceCheckUtils]: 24: Hoare triple {8772#true} ~n := #in~n; {8772#true} is VALID [2020-07-29 03:06:29,766 INFO L280 TraceCheckUtils]: 25: Hoare triple {8772#true} assume ~n < 1;#res := 0; {8772#true} is VALID [2020-07-29 03:06:29,766 INFO L280 TraceCheckUtils]: 26: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,766 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8772#true} {8772#true} #47#return; {8772#true} is VALID [2020-07-29 03:06:29,767 INFO L280 TraceCheckUtils]: 28: Hoare triple {8772#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {8772#true} is VALID [2020-07-29 03:06:29,767 INFO L280 TraceCheckUtils]: 29: Hoare triple {8772#true} assume true; {8772#true} is VALID [2020-07-29 03:06:29,768 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {8772#true} {8780#(<= fibo1_~n 3)} #49#return; {8780#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:29,769 INFO L263 TraceCheckUtils]: 31: Hoare triple {8780#(<= fibo1_~n 3)} call #t~ret1 := fibo2(~n - 2); {8798#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:29,770 INFO L280 TraceCheckUtils]: 32: Hoare triple {8798#(<= |fibo2_#in~n| 1)} ~n := #in~n; {8799#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:29,771 INFO L280 TraceCheckUtils]: 33: Hoare triple {8799#(<= fibo2_~n 1)} assume !(~n < 1); {8799#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:29,771 INFO L280 TraceCheckUtils]: 34: Hoare triple {8799#(<= fibo2_~n 1)} assume !(1 == ~n); {8799#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:29,772 INFO L263 TraceCheckUtils]: 35: Hoare triple {8799#(<= fibo2_~n 1)} call #t~ret2 := fibo1(~n - 1); {8944#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:29,773 INFO L280 TraceCheckUtils]: 36: Hoare triple {8944#(<= |fibo1_#in~n| 0)} ~n := #in~n; {8948#(<= fibo1_~n 0)} is VALID [2020-07-29 03:06:29,774 INFO L280 TraceCheckUtils]: 37: Hoare triple {8948#(<= fibo1_~n 0)} assume !(~n < 1); {8773#false} is VALID [2020-07-29 03:06:29,774 INFO L280 TraceCheckUtils]: 38: Hoare triple {8773#false} assume !(1 == ~n); {8773#false} is VALID [2020-07-29 03:06:29,774 INFO L263 TraceCheckUtils]: 39: Hoare triple {8773#false} call #t~ret0 := fibo2(~n - 1); {8773#false} is VALID [2020-07-29 03:06:29,775 INFO L280 TraceCheckUtils]: 40: Hoare triple {8773#false} ~n := #in~n; {8773#false} is VALID [2020-07-29 03:06:29,775 INFO L280 TraceCheckUtils]: 41: Hoare triple {8773#false} assume !(~n < 1); {8773#false} is VALID [2020-07-29 03:06:29,775 INFO L280 TraceCheckUtils]: 42: Hoare triple {8773#false} assume !(1 == ~n); {8773#false} is VALID [2020-07-29 03:06:29,775 INFO L263 TraceCheckUtils]: 43: Hoare triple {8773#false} call #t~ret2 := fibo1(~n - 1); {8773#false} is VALID [2020-07-29 03:06:29,775 INFO L280 TraceCheckUtils]: 44: Hoare triple {8773#false} ~n := #in~n; {8773#false} is VALID [2020-07-29 03:06:29,776 INFO L280 TraceCheckUtils]: 45: Hoare triple {8773#false} assume !(~n < 1); {8773#false} is VALID [2020-07-29 03:06:29,776 INFO L280 TraceCheckUtils]: 46: Hoare triple {8773#false} assume 1 == ~n;#res := 1; {8773#false} is VALID [2020-07-29 03:06:29,776 INFO L280 TraceCheckUtils]: 47: Hoare triple {8773#false} assume true; {8773#false} is VALID [2020-07-29 03:06:29,776 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {8773#false} {8773#false} #45#return; {8773#false} is VALID [2020-07-29 03:06:29,777 INFO L263 TraceCheckUtils]: 49: Hoare triple {8773#false} call #t~ret3 := fibo1(~n - 2); {8773#false} is VALID [2020-07-29 03:06:29,777 INFO L280 TraceCheckUtils]: 50: Hoare triple {8773#false} ~n := #in~n; {8773#false} is VALID [2020-07-29 03:06:29,777 INFO L280 TraceCheckUtils]: 51: Hoare triple {8773#false} assume ~n < 1;#res := 0; {8773#false} is VALID [2020-07-29 03:06:29,777 INFO L280 TraceCheckUtils]: 52: Hoare triple {8773#false} assume true; {8773#false} is VALID [2020-07-29 03:06:29,777 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {8773#false} {8773#false} #47#return; {8773#false} is VALID [2020-07-29 03:06:29,778 INFO L280 TraceCheckUtils]: 54: Hoare triple {8773#false} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {8773#false} is VALID [2020-07-29 03:06:29,778 INFO L280 TraceCheckUtils]: 55: Hoare triple {8773#false} assume true; {8773#false} is VALID [2020-07-29 03:06:29,778 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {8773#false} {8773#false} #49#return; {8773#false} is VALID [2020-07-29 03:06:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-29 03:06:29,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:29,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2020-07-29 03:06:29,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707198718] [2020-07-29 03:06:30,324 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:30,324 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:30,324 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:30,324 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:30,324 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:06:30,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:30,325 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:30,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration6_Loop [2020-07-29 03:06:30,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:30,325 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:30,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:30,577 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:30,578 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:30,586 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,586 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=1} Honda state: {fibo1_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:30,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,609 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=0} Honda state: {fibo2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:30,636 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,636 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:30,663 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,663 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:30,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,689 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:30,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:30,746 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:30,746 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:30,772 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:30,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:06:30,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:31,259 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:06:31,260 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:31,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:31,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:31,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:31,261 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:06:31,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:31,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:31,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration6_Loop [2020-07-29 03:06:31,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:31,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:31,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:31,503 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:31,503 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:31,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:31,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:31,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:31,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:31,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:31,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:31,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:31,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:31,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:31,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:31,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:31,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:31,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:31,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:06:31,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:06:31,676 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:31,680 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:06:31,680 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:06:31,680 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:06:31,680 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:31,705 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:06:31,708 INFO L393 LassoCheck]: Loop: "call #t~ret1 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#45#return;" "call #t~ret3 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#47#return;" "#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3;" "assume true;" >"#49#return;" [2020-07-29 03:06:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:31,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:06:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:31,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:31,844 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:31,852 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:31,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {9006#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {9006#unseeded} is VALID [2020-07-29 03:06:31,860 INFO L263 TraceCheckUtils]: 1: Hoare triple {9006#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {9006#unseeded} is VALID [2020-07-29 03:06:31,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {9006#unseeded} ~n := #in~n; {9006#unseeded} is VALID [2020-07-29 03:06:31,861 INFO L280 TraceCheckUtils]: 3: Hoare triple {9006#unseeded} assume !(~n < 1); {9006#unseeded} is VALID [2020-07-29 03:06:31,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {9006#unseeded} assume !(1 == ~n); {9006#unseeded} is VALID [2020-07-29 03:06:31,865 INFO L263 TraceCheckUtils]: 5: Hoare triple {9006#unseeded} call #t~ret0 := fibo2(~n - 1); {9006#unseeded} is VALID [2020-07-29 03:06:31,865 INFO L280 TraceCheckUtils]: 6: Hoare triple {9006#unseeded} ~n := #in~n; {9006#unseeded} is VALID [2020-07-29 03:06:31,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {9006#unseeded} assume !(~n < 1); {9006#unseeded} is VALID [2020-07-29 03:06:31,866 INFO L280 TraceCheckUtils]: 8: Hoare triple {9006#unseeded} assume !(1 == ~n); {9006#unseeded} is VALID [2020-07-29 03:06:31,867 INFO L263 TraceCheckUtils]: 9: Hoare triple {9006#unseeded} call #t~ret2 := fibo1(~n - 1); {9006#unseeded} is VALID [2020-07-29 03:06:31,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {9006#unseeded} ~n := #in~n; {9006#unseeded} is VALID [2020-07-29 03:06:31,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {9006#unseeded} assume !(~n < 1); {9006#unseeded} is VALID [2020-07-29 03:06:31,868 INFO L280 TraceCheckUtils]: 12: Hoare triple {9006#unseeded} assume !(1 == ~n); {9006#unseeded} is VALID [2020-07-29 03:06:31,868 INFO L263 TraceCheckUtils]: 13: Hoare triple {9006#unseeded} call #t~ret0 := fibo2(~n - 1); {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,869 INFO L280 TraceCheckUtils]: 14: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,869 INFO L280 TraceCheckUtils]: 15: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,870 INFO L280 TraceCheckUtils]: 16: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,871 INFO L263 TraceCheckUtils]: 17: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,872 INFO L280 TraceCheckUtils]: 18: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,872 INFO L280 TraceCheckUtils]: 19: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,873 INFO L280 TraceCheckUtils]: 20: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,874 INFO L280 TraceCheckUtils]: 21: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,875 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,875 INFO L263 TraceCheckUtils]: 23: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,876 INFO L280 TraceCheckUtils]: 24: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,876 INFO L280 TraceCheckUtils]: 25: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,878 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,879 INFO L280 TraceCheckUtils]: 28: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,879 INFO L280 TraceCheckUtils]: 29: Hoare triple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:31,880 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {9063#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {9006#unseeded} #49#return; {9006#unseeded} is VALID [2020-07-29 03:06:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:31,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-29 03:06:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:31,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:32,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {9009#(>= oldRank0 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {9115#(<= (+ |fibo2_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:32,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {9115#(<= (+ |fibo2_#in~n| 2) oldRank0)} ~n := #in~n; {9119#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2020-07-29 03:06:32,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {9119#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {9119#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2020-07-29 03:06:32,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {9119#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {9119#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2020-07-29 03:06:32,514 INFO L263 TraceCheckUtils]: 4: Hoare triple {9119#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret2 := fibo1(~n - 1); {9129#(<= (+ |fibo1_#in~n| 3) oldRank0)} is VALID [2020-07-29 03:06:32,514 INFO L280 TraceCheckUtils]: 5: Hoare triple {9129#(<= (+ |fibo1_#in~n| 3) oldRank0)} ~n := #in~n; {9133#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2020-07-29 03:06:32,515 INFO L280 TraceCheckUtils]: 6: Hoare triple {9133#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {9133#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2020-07-29 03:06:32,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {9133#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {9133#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2020-07-29 03:06:32,515 INFO L263 TraceCheckUtils]: 8: Hoare triple {9133#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret0 := fibo2(~n - 1); {9143#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:32,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {9143#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,516 INFO L280 TraceCheckUtils]: 10: Hoare triple {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,518 INFO L263 TraceCheckUtils]: 12: Hoare triple {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := fibo1(~n - 1); {9143#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:32,518 INFO L280 TraceCheckUtils]: 13: Hoare triple {9143#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {9160#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,519 INFO L280 TraceCheckUtils]: 14: Hoare triple {9160#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {9164#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,519 INFO L280 TraceCheckUtils]: 15: Hoare triple {9164#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {9164#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,520 INFO L280 TraceCheckUtils]: 16: Hoare triple {9164#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {9164#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:32,521 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {9164#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {9147#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #45#return; {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:32,528 INFO L263 TraceCheckUtils]: 18: Hoare triple {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {9143#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:32,529 INFO L280 TraceCheckUtils]: 19: Hoare triple {9143#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {9143#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:32,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {9143#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {9143#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:32,530 INFO L280 TraceCheckUtils]: 21: Hoare triple {9143#(<= |old(oldRank0)| oldRank0)} assume true; {9143#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:32,531 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {9143#(<= |old(oldRank0)| oldRank0)} {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #47#return; {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:32,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:32,533 INFO L280 TraceCheckUtils]: 24: Hoare triple {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} assume true; {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:32,534 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {9174#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} {9133#(<= (+ fibo1_~n 3) oldRank0)} #49#return; {9019#(or (and (> oldRank0 fibo1_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:06:32,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 03:06:32,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:32,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:32,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:32,605 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2020-07-29 03:06:32,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 109 transitions. cyclomatic complexity: 24 Second operand 12 states. [2020-07-29 03:06:33,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 109 transitions. cyclomatic complexity: 24. Second operand 12 states. Result 317 states and 419 transitions. Complement of second has 46 states. [2020-07-29 03:06:33,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2020-07-29 03:06:33,945 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:33,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 109 transitions. cyclomatic complexity: 24 [2020-07-29 03:06:33,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:33,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:33,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 03:06:33,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:33,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:33,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:33,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 419 transitions. [2020-07-29 03:06:33,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-07-29 03:06:33,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:33,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:33,956 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 87 states and 109 transitions. cyclomatic complexity: 24 [2020-07-29 03:06:33,961 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 03:06:33,962 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states. [2020-07-29 03:06:33,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:33,964 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:33,964 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 317 states and 419 transitions. cyclomatic complexity: 107 [2020-07-29 03:06:33,981 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 37 examples of accepted words. [2020-07-29 03:06:33,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:33,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:33,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 3 letters. Loop has 5 letters. [2020-07-29 03:06:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 03:06:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 3 letters. Loop has 5 letters. [2020-07-29 03:06:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 39 letters. [2020-07-29 03:06:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 39 letters. [2020-07-29 03:06:33,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 39 letters. [2020-07-29 03:06:33,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 317 letters. Loop has 317 letters. [2020-07-29 03:06:33,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 317 letters. Loop has 317 letters. [2020-07-29 03:06:33,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 317 letters. Loop has 317 letters. [2020-07-29 03:06:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 87 letters. Loop has 87 letters. [2020-07-29 03:06:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 87 letters. Loop has 87 letters. [2020-07-29 03:06:33,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 87 letters. Loop has 87 letters. [2020-07-29 03:06:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:06:33,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:06:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:06:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 37 letters. Loop has 8 letters. [2020-07-29 03:06:33,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 37 letters. Loop has 8 letters. [2020-07-29 03:06:33,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 37 letters. Loop has 8 letters. [2020-07-29 03:06:33,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 36 letters. Loop has 8 letters. [2020-07-29 03:06:33,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 36 letters. Loop has 8 letters. [2020-07-29 03:06:33,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 36 letters. Loop has 8 letters. [2020-07-29 03:06:33,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 38 letters. [2020-07-29 03:06:33,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 38 letters. [2020-07-29 03:06:33,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 38 letters. [2020-07-29 03:06:33,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 40 letters. Loop has 8 letters. [2020-07-29 03:06:33,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 40 letters. Loop has 8 letters. [2020-07-29 03:06:33,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 40 letters. Loop has 8 letters. [2020-07-29 03:06:33,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 32 letters. Loop has 26 letters. [2020-07-29 03:06:33,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 32 letters. Loop has 26 letters. [2020-07-29 03:06:33,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 32 letters. Loop has 26 letters. [2020-07-29 03:06:33,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 34 letters. Loop has 8 letters. [2020-07-29 03:06:33,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 34 letters. Loop has 8 letters. [2020-07-29 03:06:33,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 34 letters. Loop has 8 letters. [2020-07-29 03:06:33,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 8 letters. [2020-07-29 03:06:33,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 41 letters. Loop has 8 letters. [2020-07-29 03:06:33,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 41 letters. Loop has 8 letters. [2020-07-29 03:06:33,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 35 letters. Loop has 8 letters. [2020-07-29 03:06:33,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 35 letters. Loop has 8 letters. [2020-07-29 03:06:33,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 35 letters. Loop has 8 letters. [2020-07-29 03:06:34,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 39 letters. Loop has 8 letters. [2020-07-29 03:06:34,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 39 letters. Loop has 8 letters. [2020-07-29 03:06:34,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 39 letters. Loop has 8 letters. [2020-07-29 03:06:34,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 38 letters. Loop has 8 letters. [2020-07-29 03:06:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 38 letters. Loop has 8 letters. [2020-07-29 03:06:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 38 letters. Loop has 8 letters. [2020-07-29 03:06:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 33 letters. Loop has 26 letters. [2020-07-29 03:06:34,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 33 letters. Loop has 26 letters. [2020-07-29 03:06:34,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 33 letters. Loop has 26 letters. [2020-07-29 03:06:34,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 38 letters. [2020-07-29 03:06:34,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 38 letters. [2020-07-29 03:06:34,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 38 letters. [2020-07-29 03:06:34,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 31 letters. Loop has 75 letters. [2020-07-29 03:06:34,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 31 letters. Loop has 75 letters. [2020-07-29 03:06:34,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 31 letters. Loop has 75 letters. [2020-07-29 03:06:34,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 3 letters. Loop has 5 letters. [2020-07-29 03:06:34,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 03:06:34,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 3 letters. Loop has 5 letters. [2020-07-29 03:06:34,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:34,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:34,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:34,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:34,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:34,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:34,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:34,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:34,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:34,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:34,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:34,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:34,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 8 letters. [2020-07-29 03:06:34,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 41 letters. Loop has 8 letters. [2020-07-29 03:06:34,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 41 letters. Loop has 8 letters. [2020-07-29 03:06:34,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 39 letters. [2020-07-29 03:06:34,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 39 letters. [2020-07-29 03:06:34,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 39 letters. [2020-07-29 03:06:34,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 57 letters. Loop has 51 letters. [2020-07-29 03:06:34,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 57 letters. Loop has 51 letters. [2020-07-29 03:06:34,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 57 letters. Loop has 51 letters. [2020-07-29 03:06:34,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 56 letters. Loop has 51 letters. [2020-07-29 03:06:34,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 56 letters. Loop has 51 letters. [2020-07-29 03:06:34,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 56 letters. Loop has 51 letters. [2020-07-29 03:06:34,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 42 letters. Loop has 8 letters. [2020-07-29 03:06:34,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 42 letters. Loop has 8 letters. [2020-07-29 03:06:34,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 42 letters. Loop has 8 letters. [2020-07-29 03:06:34,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:34,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:34,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:34,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 55 letters. Loop has 51 letters. [2020-07-29 03:06:34,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 55 letters. Loop has 51 letters. [2020-07-29 03:06:34,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 55 letters. Loop has 51 letters. [2020-07-29 03:06:34,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 40 letters. Loop has 8 letters. [2020-07-29 03:06:34,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 40 letters. Loop has 8 letters. [2020-07-29 03:06:34,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 40 letters. Loop has 8 letters. [2020-07-29 03:06:34,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 101 letters. [2020-07-29 03:06:34,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 101 letters. [2020-07-29 03:06:34,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 101 letters. [2020-07-29 03:06:34,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 55 letters. Loop has 51 letters. [2020-07-29 03:06:34,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 55 letters. Loop has 51 letters. [2020-07-29 03:06:34,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 55 letters. Loop has 51 letters. [2020-07-29 03:06:34,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 55 letters. Loop has 26 letters. [2020-07-29 03:06:34,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 55 letters. Loop has 26 letters. [2020-07-29 03:06:34,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 55 letters. Loop has 26 letters. [2020-07-29 03:06:34,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 104 letters. Loop has 82 letters. [2020-07-29 03:06:34,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 104 letters. Loop has 82 letters. [2020-07-29 03:06:34,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 104 letters. Loop has 82 letters. [2020-07-29 03:06:34,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:34,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:34,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:34,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:34,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:34,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:34,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:34,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:34,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:34,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:06:34,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:06:34,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:06:34,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:06:34,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:06:34,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:06:34,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:34,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:34,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:34,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:06:34,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:06:34,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:06:34,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:06:34,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:06:34,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:06:34,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:06:34,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:06:34,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:06:34,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:34,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:34,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:34,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:06:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:06:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:06:34,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:34,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 66 letters. Loop has 26 letters. [2020-07-29 03:06:34,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 66 letters. Loop has 26 letters. [2020-07-29 03:06:34,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 66 letters. Loop has 26 letters. [2020-07-29 03:06:34,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 67 letters. Loop has 26 letters. [2020-07-29 03:06:34,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 67 letters. Loop has 26 letters. [2020-07-29 03:06:34,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 67 letters. Loop has 26 letters. [2020-07-29 03:06:34,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 104 letters. Loop has 57 letters. [2020-07-29 03:06:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 104 letters. Loop has 57 letters. [2020-07-29 03:06:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 104 letters. Loop has 57 letters. [2020-07-29 03:06:34,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 104 letters. Loop has 82 letters. [2020-07-29 03:06:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 104 letters. Loop has 82 letters. [2020-07-29 03:06:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 104 letters. Loop has 82 letters. [2020-07-29 03:06:34,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:06:34,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:06:34,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:06:34,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:06:34,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:06:34,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 65 letters. Loop has 26 letters. [2020-07-29 03:06:34,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 109 transitions. cyclomatic complexity: 24 Stem has 65 letters. Loop has 51 letters. [2020-07-29 03:06:34,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 65 letters. Loop has 51 letters. [2020-07-29 03:06:34,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 317 states and 419 transitions. cyclomatic complexity: 107 Stem has 65 letters. Loop has 51 letters. [2020-07-29 03:06:34,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,063 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:06:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2020-07-29 03:06:34,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 69 transitions. Stem has 31 letters. Loop has 26 letters. [2020-07-29 03:06:34,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 69 transitions. Stem has 57 letters. Loop has 26 letters. [2020-07-29 03:06:34,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 69 transitions. Stem has 31 letters. Loop has 52 letters. [2020-07-29 03:06:34,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:34,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 419 transitions. cyclomatic complexity: 107 [2020-07-29 03:06:34,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-07-29 03:06:34,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 274 states and 372 transitions. [2020-07-29 03:06:34,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2020-07-29 03:06:34,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2020-07-29 03:06:34,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 372 transitions. [2020-07-29 03:06:34,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:34,098 INFO L688 BuchiCegarLoop]: Abstraction has 274 states and 372 transitions. [2020-07-29 03:06:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 372 transitions. [2020-07-29 03:06:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2020-07-29 03:06:34,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:34,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states and 372 transitions. Second operand 240 states. [2020-07-29 03:06:34,108 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states and 372 transitions. Second operand 240 states. [2020-07-29 03:06:34,108 INFO L87 Difference]: Start difference. First operand 274 states and 372 transitions. Second operand 240 states. [2020-07-29 03:06:34,109 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:34,146 INFO L93 Difference]: Finished difference Result 568 states and 769 transitions. [2020-07-29 03:06:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 769 transitions. [2020-07-29 03:06:34,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:34,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:34,151 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 274 states and 372 transitions. [2020-07-29 03:06:34,151 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 274 states and 372 transitions. [2020-07-29 03:06:34,151 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:34,191 INFO L93 Difference]: Finished difference Result 587 states and 796 transitions. [2020-07-29 03:06:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 796 transitions. [2020-07-29 03:06:34,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:34,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:34,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:34,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-07-29 03:06:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 318 transitions. [2020-07-29 03:06:34,206 INFO L711 BuchiCegarLoop]: Abstraction has 240 states and 318 transitions. [2020-07-29 03:06:34,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:06:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:06:34,207 INFO L87 Difference]: Start difference. First operand 240 states and 318 transitions. Second operand 14 states. [2020-07-29 03:06:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:34,995 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2020-07-29 03:06:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 03:06:34,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:06:35,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:35,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 145 transitions. [2020-07-29 03:06:35,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 03:06:35,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 118 states and 140 transitions. [2020-07-29 03:06:35,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2020-07-29 03:06:35,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2020-07-29 03:06:35,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 140 transitions. [2020-07-29 03:06:35,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:35,074 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 140 transitions. [2020-07-29 03:06:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 140 transitions. [2020-07-29 03:06:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2020-07-29 03:06:35,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:35,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states and 140 transitions. Second operand 110 states. [2020-07-29 03:06:35,079 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states and 140 transitions. Second operand 110 states. [2020-07-29 03:06:35,079 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand 110 states. [2020-07-29 03:06:35,079 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:35,088 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2020-07-29 03:06:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 242 transitions. [2020-07-29 03:06:35,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:35,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:35,090 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 118 states and 140 transitions. [2020-07-29 03:06:35,090 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 118 states and 140 transitions. [2020-07-29 03:06:35,091 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:35,100 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2020-07-29 03:06:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 242 transitions. [2020-07-29 03:06:35,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:35,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:35,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:35,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-29 03:06:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2020-07-29 03:06:35,106 INFO L711 BuchiCegarLoop]: Abstraction has 110 states and 132 transitions. [2020-07-29 03:06:35,106 INFO L591 BuchiCegarLoop]: Abstraction has 110 states and 132 transitions. [2020-07-29 03:06:35,106 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:06:35,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 132 transitions. [2020-07-29 03:06:35,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 03:06:35,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:35,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:35,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:35,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:35,110 INFO L794 eck$LassoCheckResult]: Stem: 11952#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 11930#L37 call main_#t~ret4 := fibo1(main_~x~0);< 11931#fibo1ENTRY ~n := #in~n; 11970#L8 assume !(~n < 1); 11992#L10 assume !(1 == ~n); 11928#L13 call #t~ret0 := fibo2(~n - 1);< 11947#fibo2ENTRY ~n := #in~n; 11966#L18 assume !(~n < 1); 11967#L20 assume !(1 == ~n); 11927#L23 call #t~ret2 := fibo1(~n - 1);< 11929#fibo1ENTRY ~n := #in~n; 11956#L8 assume !(~n < 1); 11935#L10 assume !(1 == ~n); 11937#L13 call #t~ret0 := fibo2(~n - 1);< 11959#fibo2ENTRY ~n := #in~n; 11960#L18 assume !(~n < 1); 11964#L20 assume !(1 == ~n); 11936#L23 call #t~ret2 := fibo1(~n - 1);< 11929#fibo1ENTRY ~n := #in~n; 11956#L8 assume !(~n < 1); 11935#L10 assume !(1 == ~n); 11937#L13 call #t~ret0 := fibo2(~n - 1);< 11959#fibo2ENTRY ~n := #in~n; 11960#L18 assume !(~n < 1); 11964#L20 assume !(1 == ~n); 11936#L23 call #t~ret2 := fibo1(~n - 1);< 11929#fibo1ENTRY ~n := #in~n; 11957#L8 assume !(~n < 1); 12011#L10 assume 1 == ~n;#res := 1; 12009#fibo1FINAL assume true; 12001#fibo1EXIT >#45#return; 11954#L23-1 call #t~ret3 := fibo1(~n - 2);< 11953#fibo1ENTRY ~n := #in~n; 11955#L8 assume ~n < 1;#res := 0; 12029#fibo1FINAL assume true; 11997#fibo1EXIT >#47#return; 11995#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11993#fibo2FINAL assume true; 11991#fibo2EXIT >#49#return; 11939#L13-1 call #t~ret1 := fibo2(~n - 2);< 11987#fibo2ENTRY ~n := #in~n; 11965#L18 assume ~n < 1;#res := 0; 11938#fibo2FINAL assume true; 11940#fibo2EXIT >#51#return; 11983#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11981#fibo1FINAL assume true; 11979#fibo1EXIT >#45#return; 11973#L23-1 [2020-07-29 03:06:35,110 INFO L796 eck$LassoCheckResult]: Loop: 11973#L23-1 call #t~ret3 := fibo1(~n - 2);< 11926#fibo1ENTRY ~n := #in~n; 11975#L8 assume !(~n < 1); 11971#L10 assume !(1 == ~n); 11925#L13 call #t~ret0 := fibo2(~n - 1);< 11949#fibo2ENTRY ~n := #in~n; 11958#L18 assume !(~n < 1); 11968#L20 assume !(1 == ~n); 11923#L23 call #t~ret2 := fibo1(~n - 1);< 11926#fibo1ENTRY ~n := #in~n; 11975#L8 assume !(~n < 1); 11971#L10 assume !(1 == ~n); 11925#L13 call #t~ret0 := fibo2(~n - 1);< 11949#fibo2ENTRY ~n := #in~n; 11958#L18 assume !(~n < 1); 11968#L20 assume !(1 == ~n); 11923#L23 call #t~ret2 := fibo1(~n - 1);< 11926#fibo1ENTRY ~n := #in~n; 11975#L8 assume !(~n < 1); 11971#L10 assume 1 == ~n;#res := 1; 11974#fibo1FINAL assume true; 12028#fibo1EXIT >#45#return; 11999#L23-1 call #t~ret3 := fibo1(~n - 2);< 12000#fibo1ENTRY ~n := #in~n; 12031#L8 assume ~n < 1;#res := 0; 11976#fibo1FINAL assume true; 11998#fibo1EXIT >#47#return; 11996#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 11994#fibo2FINAL assume true; 11988#fibo2EXIT >#49#return; 11985#L13-1 call #t~ret1 := fibo2(~n - 2);< 11986#fibo2ENTRY ~n := #in~n; 12016#L18 assume ~n < 1;#res := 0; 12013#fibo2FINAL assume true; 12006#fibo2EXIT >#51#return; 11982#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 11980#fibo1FINAL assume true; 11977#fibo1EXIT >#45#return; 11973#L23-1 [2020-07-29 03:06:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -444366370, now seen corresponding path program 1 times [2020-07-29 03:06:35,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:35,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999157651] [2020-07-29 03:06:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-07-29 03:06:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {12826#true} assume 1 == ~n;#res := 1; {12826#true} is VALID [2020-07-29 03:06:35,316 INFO L280 TraceCheckUtils]: 3: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,316 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12826#true} {12826#true} #45#return; {12826#true} is VALID [2020-07-29 03:06:35,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12826#true} {12826#true} #47#return; {12826#true} is VALID [2020-07-29 03:06:35,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {12826#true} assume !(1 == ~n); {12826#true} is VALID [2020-07-29 03:06:35,329 INFO L263 TraceCheckUtils]: 3: Hoare triple {12826#true} call #t~ret2 := fibo1(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,329 INFO L280 TraceCheckUtils]: 5: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,330 INFO L280 TraceCheckUtils]: 6: Hoare triple {12826#true} assume 1 == ~n;#res := 1; {12826#true} is VALID [2020-07-29 03:06:35,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,331 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {12826#true} {12826#true} #45#return; {12826#true} is VALID [2020-07-29 03:06:35,331 INFO L263 TraceCheckUtils]: 9: Hoare triple {12826#true} call #t~ret3 := fibo1(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,332 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {12826#true} {12826#true} #47#return; {12826#true} is VALID [2020-07-29 03:06:35,332 INFO L280 TraceCheckUtils]: 14: Hoare triple {12826#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {12826#true} is VALID [2020-07-29 03:06:35,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,335 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #49#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:06:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,342 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #51#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} ~n := #in~n; {12866#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {12866#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {12867#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:35,345 INFO L280 TraceCheckUtils]: 2: Hoare triple {12867#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {12826#true} assume !(1 == ~n); {12826#true} is VALID [2020-07-29 03:06:35,346 INFO L263 TraceCheckUtils]: 7: Hoare triple {12826#true} call #t~ret2 := fibo1(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {12826#true} assume 1 == ~n;#res := 1; {12826#true} is VALID [2020-07-29 03:06:35,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,347 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {12826#true} {12826#true} #45#return; {12826#true} is VALID [2020-07-29 03:06:35,348 INFO L263 TraceCheckUtils]: 13: Hoare triple {12826#true} call #t~ret3 := fibo1(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,348 INFO L280 TraceCheckUtils]: 14: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,348 INFO L280 TraceCheckUtils]: 15: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,348 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {12826#true} {12826#true} #47#return; {12826#true} is VALID [2020-07-29 03:06:35,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {12826#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {12826#true} is VALID [2020-07-29 03:06:35,349 INFO L280 TraceCheckUtils]: 19: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,351 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #49#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,352 INFO L263 TraceCheckUtils]: 21: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,352 INFO L280 TraceCheckUtils]: 22: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,352 INFO L280 TraceCheckUtils]: 23: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,352 INFO L280 TraceCheckUtils]: 24: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,354 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #51#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,355 INFO L280 TraceCheckUtils]: 26: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,356 INFO L280 TraceCheckUtils]: 27: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} assume true; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,358 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {12868#(<= 2 |fibo1_#in~n|)} {12836#(<= fibo2_~n 2)} #45#return; {12827#false} is VALID [2020-07-29 03:06:35,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {12828#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:35,361 INFO L263 TraceCheckUtils]: 1: Hoare triple {12828#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {12829#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:35,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {12829#(<= |fibo1_#in~n| 5)} ~n := #in~n; {12830#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:35,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {12830#(<= fibo1_~n 5)} assume !(~n < 1); {12830#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:35,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {12830#(<= fibo1_~n 5)} assume !(1 == ~n); {12830#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:35,365 INFO L263 TraceCheckUtils]: 5: Hoare triple {12830#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {12831#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:35,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {12831#(<= |fibo2_#in~n| 4)} ~n := #in~n; {12832#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:35,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {12832#(<= fibo2_~n 4)} assume !(~n < 1); {12832#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:35,367 INFO L280 TraceCheckUtils]: 8: Hoare triple {12832#(<= fibo2_~n 4)} assume !(1 == ~n); {12832#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:35,368 INFO L263 TraceCheckUtils]: 9: Hoare triple {12832#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {12833#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:35,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {12833#(<= |fibo1_#in~n| 3)} ~n := #in~n; {12834#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:35,370 INFO L280 TraceCheckUtils]: 11: Hoare triple {12834#(<= fibo1_~n 3)} assume !(~n < 1); {12834#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:35,371 INFO L280 TraceCheckUtils]: 12: Hoare triple {12834#(<= fibo1_~n 3)} assume !(1 == ~n); {12834#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:35,372 INFO L263 TraceCheckUtils]: 13: Hoare triple {12834#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {12835#(<= |fibo2_#in~n| 2)} is VALID [2020-07-29 03:06:35,373 INFO L280 TraceCheckUtils]: 14: Hoare triple {12835#(<= |fibo2_#in~n| 2)} ~n := #in~n; {12836#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:35,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {12836#(<= fibo2_~n 2)} assume !(~n < 1); {12836#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:35,375 INFO L280 TraceCheckUtils]: 16: Hoare triple {12836#(<= fibo2_~n 2)} assume !(1 == ~n); {12836#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:35,375 INFO L263 TraceCheckUtils]: 17: Hoare triple {12836#(<= fibo2_~n 2)} call #t~ret2 := fibo1(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,376 INFO L280 TraceCheckUtils]: 18: Hoare triple {12826#true} ~n := #in~n; {12866#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {12866#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {12867#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:35,379 INFO L280 TraceCheckUtils]: 20: Hoare triple {12867#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,379 INFO L263 TraceCheckUtils]: 21: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,379 INFO L280 TraceCheckUtils]: 22: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,380 INFO L280 TraceCheckUtils]: 23: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,380 INFO L280 TraceCheckUtils]: 24: Hoare triple {12826#true} assume !(1 == ~n); {12826#true} is VALID [2020-07-29 03:06:35,380 INFO L263 TraceCheckUtils]: 25: Hoare triple {12826#true} call #t~ret2 := fibo1(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,381 INFO L280 TraceCheckUtils]: 26: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,381 INFO L280 TraceCheckUtils]: 27: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,381 INFO L280 TraceCheckUtils]: 28: Hoare triple {12826#true} assume 1 == ~n;#res := 1; {12826#true} is VALID [2020-07-29 03:06:35,382 INFO L280 TraceCheckUtils]: 29: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,382 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {12826#true} {12826#true} #45#return; {12826#true} is VALID [2020-07-29 03:06:35,382 INFO L263 TraceCheckUtils]: 31: Hoare triple {12826#true} call #t~ret3 := fibo1(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,383 INFO L280 TraceCheckUtils]: 32: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,383 INFO L280 TraceCheckUtils]: 33: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,383 INFO L280 TraceCheckUtils]: 34: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,383 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {12826#true} {12826#true} #47#return; {12826#true} is VALID [2020-07-29 03:06:35,384 INFO L280 TraceCheckUtils]: 36: Hoare triple {12826#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {12826#true} is VALID [2020-07-29 03:06:35,384 INFO L280 TraceCheckUtils]: 37: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,386 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #49#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,386 INFO L263 TraceCheckUtils]: 39: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,386 INFO L280 TraceCheckUtils]: 40: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,387 INFO L280 TraceCheckUtils]: 41: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,387 INFO L280 TraceCheckUtils]: 42: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,389 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #51#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,389 INFO L280 TraceCheckUtils]: 44: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,390 INFO L280 TraceCheckUtils]: 45: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} assume true; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,392 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {12868#(<= 2 |fibo1_#in~n|)} {12836#(<= fibo2_~n 2)} #45#return; {12827#false} is VALID [2020-07-29 03:06:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-29 03:06:35,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999157651] [2020-07-29 03:06:35,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355916213] [2020-07-29 03:06:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:06:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:35,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {12826#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {12828#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:35,778 INFO L263 TraceCheckUtils]: 1: Hoare triple {12828#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {12829#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:35,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {12829#(<= |fibo1_#in~n| 5)} ~n := #in~n; {12830#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:35,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {12830#(<= fibo1_~n 5)} assume !(~n < 1); {12830#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:35,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {12830#(<= fibo1_~n 5)} assume !(1 == ~n); {12830#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:35,781 INFO L263 TraceCheckUtils]: 5: Hoare triple {12830#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {12831#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:35,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {12831#(<= |fibo2_#in~n| 4)} ~n := #in~n; {12832#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:35,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {12832#(<= fibo2_~n 4)} assume !(~n < 1); {12832#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:35,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {12832#(<= fibo2_~n 4)} assume !(1 == ~n); {12832#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:35,784 INFO L263 TraceCheckUtils]: 9: Hoare triple {12832#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {12833#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:35,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {12833#(<= |fibo1_#in~n| 3)} ~n := #in~n; {12834#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:35,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {12834#(<= fibo1_~n 3)} assume !(~n < 1); {12834#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:35,786 INFO L280 TraceCheckUtils]: 12: Hoare triple {12834#(<= fibo1_~n 3)} assume !(1 == ~n); {12834#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:35,787 INFO L263 TraceCheckUtils]: 13: Hoare triple {12834#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {12835#(<= |fibo2_#in~n| 2)} is VALID [2020-07-29 03:06:35,788 INFO L280 TraceCheckUtils]: 14: Hoare triple {12835#(<= |fibo2_#in~n| 2)} ~n := #in~n; {12836#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:35,789 INFO L280 TraceCheckUtils]: 15: Hoare triple {12836#(<= fibo2_~n 2)} assume !(~n < 1); {12836#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:35,790 INFO L280 TraceCheckUtils]: 16: Hoare triple {12836#(<= fibo2_~n 2)} assume !(1 == ~n); {12836#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:35,790 INFO L263 TraceCheckUtils]: 17: Hoare triple {12836#(<= fibo2_~n 2)} call #t~ret2 := fibo1(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {12826#true} ~n := #in~n; {12956#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,791 INFO L280 TraceCheckUtils]: 19: Hoare triple {12956#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {12956#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {12956#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {12956#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,792 INFO L263 TraceCheckUtils]: 21: Hoare triple {12956#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {12826#true} ~n := #in~n; {12969#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,794 INFO L280 TraceCheckUtils]: 23: Hoare triple {12969#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {12973#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,795 INFO L280 TraceCheckUtils]: 24: Hoare triple {12973#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {12973#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,795 INFO L263 TraceCheckUtils]: 25: Hoare triple {12973#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {12826#true} is VALID [2020-07-29 03:06:35,795 INFO L280 TraceCheckUtils]: 26: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,795 INFO L280 TraceCheckUtils]: 27: Hoare triple {12826#true} assume !(~n < 1); {12826#true} is VALID [2020-07-29 03:06:35,796 INFO L280 TraceCheckUtils]: 28: Hoare triple {12826#true} assume 1 == ~n;#res := 1; {12826#true} is VALID [2020-07-29 03:06:35,796 INFO L280 TraceCheckUtils]: 29: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,797 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {12826#true} {12973#(<= 1 |fibo2_#in~n|)} #45#return; {12973#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,797 INFO L263 TraceCheckUtils]: 31: Hoare triple {12973#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,797 INFO L280 TraceCheckUtils]: 32: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,798 INFO L280 TraceCheckUtils]: 33: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,798 INFO L280 TraceCheckUtils]: 34: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,800 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {12826#true} {12973#(<= 1 |fibo2_#in~n|)} #47#return; {12973#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,801 INFO L280 TraceCheckUtils]: 36: Hoare triple {12973#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {12973#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,801 INFO L280 TraceCheckUtils]: 37: Hoare triple {12973#(<= 1 |fibo2_#in~n|)} assume true; {12973#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,803 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {12973#(<= 1 |fibo2_#in~n|)} {12956#(<= fibo1_~n |fibo1_#in~n|)} #49#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,803 INFO L263 TraceCheckUtils]: 39: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {12826#true} is VALID [2020-07-29 03:06:35,803 INFO L280 TraceCheckUtils]: 40: Hoare triple {12826#true} ~n := #in~n; {12826#true} is VALID [2020-07-29 03:06:35,803 INFO L280 TraceCheckUtils]: 41: Hoare triple {12826#true} assume ~n < 1;#res := 0; {12826#true} is VALID [2020-07-29 03:06:35,804 INFO L280 TraceCheckUtils]: 42: Hoare triple {12826#true} assume true; {12826#true} is VALID [2020-07-29 03:06:35,806 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {12826#true} {12868#(<= 2 |fibo1_#in~n|)} #51#return; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,807 INFO L280 TraceCheckUtils]: 44: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,807 INFO L280 TraceCheckUtils]: 45: Hoare triple {12868#(<= 2 |fibo1_#in~n|)} assume true; {12868#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:35,809 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {12868#(<= 2 |fibo1_#in~n|)} {12836#(<= fibo2_~n 2)} #45#return; {12827#false} is VALID [2020-07-29 03:06:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 03:06:35,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:35,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 16 [2020-07-29 03:06:35,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099917495] [2020-07-29 03:06:35,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1179096830, now seen corresponding path program 1 times [2020-07-29 03:06:35,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:35,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458742643] [2020-07-29 03:06:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 03:06:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {13040#true} assume 1 == ~n;#res := 1; {13040#true} is VALID [2020-07-29 03:06:35,917 INFO L280 TraceCheckUtils]: 3: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,923 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #45#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {13040#true} assume ~n < 1;#res := 0; {13040#true} is VALID [2020-07-29 03:06:35,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,934 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #47#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {13040#true} ~n := #in~n; {13093#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {13093#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {13094#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-29 03:06:35,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {13094#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,937 INFO L263 TraceCheckUtils]: 3: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,937 INFO L280 TraceCheckUtils]: 4: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,938 INFO L280 TraceCheckUtils]: 6: Hoare triple {13040#true} assume 1 == ~n;#res := 1; {13040#true} is VALID [2020-07-29 03:06:35,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,939 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #45#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,939 INFO L263 TraceCheckUtils]: 9: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {13040#true} is VALID [2020-07-29 03:06:35,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {13040#true} assume ~n < 1;#res := 0; {13040#true} is VALID [2020-07-29 03:06:35,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,941 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #47#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,942 INFO L280 TraceCheckUtils]: 14: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} assume true; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,944 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {13095#(<= 2 |fibo2_#in~n|)} {13040#true} #49#return; {13088#(<= 3 fibo1_~n)} is VALID [2020-07-29 03:06:35,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:06:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:35,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {13040#true} ~n := #in~n; {13093#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {13093#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:35,971 INFO L280 TraceCheckUtils]: 2: Hoare triple {13105#(<= |fibo2_#in~n| 0)} assume true; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:35,973 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {13105#(<= |fibo2_#in~n| 0)} {13088#(<= 3 fibo1_~n)} #51#return; {13041#false} is VALID [2020-07-29 03:06:35,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:35,974 INFO L263 TraceCheckUtils]: 3: Hoare triple {13040#true} call #t~ret0 := fibo2(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {13040#true} ~n := #in~n; {13093#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {13093#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {13094#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-29 03:06:35,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {13094#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,977 INFO L263 TraceCheckUtils]: 7: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {13040#true} assume 1 == ~n;#res := 1; {13040#true} is VALID [2020-07-29 03:06:35,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,979 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #45#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,979 INFO L263 TraceCheckUtils]: 13: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {13040#true} is VALID [2020-07-29 03:06:35,979 INFO L280 TraceCheckUtils]: 14: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,979 INFO L280 TraceCheckUtils]: 15: Hoare triple {13040#true} assume ~n < 1;#res := 0; {13040#true} is VALID [2020-07-29 03:06:35,979 INFO L280 TraceCheckUtils]: 16: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,981 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #47#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,981 INFO L280 TraceCheckUtils]: 18: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,982 INFO L280 TraceCheckUtils]: 19: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} assume true; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,983 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {13095#(<= 2 |fibo2_#in~n|)} {13040#true} #49#return; {13088#(<= 3 fibo1_~n)} is VALID [2020-07-29 03:06:35,984 INFO L263 TraceCheckUtils]: 21: Hoare triple {13088#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {13040#true} is VALID [2020-07-29 03:06:35,984 INFO L280 TraceCheckUtils]: 22: Hoare triple {13040#true} ~n := #in~n; {13093#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,985 INFO L280 TraceCheckUtils]: 23: Hoare triple {13093#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:35,986 INFO L280 TraceCheckUtils]: 24: Hoare triple {13105#(<= |fibo2_#in~n| 0)} assume true; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:35,988 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {13105#(<= |fibo2_#in~n| 0)} {13088#(<= 3 fibo1_~n)} #51#return; {13041#false} is VALID [2020-07-29 03:06:35,988 INFO L280 TraceCheckUtils]: 26: Hoare triple {13041#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {13041#false} is VALID [2020-07-29 03:06:35,988 INFO L280 TraceCheckUtils]: 27: Hoare triple {13041#false} assume true; {13041#false} is VALID [2020-07-29 03:06:35,988 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {13041#false} {13040#true} #45#return; {13041#false} is VALID [2020-07-29 03:06:35,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {13040#true} call #t~ret3 := fibo1(~n - 2); {13040#true} is VALID [2020-07-29 03:06:35,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:35,990 INFO L263 TraceCheckUtils]: 4: Hoare triple {13040#true} call #t~ret0 := fibo2(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,991 INFO L280 TraceCheckUtils]: 6: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,991 INFO L280 TraceCheckUtils]: 7: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:35,991 INFO L263 TraceCheckUtils]: 8: Hoare triple {13040#true} call #t~ret2 := fibo1(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:35,992 INFO L263 TraceCheckUtils]: 12: Hoare triple {13040#true} call #t~ret0 := fibo2(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {13040#true} ~n := #in~n; {13093#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {13093#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {13094#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-29 03:06:35,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {13094#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,995 INFO L263 TraceCheckUtils]: 16: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {13040#true} is VALID [2020-07-29 03:06:35,995 INFO L280 TraceCheckUtils]: 17: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,995 INFO L280 TraceCheckUtils]: 18: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:35,995 INFO L280 TraceCheckUtils]: 19: Hoare triple {13040#true} assume 1 == ~n;#res := 1; {13040#true} is VALID [2020-07-29 03:06:35,996 INFO L280 TraceCheckUtils]: 20: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,997 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #45#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:35,997 INFO L263 TraceCheckUtils]: 22: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {13040#true} is VALID [2020-07-29 03:06:35,997 INFO L280 TraceCheckUtils]: 23: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:35,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {13040#true} assume ~n < 1;#res := 0; {13040#true} is VALID [2020-07-29 03:06:35,998 INFO L280 TraceCheckUtils]: 25: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:35,999 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #47#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,000 INFO L280 TraceCheckUtils]: 27: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,000 INFO L280 TraceCheckUtils]: 28: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} assume true; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,002 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {13095#(<= 2 |fibo2_#in~n|)} {13040#true} #49#return; {13088#(<= 3 fibo1_~n)} is VALID [2020-07-29 03:06:36,002 INFO L263 TraceCheckUtils]: 30: Hoare triple {13088#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {13040#true} is VALID [2020-07-29 03:06:36,003 INFO L280 TraceCheckUtils]: 31: Hoare triple {13040#true} ~n := #in~n; {13093#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,004 INFO L280 TraceCheckUtils]: 32: Hoare triple {13093#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:36,004 INFO L280 TraceCheckUtils]: 33: Hoare triple {13105#(<= |fibo2_#in~n| 0)} assume true; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:36,006 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {13105#(<= |fibo2_#in~n| 0)} {13088#(<= 3 fibo1_~n)} #51#return; {13041#false} is VALID [2020-07-29 03:06:36,006 INFO L280 TraceCheckUtils]: 35: Hoare triple {13041#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {13041#false} is VALID [2020-07-29 03:06:36,006 INFO L280 TraceCheckUtils]: 36: Hoare triple {13041#false} assume true; {13041#false} is VALID [2020-07-29 03:06:36,006 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {13041#false} {13040#true} #45#return; {13041#false} is VALID [2020-07-29 03:06:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-29 03:06:36,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458742643] [2020-07-29 03:06:36,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840019698] [2020-07-29 03:06:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:36,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:06:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:36,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:36,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {13040#true} call #t~ret3 := fibo1(~n - 2); {13040#true} is VALID [2020-07-29 03:06:36,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:36,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:36,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:36,297 INFO L263 TraceCheckUtils]: 4: Hoare triple {13040#true} call #t~ret0 := fibo2(~n - 1); {13040#true} is VALID [2020-07-29 03:06:36,297 INFO L280 TraceCheckUtils]: 5: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:36,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:36,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:36,298 INFO L263 TraceCheckUtils]: 8: Hoare triple {13040#true} call #t~ret2 := fibo1(~n - 1); {13040#true} is VALID [2020-07-29 03:06:36,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:36,298 INFO L280 TraceCheckUtils]: 10: Hoare triple {13040#true} assume !(~n < 1); {13040#true} is VALID [2020-07-29 03:06:36,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {13040#true} assume !(1 == ~n); {13040#true} is VALID [2020-07-29 03:06:36,298 INFO L263 TraceCheckUtils]: 12: Hoare triple {13040#true} call #t~ret0 := fibo2(~n - 1); {13040#true} is VALID [2020-07-29 03:06:36,299 INFO L280 TraceCheckUtils]: 13: Hoare triple {13040#true} ~n := #in~n; {13148#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,300 INFO L280 TraceCheckUtils]: 14: Hoare triple {13148#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {13148#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,300 INFO L280 TraceCheckUtils]: 15: Hoare triple {13148#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {13148#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,301 INFO L263 TraceCheckUtils]: 16: Hoare triple {13148#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {13040#true} is VALID [2020-07-29 03:06:36,301 INFO L280 TraceCheckUtils]: 17: Hoare triple {13040#true} ~n := #in~n; {13161#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:36,302 INFO L280 TraceCheckUtils]: 18: Hoare triple {13161#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {13165#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:36,303 INFO L280 TraceCheckUtils]: 19: Hoare triple {13165#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {13165#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:36,303 INFO L280 TraceCheckUtils]: 20: Hoare triple {13165#(<= 1 |fibo1_#in~n|)} assume true; {13165#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:36,305 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {13165#(<= 1 |fibo1_#in~n|)} {13148#(<= fibo2_~n |fibo2_#in~n|)} #45#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,305 INFO L263 TraceCheckUtils]: 22: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {13040#true} is VALID [2020-07-29 03:06:36,305 INFO L280 TraceCheckUtils]: 23: Hoare triple {13040#true} ~n := #in~n; {13040#true} is VALID [2020-07-29 03:06:36,305 INFO L280 TraceCheckUtils]: 24: Hoare triple {13040#true} assume ~n < 1;#res := 0; {13040#true} is VALID [2020-07-29 03:06:36,305 INFO L280 TraceCheckUtils]: 25: Hoare triple {13040#true} assume true; {13040#true} is VALID [2020-07-29 03:06:36,307 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {13040#true} {13095#(<= 2 |fibo2_#in~n|)} #47#return; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,308 INFO L280 TraceCheckUtils]: 27: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,308 INFO L280 TraceCheckUtils]: 28: Hoare triple {13095#(<= 2 |fibo2_#in~n|)} assume true; {13095#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:36,309 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {13095#(<= 2 |fibo2_#in~n|)} {13040#true} #49#return; {13088#(<= 3 fibo1_~n)} is VALID [2020-07-29 03:06:36,310 INFO L263 TraceCheckUtils]: 30: Hoare triple {13088#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {13040#true} is VALID [2020-07-29 03:06:36,310 INFO L280 TraceCheckUtils]: 31: Hoare triple {13040#true} ~n := #in~n; {13205#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-29 03:06:36,311 INFO L280 TraceCheckUtils]: 32: Hoare triple {13205#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:36,311 INFO L280 TraceCheckUtils]: 33: Hoare triple {13105#(<= |fibo2_#in~n| 0)} assume true; {13105#(<= |fibo2_#in~n| 0)} is VALID [2020-07-29 03:06:36,312 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {13105#(<= |fibo2_#in~n| 0)} {13088#(<= 3 fibo1_~n)} #51#return; {13041#false} is VALID [2020-07-29 03:06:36,313 INFO L280 TraceCheckUtils]: 35: Hoare triple {13041#false} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {13041#false} is VALID [2020-07-29 03:06:36,313 INFO L280 TraceCheckUtils]: 36: Hoare triple {13041#false} assume true; {13041#false} is VALID [2020-07-29 03:06:36,313 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {13041#false} {13040#true} #45#return; {13041#false} is VALID [2020-07-29 03:06:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-29 03:06:36,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:36,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-29 03:06:36,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873751505] [2020-07-29 03:06:36,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:06:36,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:36,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 03:06:36,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:06:36,316 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. cyclomatic complexity: 24 Second operand 11 states. [2020-07-29 03:06:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:37,028 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2020-07-29 03:06:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:06:37,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 03:06:37,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:37,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 140 transitions. [2020-07-29 03:06:37,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 03:06:37,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 116 states and 136 transitions. [2020-07-29 03:06:37,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-07-29 03:06:37,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-07-29 03:06:37,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 136 transitions. [2020-07-29 03:06:37,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:37,092 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 136 transitions. [2020-07-29 03:06:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 136 transitions. [2020-07-29 03:06:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2020-07-29 03:06:37,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:37,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 136 transitions. Second operand 112 states. [2020-07-29 03:06:37,100 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 136 transitions. Second operand 112 states. [2020-07-29 03:06:37,100 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand 112 states. [2020-07-29 03:06:37,100 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:37,108 INFO L93 Difference]: Finished difference Result 193 states and 231 transitions. [2020-07-29 03:06:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2020-07-29 03:06:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:37,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:37,110 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 116 states and 136 transitions. [2020-07-29 03:06:37,110 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 116 states and 136 transitions. [2020-07-29 03:06:37,110 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:37,118 INFO L93 Difference]: Finished difference Result 193 states and 231 transitions. [2020-07-29 03:06:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2020-07-29 03:06:37,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:37,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:37,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:37,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-29 03:06:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2020-07-29 03:06:37,125 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 132 transitions. [2020-07-29 03:06:37,125 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 132 transitions. [2020-07-29 03:06:37,125 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:06:37,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 132 transitions. [2020-07-29 03:06:37,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 03:06:37,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:37,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:37,129 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:37,129 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:37,130 INFO L794 eck$LassoCheckResult]: Stem: 13387#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 13368#L37 call main_#t~ret4 := fibo1(main_~x~0);< 13369#fibo1ENTRY ~n := #in~n; 13410#L8 assume !(~n < 1); 13408#L10 assume !(1 == ~n); 13390#L13 call #t~ret0 := fibo2(~n - 1);< 13389#fibo2ENTRY ~n := #in~n; 13391#L18 assume !(~n < 1); 13395#L20 assume !(1 == ~n); 13367#L23 call #t~ret2 := fibo1(~n - 1);< 13358#fibo1ENTRY ~n := #in~n; 13385#L8 assume !(~n < 1); 13366#L10 assume !(1 == ~n); 13357#L13 call #t~ret0 := fibo2(~n - 1);< 13375#fibo2ENTRY ~n := #in~n; 13426#L18 assume !(~n < 1); 13421#L20 assume !(1 == ~n); 13356#L23 call #t~ret2 := fibo1(~n - 1);< 13358#fibo1ENTRY ~n := #in~n; 13385#L8 assume !(~n < 1); 13366#L10 assume !(1 == ~n); 13357#L13 call #t~ret0 := fibo2(~n - 1);< 13375#fibo2ENTRY ~n := #in~n; 13426#L18 assume !(~n < 1); 13421#L20 assume !(1 == ~n); 13356#L23 call #t~ret2 := fibo1(~n - 1);< 13358#fibo1ENTRY ~n := #in~n; 13386#L8 assume !(~n < 1); 13401#L10 assume 1 == ~n;#res := 1; 13402#fibo1FINAL assume true; 13439#fibo1EXIT >#45#return; 13362#L23-1 call #t~ret3 := fibo1(~n - 2);< 13363#fibo1ENTRY ~n := #in~n; 13393#L8 assume ~n < 1;#res := 0; 13365#fibo1FINAL assume true; 13372#fibo1EXIT >#47#return; 13370#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13371#fibo2FINAL assume true; 13392#fibo2EXIT >#49#return; 13360#L13-1 call #t~ret1 := fibo2(~n - 2);< 13422#fibo2ENTRY ~n := #in~n; 13396#L18 assume !(~n < 1); 13394#L20 assume 1 == ~n;#res := 1; 13359#fibo2FINAL assume true; 13361#fibo2EXIT >#51#return; 13419#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13417#fibo1FINAL assume true; 13415#fibo1EXIT >#45#return; 13378#L23-1 [2020-07-29 03:06:37,130 INFO L796 eck$LassoCheckResult]: Loop: 13378#L23-1 call #t~ret3 := fibo1(~n - 2);< 13414#fibo1ENTRY ~n := #in~n; 13451#L8 assume !(~n < 1); 13403#L10 assume !(1 == ~n); 13354#L13 call #t~ret0 := fibo2(~n - 1);< 13400#fibo2ENTRY ~n := #in~n; 13399#L18 assume !(~n < 1); 13397#L20 assume !(1 == ~n); 13352#L23 call #t~ret2 := fibo1(~n - 1);< 13355#fibo1ENTRY ~n := #in~n; 13406#L8 assume !(~n < 1); 13403#L10 assume !(1 == ~n); 13354#L13 call #t~ret0 := fibo2(~n - 1);< 13400#fibo2ENTRY ~n := #in~n; 13399#L18 assume !(~n < 1); 13397#L20 assume !(1 == ~n); 13352#L23 call #t~ret2 := fibo1(~n - 1);< 13355#fibo1ENTRY ~n := #in~n; 13406#L8 assume !(~n < 1); 13403#L10 assume 1 == ~n;#res := 1; 13404#fibo1FINAL assume true; 13437#fibo1EXIT >#45#return; 13413#L23-1 call #t~ret3 := fibo1(~n - 2);< 13435#fibo1ENTRY ~n := #in~n; 13447#L8 assume ~n < 1;#res := 0; 13448#fibo1FINAL assume true; 13434#fibo1EXIT >#47#return; 13432#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 13431#fibo2FINAL assume true; 13428#fibo2EXIT >#49#return; 13424#L13-1 call #t~ret1 := fibo2(~n - 2);< 13425#fibo2ENTRY ~n := #in~n; 13456#L18 assume !(~n < 1); 13454#L20 assume 1 == ~n;#res := 1; 13453#fibo2FINAL assume true; 13423#fibo2EXIT >#51#return; 13420#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 13418#fibo1FINAL assume true; 13416#fibo1EXIT >#45#return; 13378#L23-1 [2020-07-29 03:06:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -167011978, now seen corresponding path program 1 times [2020-07-29 03:06:37,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:37,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110634751] [2020-07-29 03:06:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-07-29 03:06:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,406 INFO L280 TraceCheckUtils]: 3: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,406 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {14243#true} {14243#true} #45#return; {14243#true} is VALID [2020-07-29 03:06:37,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {14243#true} assume ~n < 1;#res := 0; {14243#true} is VALID [2020-07-29 03:06:37,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,411 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14243#true} {14243#true} #47#return; {14243#true} is VALID [2020-07-29 03:06:37,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {14243#true} assume !(1 == ~n); {14243#true} is VALID [2020-07-29 03:06:37,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {14243#true} call #t~ret2 := fibo1(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,413 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {14243#true} {14243#true} #45#return; {14243#true} is VALID [2020-07-29 03:06:37,414 INFO L263 TraceCheckUtils]: 9: Hoare triple {14243#true} call #t~ret3 := fibo1(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {14243#true} assume ~n < 1;#res := 0; {14243#true} is VALID [2020-07-29 03:06:37,415 INFO L280 TraceCheckUtils]: 12: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,415 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {14243#true} {14243#true} #47#return; {14243#true} is VALID [2020-07-29 03:06:37,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {14243#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14243#true} is VALID [2020-07-29 03:06:37,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,417 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #49#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:06:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,425 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #51#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} ~n := #in~n; {14284#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {14284#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {14285#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:37,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {14285#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,430 INFO L280 TraceCheckUtils]: 5: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,430 INFO L280 TraceCheckUtils]: 6: Hoare triple {14243#true} assume !(1 == ~n); {14243#true} is VALID [2020-07-29 03:06:37,430 INFO L263 TraceCheckUtils]: 7: Hoare triple {14243#true} call #t~ret2 := fibo1(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,431 INFO L280 TraceCheckUtils]: 8: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,431 INFO L280 TraceCheckUtils]: 9: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,432 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {14243#true} {14243#true} #45#return; {14243#true} is VALID [2020-07-29 03:06:37,433 INFO L263 TraceCheckUtils]: 13: Hoare triple {14243#true} call #t~ret3 := fibo1(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {14243#true} assume ~n < 1;#res := 0; {14243#true} is VALID [2020-07-29 03:06:37,433 INFO L280 TraceCheckUtils]: 16: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,434 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {14243#true} {14243#true} #47#return; {14243#true} is VALID [2020-07-29 03:06:37,434 INFO L280 TraceCheckUtils]: 18: Hoare triple {14243#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14243#true} is VALID [2020-07-29 03:06:37,434 INFO L280 TraceCheckUtils]: 19: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,436 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #49#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,437 INFO L263 TraceCheckUtils]: 21: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,437 INFO L280 TraceCheckUtils]: 22: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,437 INFO L280 TraceCheckUtils]: 23: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,438 INFO L280 TraceCheckUtils]: 24: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,438 INFO L280 TraceCheckUtils]: 25: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,440 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #51#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,441 INFO L280 TraceCheckUtils]: 27: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,442 INFO L280 TraceCheckUtils]: 28: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} assume true; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,444 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {14286#(<= 2 |fibo1_#in~n|)} {14253#(<= fibo2_~n 2)} #45#return; {14244#false} is VALID [2020-07-29 03:06:37,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {14245#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:37,448 INFO L263 TraceCheckUtils]: 1: Hoare triple {14245#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {14246#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:37,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {14246#(<= |fibo1_#in~n| 5)} ~n := #in~n; {14247#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:37,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {14247#(<= fibo1_~n 5)} assume !(~n < 1); {14247#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:37,451 INFO L280 TraceCheckUtils]: 4: Hoare triple {14247#(<= fibo1_~n 5)} assume !(1 == ~n); {14247#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:37,453 INFO L263 TraceCheckUtils]: 5: Hoare triple {14247#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {14248#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:37,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {14248#(<= |fibo2_#in~n| 4)} ~n := #in~n; {14249#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:37,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {14249#(<= fibo2_~n 4)} assume !(~n < 1); {14249#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:37,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {14249#(<= fibo2_~n 4)} assume !(1 == ~n); {14249#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:37,458 INFO L263 TraceCheckUtils]: 9: Hoare triple {14249#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {14250#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:37,459 INFO L280 TraceCheckUtils]: 10: Hoare triple {14250#(<= |fibo1_#in~n| 3)} ~n := #in~n; {14251#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:37,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {14251#(<= fibo1_~n 3)} assume !(~n < 1); {14251#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:37,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {14251#(<= fibo1_~n 3)} assume !(1 == ~n); {14251#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:37,462 INFO L263 TraceCheckUtils]: 13: Hoare triple {14251#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {14252#(<= |fibo2_#in~n| 2)} is VALID [2020-07-29 03:06:37,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {14252#(<= |fibo2_#in~n| 2)} ~n := #in~n; {14253#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:37,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {14253#(<= fibo2_~n 2)} assume !(~n < 1); {14253#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:37,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {14253#(<= fibo2_~n 2)} assume !(1 == ~n); {14253#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:37,466 INFO L263 TraceCheckUtils]: 17: Hoare triple {14253#(<= fibo2_~n 2)} call #t~ret2 := fibo1(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,467 INFO L280 TraceCheckUtils]: 18: Hoare triple {14243#true} ~n := #in~n; {14284#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,469 INFO L280 TraceCheckUtils]: 19: Hoare triple {14284#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {14285#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-29 03:06:37,470 INFO L280 TraceCheckUtils]: 20: Hoare triple {14285#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,471 INFO L263 TraceCheckUtils]: 21: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,471 INFO L280 TraceCheckUtils]: 22: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,471 INFO L280 TraceCheckUtils]: 23: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,472 INFO L280 TraceCheckUtils]: 24: Hoare triple {14243#true} assume !(1 == ~n); {14243#true} is VALID [2020-07-29 03:06:37,472 INFO L263 TraceCheckUtils]: 25: Hoare triple {14243#true} call #t~ret2 := fibo1(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,473 INFO L280 TraceCheckUtils]: 26: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,473 INFO L280 TraceCheckUtils]: 27: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,473 INFO L280 TraceCheckUtils]: 28: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,473 INFO L280 TraceCheckUtils]: 29: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,474 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {14243#true} {14243#true} #45#return; {14243#true} is VALID [2020-07-29 03:06:37,474 INFO L263 TraceCheckUtils]: 31: Hoare triple {14243#true} call #t~ret3 := fibo1(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,474 INFO L280 TraceCheckUtils]: 32: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,474 INFO L280 TraceCheckUtils]: 33: Hoare triple {14243#true} assume ~n < 1;#res := 0; {14243#true} is VALID [2020-07-29 03:06:37,474 INFO L280 TraceCheckUtils]: 34: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,475 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {14243#true} {14243#true} #47#return; {14243#true} is VALID [2020-07-29 03:06:37,475 INFO L280 TraceCheckUtils]: 36: Hoare triple {14243#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14243#true} is VALID [2020-07-29 03:06:37,475 INFO L280 TraceCheckUtils]: 37: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,477 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #49#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,477 INFO L263 TraceCheckUtils]: 39: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,478 INFO L280 TraceCheckUtils]: 40: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,478 INFO L280 TraceCheckUtils]: 41: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,478 INFO L280 TraceCheckUtils]: 42: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,479 INFO L280 TraceCheckUtils]: 43: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,480 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #51#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,482 INFO L280 TraceCheckUtils]: 45: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,483 INFO L280 TraceCheckUtils]: 46: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} assume true; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,484 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {14286#(<= 2 |fibo1_#in~n|)} {14253#(<= fibo2_~n 2)} #45#return; {14244#false} is VALID [2020-07-29 03:06:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-29 03:06:37,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110634751] [2020-07-29 03:06:37,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730144896] [2020-07-29 03:06:37,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:06:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:37,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {14243#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {14245#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:37,978 INFO L263 TraceCheckUtils]: 1: Hoare triple {14245#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {14246#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:37,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {14246#(<= |fibo1_#in~n| 5)} ~n := #in~n; {14247#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:37,979 INFO L280 TraceCheckUtils]: 3: Hoare triple {14247#(<= fibo1_~n 5)} assume !(~n < 1); {14247#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:37,980 INFO L280 TraceCheckUtils]: 4: Hoare triple {14247#(<= fibo1_~n 5)} assume !(1 == ~n); {14247#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:37,981 INFO L263 TraceCheckUtils]: 5: Hoare triple {14247#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {14248#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:37,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {14248#(<= |fibo2_#in~n| 4)} ~n := #in~n; {14249#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:37,983 INFO L280 TraceCheckUtils]: 7: Hoare triple {14249#(<= fibo2_~n 4)} assume !(~n < 1); {14249#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:37,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {14249#(<= fibo2_~n 4)} assume !(1 == ~n); {14249#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:37,984 INFO L263 TraceCheckUtils]: 9: Hoare triple {14249#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {14250#(<= |fibo1_#in~n| 3)} is VALID [2020-07-29 03:06:37,985 INFO L280 TraceCheckUtils]: 10: Hoare triple {14250#(<= |fibo1_#in~n| 3)} ~n := #in~n; {14251#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:37,985 INFO L280 TraceCheckUtils]: 11: Hoare triple {14251#(<= fibo1_~n 3)} assume !(~n < 1); {14251#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:37,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {14251#(<= fibo1_~n 3)} assume !(1 == ~n); {14251#(<= fibo1_~n 3)} is VALID [2020-07-29 03:06:37,987 INFO L263 TraceCheckUtils]: 13: Hoare triple {14251#(<= fibo1_~n 3)} call #t~ret0 := fibo2(~n - 1); {14252#(<= |fibo2_#in~n| 2)} is VALID [2020-07-29 03:06:37,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {14252#(<= |fibo2_#in~n| 2)} ~n := #in~n; {14253#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:37,988 INFO L280 TraceCheckUtils]: 15: Hoare triple {14253#(<= fibo2_~n 2)} assume !(~n < 1); {14253#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:37,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {14253#(<= fibo2_~n 2)} assume !(1 == ~n); {14253#(<= fibo2_~n 2)} is VALID [2020-07-29 03:06:37,989 INFO L263 TraceCheckUtils]: 17: Hoare triple {14253#(<= fibo2_~n 2)} call #t~ret2 := fibo1(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,990 INFO L280 TraceCheckUtils]: 18: Hoare triple {14243#true} ~n := #in~n; {14375#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {14375#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {14375#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {14375#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {14375#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,991 INFO L263 TraceCheckUtils]: 21: Hoare triple {14375#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,991 INFO L280 TraceCheckUtils]: 22: Hoare triple {14243#true} ~n := #in~n; {14388#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {14388#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {14392#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,993 INFO L280 TraceCheckUtils]: 24: Hoare triple {14392#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {14392#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,993 INFO L263 TraceCheckUtils]: 25: Hoare triple {14392#(<= 1 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {14243#true} is VALID [2020-07-29 03:06:37,993 INFO L280 TraceCheckUtils]: 26: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,993 INFO L280 TraceCheckUtils]: 27: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,993 INFO L280 TraceCheckUtils]: 28: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,994 INFO L280 TraceCheckUtils]: 29: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,995 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {14243#true} {14392#(<= 1 |fibo2_#in~n|)} #45#return; {14392#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,995 INFO L263 TraceCheckUtils]: 31: Hoare triple {14392#(<= 1 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,995 INFO L280 TraceCheckUtils]: 32: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,995 INFO L280 TraceCheckUtils]: 33: Hoare triple {14243#true} assume ~n < 1;#res := 0; {14243#true} is VALID [2020-07-29 03:06:37,995 INFO L280 TraceCheckUtils]: 34: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:37,996 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {14243#true} {14392#(<= 1 |fibo2_#in~n|)} #47#return; {14392#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,997 INFO L280 TraceCheckUtils]: 36: Hoare triple {14392#(<= 1 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14392#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,997 INFO L280 TraceCheckUtils]: 37: Hoare triple {14392#(<= 1 |fibo2_#in~n|)} assume true; {14392#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-29 03:06:37,999 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {14392#(<= 1 |fibo2_#in~n|)} {14375#(<= fibo1_~n |fibo1_#in~n|)} #49#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:37,999 INFO L263 TraceCheckUtils]: 39: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {14243#true} is VALID [2020-07-29 03:06:37,999 INFO L280 TraceCheckUtils]: 40: Hoare triple {14243#true} ~n := #in~n; {14243#true} is VALID [2020-07-29 03:06:37,999 INFO L280 TraceCheckUtils]: 41: Hoare triple {14243#true} assume !(~n < 1); {14243#true} is VALID [2020-07-29 03:06:37,999 INFO L280 TraceCheckUtils]: 42: Hoare triple {14243#true} assume 1 == ~n;#res := 1; {14243#true} is VALID [2020-07-29 03:06:37,999 INFO L280 TraceCheckUtils]: 43: Hoare triple {14243#true} assume true; {14243#true} is VALID [2020-07-29 03:06:38,000 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14243#true} {14286#(<= 2 |fibo1_#in~n|)} #51#return; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:38,001 INFO L280 TraceCheckUtils]: 45: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:38,002 INFO L280 TraceCheckUtils]: 46: Hoare triple {14286#(<= 2 |fibo1_#in~n|)} assume true; {14286#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-29 03:06:38,003 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {14286#(<= 2 |fibo1_#in~n|)} {14253#(<= fibo2_~n 2)} #45#return; {14244#false} is VALID [2020-07-29 03:06:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 03:06:38,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:38,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 16 [2020-07-29 03:06:38,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012225053] [2020-07-29 03:06:38,006 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1468819758, now seen corresponding path program 1 times [2020-07-29 03:06:38,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:38,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540487316] [2020-07-29 03:06:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:38,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:38,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:38,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:38,577 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:38,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:38,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:38,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:38,578 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:06:38,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:38,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:38,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration8_Loop [2020-07-29 03:06:38,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:38,579 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:38,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:38,787 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:38,787 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,793 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,793 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret3=0} Honda state: {fibo2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,818 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret2=2} Honda state: {fibo2_#t~ret2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,843 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,843 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret0=0} Honda state: {fibo1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:06:38,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,865 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,867 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,867 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,892 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,892 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,917 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,917 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret1=0} Honda state: {fibo1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,940 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,941 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:38,965 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:06:38,965 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:38,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:38,988 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:39,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:06:39,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:40,418 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:06:40,419 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:40,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:40,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:40,420 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:40,420 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:06:40,420 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,420 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:40,420 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:40,420 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration8_Loop [2020-07-29 03:06:40,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:40,420 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:40,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:40,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:40,612 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:40,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:40,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:40,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:40,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:40,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:40,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:40,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:40,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:06:40,831 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:06:40,831 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:40,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:06:40,836 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:06:40,836 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:06:40,837 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2020-07-29 03:06:40,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:06:40,860 INFO L393 LassoCheck]: Loop: "call #t~ret3 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#45#return;" "call #t~ret3 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#47#return;" "#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3;" "assume true;" >"#49#return;" "call #t~ret1 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#51#return;" "#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1;" "assume true;" >"#45#return;" [2020-07-29 03:06:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:40,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-29 03:06:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:40,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:41,003 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:41,022 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:41,026 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:41,033 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:41,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {14464#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {14464#unseeded} is VALID [2020-07-29 03:06:41,038 INFO L263 TraceCheckUtils]: 1: Hoare triple {14464#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {14464#unseeded} is VALID [2020-07-29 03:06:41,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:41,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:41,040 INFO L263 TraceCheckUtils]: 5: Hoare triple {14464#unseeded} call #t~ret0 := fibo2(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:41,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:41,043 INFO L263 TraceCheckUtils]: 9: Hoare triple {14464#unseeded} call #t~ret2 := fibo1(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:41,044 INFO L280 TraceCheckUtils]: 11: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,045 INFO L280 TraceCheckUtils]: 12: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:41,045 INFO L263 TraceCheckUtils]: 13: Hoare triple {14464#unseeded} call #t~ret0 := fibo2(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,046 INFO L280 TraceCheckUtils]: 14: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:41,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:41,047 INFO L280 TraceCheckUtils]: 16: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:41,048 INFO L263 TraceCheckUtils]: 17: Hoare triple {14464#unseeded} call #t~ret2 := fibo1(~n - 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,049 INFO L280 TraceCheckUtils]: 18: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,049 INFO L280 TraceCheckUtils]: 19: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,050 INFO L280 TraceCheckUtils]: 20: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,051 INFO L263 TraceCheckUtils]: 21: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibo2(~n - 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,051 INFO L280 TraceCheckUtils]: 22: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,052 INFO L280 TraceCheckUtils]: 23: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,053 INFO L280 TraceCheckUtils]: 24: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,054 INFO L263 TraceCheckUtils]: 25: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,055 INFO L280 TraceCheckUtils]: 27: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,055 INFO L280 TraceCheckUtils]: 28: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,058 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,059 INFO L263 TraceCheckUtils]: 31: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,060 INFO L280 TraceCheckUtils]: 32: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,060 INFO L280 TraceCheckUtils]: 33: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,061 INFO L280 TraceCheckUtils]: 34: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,062 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,065 INFO L280 TraceCheckUtils]: 36: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,066 INFO L280 TraceCheckUtils]: 37: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,068 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #49#return; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,069 INFO L263 TraceCheckUtils]: 39: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibo2(~n - 2); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,069 INFO L280 TraceCheckUtils]: 40: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,070 INFO L280 TraceCheckUtils]: 41: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,070 INFO L280 TraceCheckUtils]: 42: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,071 INFO L280 TraceCheckUtils]: 43: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,072 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #51#return; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,073 INFO L280 TraceCheckUtils]: 45: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,074 INFO L280 TraceCheckUtils]: 46: Hoare triple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:41,075 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {14533#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14464#unseeded} #45#return; {14464#unseeded} is VALID [2020-07-29 03:06:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:41,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-29 03:06:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:41,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:41,983 INFO L263 TraceCheckUtils]: 0: Hoare triple {14467#(>= oldRank0 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {14624#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:41,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {14624#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {14628#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:41,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {14628#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {14628#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:41,985 INFO L280 TraceCheckUtils]: 3: Hoare triple {14628#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {14628#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:41,986 INFO L263 TraceCheckUtils]: 4: Hoare triple {14628#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret0 := fibo2(~n - 1); {14638#(<= (+ |fibo2_#in~n| 3) oldRank0)} is VALID [2020-07-29 03:06:41,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {14638#(<= (+ |fibo2_#in~n| 3) oldRank0)} ~n := #in~n; {14642#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:41,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {14642#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {14642#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:41,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {14642#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {14642#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:41,988 INFO L263 TraceCheckUtils]: 8: Hoare triple {14642#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret2 := fibo1(~n - 1); {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,990 INFO L263 TraceCheckUtils]: 12: Hoare triple {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := fibo2(~n - 1); {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,992 INFO L263 TraceCheckUtils]: 16: Hoare triple {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := fibo1(~n - 1); {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {14685#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {14685#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {14685#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {14685#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {14685#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:41,995 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {14685#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {14669#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #45#return; {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:41,996 INFO L263 TraceCheckUtils]: 22: Hoare triple {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} assume true; {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:41,998 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {14652#(<= |old(oldRank0)| oldRank0)} {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #47#return; {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:41,999 INFO L280 TraceCheckUtils]: 27: Hoare triple {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:41,999 INFO L280 TraceCheckUtils]: 28: Hoare triple {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} assume true; {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:42,001 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {14695#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} {14656#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} #49#return; {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:42,004 INFO L263 TraceCheckUtils]: 30: Hoare triple {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} call #t~ret1 := fibo2(~n - 2); {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:42,005 INFO L280 TraceCheckUtils]: 31: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:42,005 INFO L280 TraceCheckUtils]: 32: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:42,006 INFO L280 TraceCheckUtils]: 33: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:42,006 INFO L280 TraceCheckUtils]: 34: Hoare triple {14652#(<= |old(oldRank0)| oldRank0)} assume true; {14652#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:42,007 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {14652#(<= |old(oldRank0)| oldRank0)} {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} #51#return; {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:42,008 INFO L280 TraceCheckUtils]: 36: Hoare triple {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:42,009 INFO L280 TraceCheckUtils]: 37: Hoare triple {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} assume true; {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:42,010 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {14720#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} {14642#(<= (+ fibo2_~n 3) oldRank0)} #45#return; {14477#(or (and (> oldRank0 fibo2_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-29 03:06:42,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:06:42,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:42,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,111 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2020-07-29 03:06:42,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 132 transitions. cyclomatic complexity: 22 Second operand 13 states. [2020-07-29 03:06:42,590 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 132 transitions. cyclomatic complexity: 22. Second operand 13 states. Result 136 states and 158 transitions. Complement of second has 13 states. [2020-07-29 03:06:42,590 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 [2020-07-29 03:06:42,590 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:42,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 132 transitions. cyclomatic complexity: 22 [2020-07-29 03:06:42,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:42,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:42,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 03:06:42,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:42,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:42,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 158 transitions. [2020-07-29 03:06:42,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 03:06:42,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:42,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:42,596 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 132 transitions. cyclomatic complexity: 22 [2020-07-29 03:06:42,599 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:42,599 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 03:06:42,600 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:42,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 31 transitions. cyclomatic complexity: 29 [2020-07-29 03:06:42,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:42,601 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:06:42,601 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 158 transitions. cyclomatic complexity: 24 [2020-07-29 03:06:42,604 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:42,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:06:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:06:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:06:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:42,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:42,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:42,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:42,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:42,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:42,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:42,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:42,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:42,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:42,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:42,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:42,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:42,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:42,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:42,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:42,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:42,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:42,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:42,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:42,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:42,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:42,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:42,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:42,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:42,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:42,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:42,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 41 letters. Loop has 39 letters. [2020-07-29 03:06:42,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 41 letters. Loop has 39 letters. [2020-07-29 03:06:42,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 39 letters. [2020-07-29 03:06:42,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 42 letters. Loop has 39 letters. [2020-07-29 03:06:42,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 42 letters. Loop has 39 letters. [2020-07-29 03:06:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 42 letters. Loop has 39 letters. [2020-07-29 03:06:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:42,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:42,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:42,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:42,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,638 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 03:06:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-29 03:06:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:42,640 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:06:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:42,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-29 03:06:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:42,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:42,774 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:42,782 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:42,788 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:42,805 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:42,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {14464#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {14464#unseeded} is VALID [2020-07-29 03:06:42,810 INFO L263 TraceCheckUtils]: 1: Hoare triple {14464#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {14464#unseeded} is VALID [2020-07-29 03:06:42,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:42,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:42,812 INFO L263 TraceCheckUtils]: 5: Hoare triple {14464#unseeded} call #t~ret0 := fibo2(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:42,814 INFO L280 TraceCheckUtils]: 7: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:42,815 INFO L263 TraceCheckUtils]: 9: Hoare triple {14464#unseeded} call #t~ret2 := fibo1(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,819 INFO L280 TraceCheckUtils]: 10: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:42,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,820 INFO L280 TraceCheckUtils]: 12: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:42,821 INFO L263 TraceCheckUtils]: 13: Hoare triple {14464#unseeded} call #t~ret0 := fibo2(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,822 INFO L280 TraceCheckUtils]: 14: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:42,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:42,823 INFO L280 TraceCheckUtils]: 16: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:42,824 INFO L263 TraceCheckUtils]: 17: Hoare triple {14464#unseeded} call #t~ret2 := fibo1(~n - 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,825 INFO L280 TraceCheckUtils]: 18: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,825 INFO L280 TraceCheckUtils]: 19: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,826 INFO L280 TraceCheckUtils]: 20: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,827 INFO L263 TraceCheckUtils]: 21: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibo2(~n - 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,828 INFO L280 TraceCheckUtils]: 22: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,828 INFO L280 TraceCheckUtils]: 23: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,829 INFO L280 TraceCheckUtils]: 24: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,830 INFO L263 TraceCheckUtils]: 25: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,830 INFO L280 TraceCheckUtils]: 26: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,831 INFO L280 TraceCheckUtils]: 27: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,832 INFO L280 TraceCheckUtils]: 28: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,832 INFO L280 TraceCheckUtils]: 29: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,834 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,835 INFO L263 TraceCheckUtils]: 31: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,836 INFO L280 TraceCheckUtils]: 32: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,837 INFO L280 TraceCheckUtils]: 33: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,837 INFO L280 TraceCheckUtils]: 34: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,839 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,840 INFO L280 TraceCheckUtils]: 36: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,841 INFO L280 TraceCheckUtils]: 37: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,842 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #49#return; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,843 INFO L263 TraceCheckUtils]: 39: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibo2(~n - 2); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,844 INFO L280 TraceCheckUtils]: 40: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,845 INFO L280 TraceCheckUtils]: 41: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,845 INFO L280 TraceCheckUtils]: 42: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,846 INFO L280 TraceCheckUtils]: 43: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,848 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #51#return; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,849 INFO L280 TraceCheckUtils]: 45: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,849 INFO L280 TraceCheckUtils]: 46: Hoare triple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:42,851 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {14962#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14464#unseeded} #45#return; {14464#unseeded} is VALID [2020-07-29 03:06:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:42,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-29 03:06:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:42,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:43,691 INFO L263 TraceCheckUtils]: 0: Hoare triple {14467#(>= oldRank0 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {15053#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:43,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {15053#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {15057#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:43,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {15057#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {15057#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:43,694 INFO L280 TraceCheckUtils]: 3: Hoare triple {15057#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {15057#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:43,695 INFO L263 TraceCheckUtils]: 4: Hoare triple {15057#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret0 := fibo2(~n - 1); {15067#(<= (+ |fibo2_#in~n| 3) oldRank0)} is VALID [2020-07-29 03:06:43,696 INFO L280 TraceCheckUtils]: 5: Hoare triple {15067#(<= (+ |fibo2_#in~n| 3) oldRank0)} ~n := #in~n; {15071#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:43,696 INFO L280 TraceCheckUtils]: 6: Hoare triple {15071#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {15071#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:43,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {15071#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {15071#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:43,697 INFO L263 TraceCheckUtils]: 8: Hoare triple {15071#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret2 := fibo1(~n - 1); {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,698 INFO L280 TraceCheckUtils]: 9: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,699 INFO L280 TraceCheckUtils]: 10: Hoare triple {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,699 INFO L280 TraceCheckUtils]: 11: Hoare triple {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,701 INFO L263 TraceCheckUtils]: 12: Hoare triple {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := fibo2(~n - 1); {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,701 INFO L280 TraceCheckUtils]: 13: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,702 INFO L280 TraceCheckUtils]: 14: Hoare triple {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,702 INFO L280 TraceCheckUtils]: 15: Hoare triple {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,703 INFO L263 TraceCheckUtils]: 16: Hoare triple {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := fibo1(~n - 1); {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {15114#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {15114#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {15114#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,705 INFO L280 TraceCheckUtils]: 20: Hoare triple {15114#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {15114#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:43,706 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {15114#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {15098#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #45#return; {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:43,707 INFO L263 TraceCheckUtils]: 22: Hoare triple {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,707 INFO L280 TraceCheckUtils]: 23: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,708 INFO L280 TraceCheckUtils]: 24: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,708 INFO L280 TraceCheckUtils]: 25: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} assume true; {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,710 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {15081#(<= |old(oldRank0)| oldRank0)} {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #47#return; {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:43,710 INFO L280 TraceCheckUtils]: 27: Hoare triple {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:43,711 INFO L280 TraceCheckUtils]: 28: Hoare triple {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} assume true; {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:43,712 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {15124#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} {15085#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} #49#return; {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:43,713 INFO L263 TraceCheckUtils]: 30: Hoare triple {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} call #t~ret1 := fibo2(~n - 2); {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,713 INFO L280 TraceCheckUtils]: 31: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,713 INFO L280 TraceCheckUtils]: 32: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,714 INFO L280 TraceCheckUtils]: 33: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,714 INFO L280 TraceCheckUtils]: 34: Hoare triple {15081#(<= |old(oldRank0)| oldRank0)} assume true; {15081#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:43,716 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {15081#(<= |old(oldRank0)| oldRank0)} {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} #51#return; {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:43,717 INFO L280 TraceCheckUtils]: 36: Hoare triple {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:43,717 INFO L280 TraceCheckUtils]: 37: Hoare triple {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} assume true; {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:43,718 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {15149#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} {15071#(<= (+ fibo2_~n 3) oldRank0)} #45#return; {14477#(or (and (> oldRank0 fibo2_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-29 03:06:43,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:06:43,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:43,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2020-07-29 03:06:43,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 132 transitions. cyclomatic complexity: 22 Second operand 13 states. [2020-07-29 03:06:44,261 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 132 transitions. cyclomatic complexity: 22. Second operand 13 states. Result 136 states and 158 transitions. Complement of second has 13 states. [2020-07-29 03:06:44,261 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 [2020-07-29 03:06:44,261 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:44,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 132 transitions. cyclomatic complexity: 22 [2020-07-29 03:06:44,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:44,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:44,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 03:06:44,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:44,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:44,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 158 transitions. [2020-07-29 03:06:44,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 03:06:44,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:44,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:44,266 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 132 transitions. cyclomatic complexity: 22 [2020-07-29 03:06:44,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:44,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 03:06:44,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:44,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 31 transitions. cyclomatic complexity: 29 [2020-07-29 03:06:44,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:44,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:06:44,269 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 158 transitions. cyclomatic complexity: 24 [2020-07-29 03:06:44,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:06:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:06:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 136 letters. Loop has 136 letters. [2020-07-29 03:06:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:44,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:06:44,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:44,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:44,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:44,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:44,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:44,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:44,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:44,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:44,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:44,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:44,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:44,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:44,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:44,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:44,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:44,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:44,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:44,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:44,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:44,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:44,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:44,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:44,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:44,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:44,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:44,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:44,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:44,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:44,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:44,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:44,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:44,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:44,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:44,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:44,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 47 letters. Loop has 8 letters. [2020-07-29 03:06:44,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:44,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:44,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 8 letters. [2020-07-29 03:06:44,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 41 letters. Loop has 39 letters. [2020-07-29 03:06:44,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 41 letters. Loop has 39 letters. [2020-07-29 03:06:44,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 39 letters. [2020-07-29 03:06:44,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 42 letters. Loop has 39 letters. [2020-07-29 03:06:44,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 42 letters. Loop has 39 letters. [2020-07-29 03:06:44,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 42 letters. Loop has 39 letters. [2020-07-29 03:06:44,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:44,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:44,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 49 letters. Loop has 8 letters. [2020-07-29 03:06:44,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:44,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:44,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 43 letters. Loop has 8 letters. [2020-07-29 03:06:44,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:44,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:44,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:06:44,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:44,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:44,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 44 letters. Loop has 8 letters. [2020-07-29 03:06:44,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:44,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:44,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 45 letters. Loop has 8 letters. [2020-07-29 03:06:44,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:44,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:44,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 46 letters. Loop has 8 letters. [2020-07-29 03:06:44,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:44,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:44,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 158 transitions. cyclomatic complexity: 24 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:44,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,306 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 03:06:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-29 03:06:44,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:44,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:44,308 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:06:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:44,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-29 03:06:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:44,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:44,433 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:44,446 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:44,453 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:44,460 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:44,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {14464#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {14464#unseeded} is VALID [2020-07-29 03:06:44,471 INFO L263 TraceCheckUtils]: 1: Hoare triple {14464#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {14464#unseeded} is VALID [2020-07-29 03:06:44,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:44,472 INFO L280 TraceCheckUtils]: 3: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:44,474 INFO L263 TraceCheckUtils]: 5: Hoare triple {14464#unseeded} call #t~ret0 := fibo2(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:44,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,475 INFO L280 TraceCheckUtils]: 8: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:44,476 INFO L263 TraceCheckUtils]: 9: Hoare triple {14464#unseeded} call #t~ret2 := fibo1(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:44,478 INFO L280 TraceCheckUtils]: 11: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:44,479 INFO L263 TraceCheckUtils]: 13: Hoare triple {14464#unseeded} call #t~ret0 := fibo2(~n - 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,480 INFO L280 TraceCheckUtils]: 14: Hoare triple {14464#unseeded} ~n := #in~n; {14464#unseeded} is VALID [2020-07-29 03:06:44,480 INFO L280 TraceCheckUtils]: 15: Hoare triple {14464#unseeded} assume !(~n < 1); {14464#unseeded} is VALID [2020-07-29 03:06:44,481 INFO L280 TraceCheckUtils]: 16: Hoare triple {14464#unseeded} assume !(1 == ~n); {14464#unseeded} is VALID [2020-07-29 03:06:44,482 INFO L263 TraceCheckUtils]: 17: Hoare triple {14464#unseeded} call #t~ret2 := fibo1(~n - 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,483 INFO L280 TraceCheckUtils]: 18: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,483 INFO L280 TraceCheckUtils]: 19: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,484 INFO L280 TraceCheckUtils]: 20: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,485 INFO L263 TraceCheckUtils]: 21: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibo2(~n - 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,486 INFO L280 TraceCheckUtils]: 22: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,486 INFO L280 TraceCheckUtils]: 23: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,487 INFO L280 TraceCheckUtils]: 24: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,488 INFO L263 TraceCheckUtils]: 25: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,489 INFO L280 TraceCheckUtils]: 26: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,489 INFO L280 TraceCheckUtils]: 27: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,490 INFO L280 TraceCheckUtils]: 28: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,491 INFO L280 TraceCheckUtils]: 29: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,492 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,494 INFO L263 TraceCheckUtils]: 31: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,494 INFO L280 TraceCheckUtils]: 32: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,495 INFO L280 TraceCheckUtils]: 33: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,496 INFO L280 TraceCheckUtils]: 34: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,497 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,498 INFO L280 TraceCheckUtils]: 36: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,499 INFO L280 TraceCheckUtils]: 37: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,500 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #49#return; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,501 INFO L263 TraceCheckUtils]: 39: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibo2(~n - 2); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,502 INFO L280 TraceCheckUtils]: 40: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,503 INFO L280 TraceCheckUtils]: 41: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,503 INFO L280 TraceCheckUtils]: 42: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,504 INFO L280 TraceCheckUtils]: 43: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,506 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #51#return; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,507 INFO L280 TraceCheckUtils]: 45: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,507 INFO L280 TraceCheckUtils]: 46: Hoare triple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:44,509 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {15391#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14464#unseeded} #45#return; {14464#unseeded} is VALID [2020-07-29 03:06:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:44,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-29 03:06:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:44,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:45,421 INFO L263 TraceCheckUtils]: 0: Hoare triple {14467#(>= oldRank0 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {15482#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:45,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {15482#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {15486#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:45,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {15486#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {15486#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:45,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {15486#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {15486#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:45,424 INFO L263 TraceCheckUtils]: 4: Hoare triple {15486#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret0 := fibo2(~n - 1); {15496#(<= (+ |fibo2_#in~n| 3) oldRank0)} is VALID [2020-07-29 03:06:45,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {15496#(<= (+ |fibo2_#in~n| 3) oldRank0)} ~n := #in~n; {15500#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:45,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {15500#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {15500#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:45,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {15500#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {15500#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2020-07-29 03:06:45,426 INFO L263 TraceCheckUtils]: 8: Hoare triple {15500#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret2 := fibo1(~n - 1); {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,427 INFO L280 TraceCheckUtils]: 10: Hoare triple {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,428 INFO L280 TraceCheckUtils]: 11: Hoare triple {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,428 INFO L263 TraceCheckUtils]: 12: Hoare triple {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := fibo2(~n - 1); {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,430 INFO L263 TraceCheckUtils]: 16: Hoare triple {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := fibo1(~n - 1); {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,432 INFO L280 TraceCheckUtils]: 18: Hoare triple {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {15543#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,432 INFO L280 TraceCheckUtils]: 19: Hoare triple {15543#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {15543#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {15543#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {15543#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 03:06:45,434 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {15543#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {15527#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} #45#return; {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:45,435 INFO L263 TraceCheckUtils]: 22: Hoare triple {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,435 INFO L280 TraceCheckUtils]: 23: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,436 INFO L280 TraceCheckUtils]: 24: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,437 INFO L280 TraceCheckUtils]: 25: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} assume true; {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,438 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {15510#(<= |old(oldRank0)| oldRank0)} {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #47#return; {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:45,438 INFO L280 TraceCheckUtils]: 27: Hoare triple {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:45,439 INFO L280 TraceCheckUtils]: 28: Hoare triple {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} assume true; {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} is VALID [2020-07-29 03:06:45,440 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {15553#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibo2_#in~n|))} {15514#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} #49#return; {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:45,441 INFO L263 TraceCheckUtils]: 30: Hoare triple {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} call #t~ret1 := fibo2(~n - 2); {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,442 INFO L280 TraceCheckUtils]: 31: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,443 INFO L280 TraceCheckUtils]: 32: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,443 INFO L280 TraceCheckUtils]: 33: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,444 INFO L280 TraceCheckUtils]: 34: Hoare triple {15510#(<= |old(oldRank0)| oldRank0)} assume true; {15510#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:06:45,445 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {15510#(<= |old(oldRank0)| oldRank0)} {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} #51#return; {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:45,445 INFO L280 TraceCheckUtils]: 36: Hoare triple {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:45,446 INFO L280 TraceCheckUtils]: 37: Hoare triple {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} assume true; {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} is VALID [2020-07-29 03:06:45,447 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {15578#(and (<= |old(oldRank0)| oldRank0) (<= 3 |fibo1_#in~n|))} {15500#(<= (+ fibo2_~n 3) oldRank0)} #45#return; {14477#(or (and (> oldRank0 fibo2_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-29 03:06:45,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:06:45,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:45,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:45,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:45,546 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 11 loop predicates [2020-07-29 03:06:45,546 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 132 transitions. cyclomatic complexity: 22 Second operand 13 states. [2020-07-29 03:06:47,306 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 132 transitions. cyclomatic complexity: 22. Second operand 13 states. Result 553 states and 682 transitions. Complement of second has 139 states. [2020-07-29 03:06:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2020-07-29 03:06:47,306 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:47,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 132 transitions. cyclomatic complexity: 22 [2020-07-29 03:06:47,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:47,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:47,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 03:06:47,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:06:47,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:47,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:47,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 682 transitions. [2020-07-29 03:06:47,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-07-29 03:06:47,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:47,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:47,317 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 132 transitions. cyclomatic complexity: 22 [2020-07-29 03:06:47,317 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:06:47,317 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 03:06:47,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:06:47,319 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:47,320 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 553 states and 682 transitions. cyclomatic complexity: 134 [2020-07-29 03:06:47,326 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 22 examples of accepted words. [2020-07-29 03:06:47,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:47,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:47,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:47,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 553 letters. Loop has 553 letters. [2020-07-29 03:06:47,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 553 letters. Loop has 553 letters. [2020-07-29 03:06:47,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 553 letters. Loop has 553 letters. [2020-07-29 03:06:47,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:47,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:47,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 112 letters. Loop has 112 letters. [2020-07-29 03:06:47,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:06:47,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:06:47,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:06:47,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:47,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:47,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:47,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:47,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:47,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 49 letters. Loop has 39 letters. [2020-07-29 03:06:47,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:47,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:47,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:47,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:47,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:47,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:47,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:47,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:47,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:47,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:47,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:47,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 51 letters. Loop has 8 letters. [2020-07-29 03:06:47,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:47,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:47,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 50 letters. Loop has 39 letters. [2020-07-29 03:06:47,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:47,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:47,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:47,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:47,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:47,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 48 letters. Loop has 64 letters. [2020-07-29 03:06:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 3 letters. Loop has 6 letters. [2020-07-29 03:06:47,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 98 letters. Loop has 47 letters. [2020-07-29 03:06:47,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 98 letters. Loop has 47 letters. [2020-07-29 03:06:47,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 98 letters. Loop has 47 letters. [2020-07-29 03:06:47,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 99 letters. Loop has 47 letters. [2020-07-29 03:06:47,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 99 letters. Loop has 47 letters. [2020-07-29 03:06:47,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 99 letters. Loop has 47 letters. [2020-07-29 03:06:47,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:47,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:47,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:47,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:47,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:47,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:47,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:47,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:47,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:47,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 60 letters. Loop has 8 letters. [2020-07-29 03:06:47,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 60 letters. Loop has 8 letters. [2020-07-29 03:06:47,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 60 letters. Loop has 8 letters. [2020-07-29 03:06:47,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:47,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:47,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:47,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 96 letters. Loop has 47 letters. [2020-07-29 03:06:47,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 96 letters. Loop has 47 letters. [2020-07-29 03:06:47,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 96 letters. Loop has 47 letters. [2020-07-29 03:06:47,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:47,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:47,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:47,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 87 letters. Loop has 47 letters. [2020-07-29 03:06:47,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 87 letters. Loop has 47 letters. [2020-07-29 03:06:47,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 87 letters. Loop has 47 letters. [2020-07-29 03:06:47,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:47,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:47,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:47,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 97 letters. Loop has 47 letters. [2020-07-29 03:06:47,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 97 letters. Loop has 47 letters. [2020-07-29 03:06:47,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 97 letters. Loop has 47 letters. [2020-07-29 03:06:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 87 letters. Loop has 47 letters. [2020-07-29 03:06:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 87 letters. Loop has 47 letters. [2020-07-29 03:06:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 87 letters. Loop has 47 letters. [2020-07-29 03:06:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 82 letters. Loop has 8 letters. [2020-07-29 03:06:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 82 letters. Loop has 8 letters. [2020-07-29 03:06:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 82 letters. Loop has 8 letters. [2020-07-29 03:06:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 75 letters. Loop has 8 letters. [2020-07-29 03:06:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 75 letters. Loop has 8 letters. [2020-07-29 03:06:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 75 letters. Loop has 8 letters. [2020-07-29 03:06:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 76 letters. Loop has 8 letters. [2020-07-29 03:06:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 76 letters. Loop has 8 letters. [2020-07-29 03:06:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 76 letters. Loop has 8 letters. [2020-07-29 03:06:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 77 letters. Loop has 8 letters. [2020-07-29 03:06:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 77 letters. Loop has 8 letters. [2020-07-29 03:06:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 77 letters. Loop has 8 letters. [2020-07-29 03:06:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 78 letters. Loop has 8 letters. [2020-07-29 03:06:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 78 letters. Loop has 8 letters. [2020-07-29 03:06:47,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 78 letters. Loop has 8 letters. [2020-07-29 03:06:47,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 79 letters. Loop has 8 letters. [2020-07-29 03:06:47,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 79 letters. Loop has 8 letters. [2020-07-29 03:06:47,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 79 letters. Loop has 8 letters. [2020-07-29 03:06:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 80 letters. Loop has 8 letters. [2020-07-29 03:06:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 80 letters. Loop has 8 letters. [2020-07-29 03:06:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 80 letters. Loop has 8 letters. [2020-07-29 03:06:47,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 132 transitions. cyclomatic complexity: 22 Stem has 81 letters. Loop has 8 letters. [2020-07-29 03:06:47,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 81 letters. Loop has 8 letters. [2020-07-29 03:06:47,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 553 states and 682 transitions. cyclomatic complexity: 134 Stem has 81 letters. Loop has 8 letters. [2020-07-29 03:06:47,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,387 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 03:06:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2020-07-29 03:06:47,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 48 letters. Loop has 39 letters. [2020-07-29 03:06:47,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:06:47,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 48 letters. Loop has 78 letters. [2020-07-29 03:06:47,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:47,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 682 transitions. cyclomatic complexity: 134 [2020-07-29 03:06:47,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2020-07-29 03:06:47,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 396 states and 489 transitions. [2020-07-29 03:06:47,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2020-07-29 03:06:47,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2020-07-29 03:06:47,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 396 states and 489 transitions. [2020-07-29 03:06:47,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:47,438 INFO L688 BuchiCegarLoop]: Abstraction has 396 states and 489 transitions. [2020-07-29 03:06:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states and 489 transitions. [2020-07-29 03:06:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 324. [2020-07-29 03:06:47,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:47,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states and 489 transitions. Second operand 324 states. [2020-07-29 03:06:47,448 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states and 489 transitions. Second operand 324 states. [2020-07-29 03:06:47,448 INFO L87 Difference]: Start difference. First operand 396 states and 489 transitions. Second operand 324 states. [2020-07-29 03:06:47,449 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:47,523 INFO L93 Difference]: Finished difference Result 916 states and 1118 transitions. [2020-07-29 03:06:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1118 transitions. [2020-07-29 03:06:47,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:47,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:47,528 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand 396 states and 489 transitions. [2020-07-29 03:06:47,528 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 396 states and 489 transitions. [2020-07-29 03:06:47,529 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:47,615 INFO L93 Difference]: Finished difference Result 962 states and 1180 transitions. [2020-07-29 03:06:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1180 transitions. [2020-07-29 03:06:47,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:47,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:47,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:47,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-07-29 03:06:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 392 transitions. [2020-07-29 03:06:47,637 INFO L711 BuchiCegarLoop]: Abstraction has 324 states and 392 transitions. [2020-07-29 03:06:47,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 03:06:47,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-07-29 03:06:47,638 INFO L87 Difference]: Start difference. First operand 324 states and 392 transitions. Second operand 17 states. [2020-07-29 03:06:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:48,854 INFO L93 Difference]: Finished difference Result 239 states and 257 transitions. [2020-07-29 03:06:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-29 03:06:48,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 03:06:48,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:48,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 257 transitions. [2020-07-29 03:06:48,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-07-29 03:06:48,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 116 states and 122 transitions. [2020-07-29 03:06:48,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2020-07-29 03:06:48,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-07-29 03:06:48,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 122 transitions. [2020-07-29 03:06:48,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:48,962 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 122 transitions. [2020-07-29 03:06:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 122 transitions. [2020-07-29 03:06:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2020-07-29 03:06:48,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:48,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 122 transitions. Second operand 115 states. [2020-07-29 03:06:48,966 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 122 transitions. Second operand 115 states. [2020-07-29 03:06:48,966 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 115 states. [2020-07-29 03:06:48,967 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:48,972 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2020-07-29 03:06:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2020-07-29 03:06:48,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:48,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:48,973 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 116 states and 122 transitions. [2020-07-29 03:06:48,973 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 116 states and 122 transitions. [2020-07-29 03:06:48,975 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:48,981 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2020-07-29 03:06:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2020-07-29 03:06:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:48,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:48,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:48,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-29 03:06:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2020-07-29 03:06:48,985 INFO L711 BuchiCegarLoop]: Abstraction has 115 states and 121 transitions. [2020-07-29 03:06:48,985 INFO L591 BuchiCegarLoop]: Abstraction has 115 states and 121 transitions. [2020-07-29 03:06:48,985 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:06:48,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 121 transitions. [2020-07-29 03:06:48,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-07-29 03:06:48,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:48,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:48,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:48,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:06:48,988 INFO L794 eck$LassoCheckResult]: Stem: 20262#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; 20236#L37 call main_#t~ret4 := fibo1(main_~x~0);< 20243#fibo1ENTRY ~n := #in~n; 20273#L8 assume !(~n < 1); 20235#L10 assume !(1 == ~n); 20237#L13 call #t~ret0 := fibo2(~n - 1);< 20264#fibo2ENTRY ~n := #in~n; 20265#L18 assume !(~n < 1); 20270#L20 assume !(1 == ~n); 20248#L23 call #t~ret2 := fibo1(~n - 1);< 20233#fibo1ENTRY ~n := #in~n; 20260#L8 assume !(~n < 1); 20268#L10 assume !(1 == ~n); 20232#L13 call #t~ret0 := fibo2(~n - 1);< 20249#fibo2ENTRY ~n := #in~n; 20271#L18 assume !(~n < 1); 20272#L20 assume !(1 == ~n); 20231#L23 call #t~ret2 := fibo1(~n - 1);< 20233#fibo1ENTRY ~n := #in~n; 20261#L8 assume !(~n < 1); 20304#L10 assume 1 == ~n;#res := 1; 20303#fibo1FINAL assume true; 20300#fibo1EXIT >#45#return; 20298#L23-1 call #t~ret3 := fibo1(~n - 2);< 20299#fibo1ENTRY ~n := #in~n; 20302#L8 assume ~n < 1;#res := 0; 20301#fibo1FINAL assume true; 20297#fibo1EXIT >#47#return; 20296#L23-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 20295#fibo2FINAL assume true; 20293#fibo2EXIT >#49#return; 20289#L13-1 call #t~ret1 := fibo2(~n - 2);< 20290#fibo2ENTRY ~n := #in~n; 20294#L18 assume !(~n < 1); 20292#L20 assume 1 == ~n;#res := 1; 20291#fibo2FINAL assume true; 20288#fibo2EXIT >#51#return; 20287#L13-2 #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; 20286#fibo1FINAL assume true; 20285#fibo1EXIT >#45#return; 20255#L23-1 call #t~ret3 := fibo1(~n - 2);< 20284#fibo1ENTRY ~n := #in~n; 20318#L8 assume !(~n < 1); 20316#L10 assume !(1 == ~n); 20239#L13 call #t~ret0 := fibo2(~n - 1);< 20313#fibo2ENTRY ~n := #in~n; 20330#L18 assume !(~n < 1); 20329#L20 assume !(1 == ~n); 20246#L23 call #t~ret2 := fibo1(~n - 1);< 20258#fibo1ENTRY ~n := #in~n; 20259#L8 assume !(~n < 1); 20267#L10 assume !(1 == ~n); 20229#L13 [2020-07-29 03:06:48,989 INFO L796 eck$LassoCheckResult]: Loop: 20229#L13 call #t~ret0 := fibo2(~n - 1);< 20247#fibo2ENTRY ~n := #in~n; 20263#L18 assume !(~n < 1); 20269#L20 assume !(1 == ~n); 20228#L23 call #t~ret2 := fibo1(~n - 1);< 20230#fibo1ENTRY ~n := #in~n; 20342#L8 assume !(~n < 1); 20234#L10 assume !(1 == ~n); 20229#L13 [2020-07-29 03:06:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1751159525, now seen corresponding path program 2 times [2020-07-29 03:06:48,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:48,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130226814] [2020-07-29 03:06:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:06:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,182 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20996#true} {20996#true} #45#return; {20996#true} is VALID [2020-07-29 03:06:49,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:06:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {20996#true} assume ~n < 1;#res := 0; {20996#true} is VALID [2020-07-29 03:06:49,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,187 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20996#true} {20996#true} #47#return; {20996#true} is VALID [2020-07-29 03:06:49,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,188 INFO L263 TraceCheckUtils]: 3: Hoare triple {20996#true} call #t~ret2 := fibo1(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,188 INFO L280 TraceCheckUtils]: 6: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,188 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {20996#true} {20996#true} #45#return; {20996#true} is VALID [2020-07-29 03:06:49,189 INFO L263 TraceCheckUtils]: 9: Hoare triple {20996#true} call #t~ret3 := fibo1(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {20996#true} assume ~n < 1;#res := 0; {20996#true} is VALID [2020-07-29 03:06:49,190 INFO L280 TraceCheckUtils]: 12: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,190 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {20996#true} {20996#true} #47#return; {20996#true} is VALID [2020-07-29 03:06:49,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {20996#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {20996#true} is VALID [2020-07-29 03:06:49,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,190 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {20996#true} {20996#true} #49#return; {20996#true} is VALID [2020-07-29 03:06:49,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:06:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,197 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20996#true} {20996#true} #51#return; {20996#true} is VALID [2020-07-29 03:06:49,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {20996#true} call #t~ret0 := fibo2(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,198 INFO L280 TraceCheckUtils]: 5: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,199 INFO L263 TraceCheckUtils]: 7: Hoare triple {20996#true} call #t~ret2 := fibo1(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,199 INFO L280 TraceCheckUtils]: 11: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,200 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {20996#true} {20996#true} #45#return; {20996#true} is VALID [2020-07-29 03:06:49,200 INFO L263 TraceCheckUtils]: 13: Hoare triple {20996#true} call #t~ret3 := fibo1(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {20996#true} assume ~n < 1;#res := 0; {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {20996#true} {20996#true} #47#return; {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L280 TraceCheckUtils]: 18: Hoare triple {20996#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {20996#true} {20996#true} #49#return; {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L263 TraceCheckUtils]: 21: Hoare triple {20996#true} call #t~ret1 := fibo2(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,201 INFO L280 TraceCheckUtils]: 22: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,202 INFO L280 TraceCheckUtils]: 24: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,202 INFO L280 TraceCheckUtils]: 25: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,202 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {20996#true} {20996#true} #51#return; {20996#true} is VALID [2020-07-29 03:06:49,202 INFO L280 TraceCheckUtils]: 27: Hoare triple {20996#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {20996#true} is VALID [2020-07-29 03:06:49,202 INFO L280 TraceCheckUtils]: 28: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,204 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {20996#true} {21002#(<= fibo2_~n 4)} #45#return; {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {20998#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:49,206 INFO L263 TraceCheckUtils]: 1: Hoare triple {20998#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {20999#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:49,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {20999#(<= |fibo1_#in~n| 5)} ~n := #in~n; {21000#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:49,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {21000#(<= fibo1_~n 5)} assume !(~n < 1); {21000#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:49,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {21000#(<= fibo1_~n 5)} assume !(1 == ~n); {21000#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:49,208 INFO L263 TraceCheckUtils]: 5: Hoare triple {21000#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {21001#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:49,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {21001#(<= |fibo2_#in~n| 4)} ~n := #in~n; {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {21002#(<= fibo2_~n 4)} assume !(~n < 1); {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {21002#(<= fibo2_~n 4)} assume !(1 == ~n); {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,210 INFO L263 TraceCheckUtils]: 9: Hoare triple {21002#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,211 INFO L263 TraceCheckUtils]: 13: Hoare triple {20996#true} call #t~ret0 := fibo2(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,211 INFO L280 TraceCheckUtils]: 15: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,211 INFO L280 TraceCheckUtils]: 16: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,211 INFO L263 TraceCheckUtils]: 17: Hoare triple {20996#true} call #t~ret2 := fibo1(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L280 TraceCheckUtils]: 18: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L280 TraceCheckUtils]: 19: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L280 TraceCheckUtils]: 20: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L280 TraceCheckUtils]: 21: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {20996#true} {20996#true} #45#return; {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L263 TraceCheckUtils]: 23: Hoare triple {20996#true} call #t~ret3 := fibo1(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,212 INFO L280 TraceCheckUtils]: 24: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L280 TraceCheckUtils]: 25: Hoare triple {20996#true} assume ~n < 1;#res := 0; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L280 TraceCheckUtils]: 26: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {20996#true} {20996#true} #47#return; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L280 TraceCheckUtils]: 28: Hoare triple {20996#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L280 TraceCheckUtils]: 29: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {20996#true} {20996#true} #49#return; {20996#true} is VALID [2020-07-29 03:06:49,213 INFO L263 TraceCheckUtils]: 31: Hoare triple {20996#true} call #t~ret1 := fibo2(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,214 INFO L280 TraceCheckUtils]: 32: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,214 INFO L280 TraceCheckUtils]: 33: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,214 INFO L280 TraceCheckUtils]: 34: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,214 INFO L280 TraceCheckUtils]: 35: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,215 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {20996#true} {20996#true} #51#return; {20996#true} is VALID [2020-07-29 03:06:49,215 INFO L280 TraceCheckUtils]: 37: Hoare triple {20996#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {20996#true} is VALID [2020-07-29 03:06:49,215 INFO L280 TraceCheckUtils]: 38: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,219 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {20996#true} {21002#(<= fibo2_~n 4)} #45#return; {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,220 INFO L263 TraceCheckUtils]: 40: Hoare triple {21002#(<= fibo2_~n 4)} call #t~ret3 := fibo1(~n - 2); {21033#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:49,220 INFO L280 TraceCheckUtils]: 41: Hoare triple {21033#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21034#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:49,221 INFO L280 TraceCheckUtils]: 42: Hoare triple {21034#(<= fibo1_~n 2)} assume !(~n < 1); {21034#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:49,221 INFO L280 TraceCheckUtils]: 43: Hoare triple {21034#(<= fibo1_~n 2)} assume !(1 == ~n); {21034#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:49,223 INFO L263 TraceCheckUtils]: 44: Hoare triple {21034#(<= fibo1_~n 2)} call #t~ret0 := fibo2(~n - 1); {21035#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:49,223 INFO L280 TraceCheckUtils]: 45: Hoare triple {21035#(<= |fibo2_#in~n| 1)} ~n := #in~n; {21036#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:49,224 INFO L280 TraceCheckUtils]: 46: Hoare triple {21036#(<= fibo2_~n 1)} assume !(~n < 1); {21037#(and (< 0 fibo2_~n) (<= fibo2_~n 1))} is VALID [2020-07-29 03:06:49,225 INFO L280 TraceCheckUtils]: 47: Hoare triple {21037#(and (< 0 fibo2_~n) (<= fibo2_~n 1))} assume !(1 == ~n); {20997#false} is VALID [2020-07-29 03:06:49,225 INFO L263 TraceCheckUtils]: 48: Hoare triple {20997#false} call #t~ret2 := fibo1(~n - 1); {20997#false} is VALID [2020-07-29 03:06:49,226 INFO L280 TraceCheckUtils]: 49: Hoare triple {20997#false} ~n := #in~n; {20997#false} is VALID [2020-07-29 03:06:49,226 INFO L280 TraceCheckUtils]: 50: Hoare triple {20997#false} assume !(~n < 1); {20997#false} is VALID [2020-07-29 03:06:49,226 INFO L280 TraceCheckUtils]: 51: Hoare triple {20997#false} assume !(1 == ~n); {20997#false} is VALID [2020-07-29 03:06:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-29 03:06:49,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130226814] [2020-07-29 03:06:49,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635156991] [2020-07-29 03:06:49,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:06:49,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:06:49,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:06:49,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 03:06:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:49,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:49,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {20996#true} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {20998#(<= ULTIMATE.start_main_~x~0 5)} is VALID [2020-07-29 03:06:49,569 INFO L263 TraceCheckUtils]: 1: Hoare triple {20998#(<= ULTIMATE.start_main_~x~0 5)} call main_#t~ret4 := fibo1(main_~x~0); {20999#(<= |fibo1_#in~n| 5)} is VALID [2020-07-29 03:06:49,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {20999#(<= |fibo1_#in~n| 5)} ~n := #in~n; {21000#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:49,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {21000#(<= fibo1_~n 5)} assume !(~n < 1); {21000#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:49,572 INFO L280 TraceCheckUtils]: 4: Hoare triple {21000#(<= fibo1_~n 5)} assume !(1 == ~n); {21000#(<= fibo1_~n 5)} is VALID [2020-07-29 03:06:49,573 INFO L263 TraceCheckUtils]: 5: Hoare triple {21000#(<= fibo1_~n 5)} call #t~ret0 := fibo2(~n - 1); {21001#(<= |fibo2_#in~n| 4)} is VALID [2020-07-29 03:06:49,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {21001#(<= |fibo2_#in~n| 4)} ~n := #in~n; {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {21002#(<= fibo2_~n 4)} assume !(~n < 1); {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {21002#(<= fibo2_~n 4)} assume !(1 == ~n); {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,575 INFO L263 TraceCheckUtils]: 9: Hoare triple {21002#(<= fibo2_~n 4)} call #t~ret2 := fibo1(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,575 INFO L280 TraceCheckUtils]: 11: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,575 INFO L263 TraceCheckUtils]: 13: Hoare triple {20996#true} call #t~ret0 := fibo2(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,575 INFO L280 TraceCheckUtils]: 14: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {20996#true} assume !(1 == ~n); {20996#true} is VALID [2020-07-29 03:06:49,576 INFO L263 TraceCheckUtils]: 17: Hoare triple {20996#true} call #t~ret2 := fibo1(~n - 1); {20996#true} is VALID [2020-07-29 03:06:49,576 INFO L280 TraceCheckUtils]: 18: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,577 INFO L280 TraceCheckUtils]: 19: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,577 INFO L280 TraceCheckUtils]: 20: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,577 INFO L280 TraceCheckUtils]: 21: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,577 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {20996#true} {20996#true} #45#return; {20996#true} is VALID [2020-07-29 03:06:49,577 INFO L263 TraceCheckUtils]: 23: Hoare triple {20996#true} call #t~ret3 := fibo1(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,577 INFO L280 TraceCheckUtils]: 24: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {20996#true} assume ~n < 1;#res := 0; {20996#true} is VALID [2020-07-29 03:06:49,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,578 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {20996#true} {20996#true} #47#return; {20996#true} is VALID [2020-07-29 03:06:49,578 INFO L280 TraceCheckUtils]: 28: Hoare triple {20996#true} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {20996#true} is VALID [2020-07-29 03:06:49,578 INFO L280 TraceCheckUtils]: 29: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,578 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {20996#true} {20996#true} #49#return; {20996#true} is VALID [2020-07-29 03:06:49,579 INFO L263 TraceCheckUtils]: 31: Hoare triple {20996#true} call #t~ret1 := fibo2(~n - 2); {20996#true} is VALID [2020-07-29 03:06:49,579 INFO L280 TraceCheckUtils]: 32: Hoare triple {20996#true} ~n := #in~n; {20996#true} is VALID [2020-07-29 03:06:49,579 INFO L280 TraceCheckUtils]: 33: Hoare triple {20996#true} assume !(~n < 1); {20996#true} is VALID [2020-07-29 03:06:49,579 INFO L280 TraceCheckUtils]: 34: Hoare triple {20996#true} assume 1 == ~n;#res := 1; {20996#true} is VALID [2020-07-29 03:06:49,580 INFO L280 TraceCheckUtils]: 35: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,580 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {20996#true} {20996#true} #51#return; {20996#true} is VALID [2020-07-29 03:06:49,580 INFO L280 TraceCheckUtils]: 37: Hoare triple {20996#true} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {20996#true} is VALID [2020-07-29 03:06:49,580 INFO L280 TraceCheckUtils]: 38: Hoare triple {20996#true} assume true; {20996#true} is VALID [2020-07-29 03:06:49,582 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {20996#true} {21002#(<= fibo2_~n 4)} #45#return; {21002#(<= fibo2_~n 4)} is VALID [2020-07-29 03:06:49,583 INFO L263 TraceCheckUtils]: 40: Hoare triple {21002#(<= fibo2_~n 4)} call #t~ret3 := fibo1(~n - 2); {21033#(<= |fibo1_#in~n| 2)} is VALID [2020-07-29 03:06:49,584 INFO L280 TraceCheckUtils]: 41: Hoare triple {21033#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21034#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:49,584 INFO L280 TraceCheckUtils]: 42: Hoare triple {21034#(<= fibo1_~n 2)} assume !(~n < 1); {21034#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:49,585 INFO L280 TraceCheckUtils]: 43: Hoare triple {21034#(<= fibo1_~n 2)} assume !(1 == ~n); {21034#(<= fibo1_~n 2)} is VALID [2020-07-29 03:06:49,586 INFO L263 TraceCheckUtils]: 44: Hoare triple {21034#(<= fibo1_~n 2)} call #t~ret0 := fibo2(~n - 1); {21035#(<= |fibo2_#in~n| 1)} is VALID [2020-07-29 03:06:49,587 INFO L280 TraceCheckUtils]: 45: Hoare triple {21035#(<= |fibo2_#in~n| 1)} ~n := #in~n; {21036#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:49,588 INFO L280 TraceCheckUtils]: 46: Hoare triple {21036#(<= fibo2_~n 1)} assume !(~n < 1); {21036#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:49,588 INFO L280 TraceCheckUtils]: 47: Hoare triple {21036#(<= fibo2_~n 1)} assume !(1 == ~n); {21036#(<= fibo2_~n 1)} is VALID [2020-07-29 03:06:49,590 INFO L263 TraceCheckUtils]: 48: Hoare triple {21036#(<= fibo2_~n 1)} call #t~ret2 := fibo1(~n - 1); {21216#(<= |fibo1_#in~n| 0)} is VALID [2020-07-29 03:06:49,590 INFO L280 TraceCheckUtils]: 49: Hoare triple {21216#(<= |fibo1_#in~n| 0)} ~n := #in~n; {21220#(<= fibo1_~n 0)} is VALID [2020-07-29 03:06:49,591 INFO L280 TraceCheckUtils]: 50: Hoare triple {21220#(<= fibo1_~n 0)} assume !(~n < 1); {20997#false} is VALID [2020-07-29 03:06:49,592 INFO L280 TraceCheckUtils]: 51: Hoare triple {20997#false} assume !(1 == ~n); {20997#false} is VALID [2020-07-29 03:06:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-29 03:06:49,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:06:49,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2020-07-29 03:06:49,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707266006] [2020-07-29 03:06:49,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:06:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2140660038, now seen corresponding path program 2 times [2020-07-29 03:06:49,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:06:49,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095601780] [2020-07-29 03:06:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:06:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:49,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:06:49,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:06:49,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:06:49,758 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:49,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:49,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:49,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:49,758 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:06:49,759 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:49,759 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:49,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:49,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration9_Loop [2020-07-29 03:06:49,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:49,759 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:49,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:49,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:49,977 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:49,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:06:49,982 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:50,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:06:50,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:06:56,263 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:06:56,265 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:06:56,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:06:56,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:06:56,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:06:56,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:06:56,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:56,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:06:56,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:06:56,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration9_Loop [2020-07-29 03:06:56,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:06:56,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:06:56,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:06:56,476 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:06:56,476 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:56,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:56,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:56,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:56,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:56,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:56,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:56,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:56,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:56,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:56,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:56,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:56,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:56,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:56,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:56,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:56,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:56,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:56,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:56,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:56,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:56,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:56,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:56,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:56,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:56,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:56,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:56,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:56,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:06:56,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:06:56,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:06:56,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:06:56,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:06:56,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:06:56,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:06:56,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:06:56,563 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:06:56,567 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:06:56,568 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:06:56,571 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:06:56,571 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:06:56,571 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:06:56,571 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2020-07-29 03:06:56,592 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:06:56,595 INFO L393 LassoCheck]: Loop: "call #t~ret0 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret2 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2020-07-29 03:06:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:56,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 03:06:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:56,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:56,735 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:56,741 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:56,745 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:56,764 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:56,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {21226#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {21226#unseeded} is VALID [2020-07-29 03:06:56,774 INFO L263 TraceCheckUtils]: 1: Hoare triple {21226#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {21226#unseeded} is VALID [2020-07-29 03:06:56,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:56,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:56,777 INFO L263 TraceCheckUtils]: 5: Hoare triple {21226#unseeded} call #t~ret0 := fibo2(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,777 INFO L280 TraceCheckUtils]: 6: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:56,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:56,779 INFO L263 TraceCheckUtils]: 9: Hoare triple {21226#unseeded} call #t~ret2 := fibo1(~n - 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,781 INFO L280 TraceCheckUtils]: 11: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,782 INFO L263 TraceCheckUtils]: 13: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibo2(~n - 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,785 INFO L263 TraceCheckUtils]: 17: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,787 INFO L280 TraceCheckUtils]: 20: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,788 INFO L280 TraceCheckUtils]: 21: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,789 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,790 INFO L263 TraceCheckUtils]: 23: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,792 INFO L280 TraceCheckUtils]: 25: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,792 INFO L280 TraceCheckUtils]: 26: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,794 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,795 INFO L280 TraceCheckUtils]: 28: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,795 INFO L280 TraceCheckUtils]: 29: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,797 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #49#return; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,798 INFO L263 TraceCheckUtils]: 31: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibo2(~n - 2); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,799 INFO L280 TraceCheckUtils]: 32: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,799 INFO L280 TraceCheckUtils]: 33: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,800 INFO L280 TraceCheckUtils]: 34: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,801 INFO L280 TraceCheckUtils]: 35: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,802 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #51#return; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,803 INFO L280 TraceCheckUtils]: 37: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,804 INFO L280 TraceCheckUtils]: 38: Hoare triple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:56,805 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {21271#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21226#unseeded} #45#return; {21226#unseeded} is VALID [2020-07-29 03:06:56,806 INFO L263 TraceCheckUtils]: 40: Hoare triple {21226#unseeded} call #t~ret3 := fibo1(~n - 2); {21226#unseeded} is VALID [2020-07-29 03:06:56,806 INFO L280 TraceCheckUtils]: 41: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:56,807 INFO L280 TraceCheckUtils]: 42: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,808 INFO L280 TraceCheckUtils]: 43: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:56,808 INFO L263 TraceCheckUtils]: 44: Hoare triple {21226#unseeded} call #t~ret0 := fibo2(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,809 INFO L280 TraceCheckUtils]: 45: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:56,810 INFO L280 TraceCheckUtils]: 46: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,810 INFO L280 TraceCheckUtils]: 47: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:56,811 INFO L263 TraceCheckUtils]: 48: Hoare triple {21226#unseeded} call #t~ret2 := fibo1(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,812 INFO L280 TraceCheckUtils]: 49: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:56,812 INFO L280 TraceCheckUtils]: 50: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:56,813 INFO L280 TraceCheckUtils]: 51: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:56,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:06:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:56,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:57,070 INFO L263 TraceCheckUtils]: 0: Hoare triple {21229#(>= oldRank0 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {21398#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2020-07-29 03:06:57,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {21398#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {21402#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:57,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {21402#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {21402#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:57,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {21402#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {21402#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:57,073 INFO L263 TraceCheckUtils]: 4: Hoare triple {21402#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret2 := fibo1(~n - 1); {21412#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:57,074 INFO L280 TraceCheckUtils]: 5: Hoare triple {21412#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {21416#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:57,074 INFO L280 TraceCheckUtils]: 6: Hoare triple {21416#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {21420#(and (<= 1 fibo1_~n) (<= (+ fibo1_~n 2) oldRank0))} is VALID [2020-07-29 03:06:57,075 INFO L280 TraceCheckUtils]: 7: Hoare triple {21420#(and (<= 1 fibo1_~n) (<= (+ fibo1_~n 2) oldRank0))} assume !(1 == ~n); {21239#(or (and (> oldRank0 fibo1_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:57,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:06:57,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:57,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,128 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 [2020-07-29 03:06:57,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 121 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 03:06:57,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 121 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 129 states and 136 transitions. Complement of second has 19 states. [2020-07-29 03:06:57,351 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 [2020-07-29 03:06:57,351 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:57,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 121 transitions. cyclomatic complexity: 9 [2020-07-29 03:06:57,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:57,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:57,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 03:06:57,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:57,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:57,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:57,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 136 transitions. [2020-07-29 03:06:57,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-07-29 03:06:57,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:57,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:57,354 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 115 states and 121 transitions. cyclomatic complexity: 9 [2020-07-29 03:06:57,357 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:06:57,358 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 03:06:57,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:57,359 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:57,359 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 129 states and 136 transitions. cyclomatic complexity: 10 [2020-07-29 03:06:57,362 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:06:57,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:57,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:57,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:57,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 129 letters. Loop has 129 letters. [2020-07-29 03:06:57,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 129 letters. Loop has 129 letters. [2020-07-29 03:06:57,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 129 letters. Loop has 129 letters. [2020-07-29 03:06:57,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:57,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:57,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:57,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:57,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:57,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:57,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:57,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:57,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:57,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:57,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:57,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:57,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:57,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:57,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:57,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:57,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:57,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:57,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:57,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:57,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:57,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:57,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:57,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:57,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:57,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:57,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:57,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:57,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:57,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:57,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:57,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:57,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:57,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:57,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:57,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:57,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:57,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:57,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:57,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:57,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:57,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:57,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:57,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:57,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:57,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:57,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:57,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:57,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:57,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:57,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:57,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:57,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:57,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:57,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:57,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:57,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:57,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:57,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:57,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:57,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:57,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:57,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:57,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:57,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:57,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:57,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:57,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:57,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:57,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:57,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:57,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:57,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:57,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:57,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:57,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:57,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:57,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:57,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:57,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:57,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:57,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:57,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:57,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:57,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:57,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:57,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:57,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:57,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:57,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:57,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:57,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:57,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 136 transitions. cyclomatic complexity: 10 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:57,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,408 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:06:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2020-07-29 03:06:57,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,409 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:06:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:57,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 03:06:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:57,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:57,534 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:57,541 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:57,545 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:57,550 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:57,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {21226#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {21226#unseeded} is VALID [2020-07-29 03:06:57,560 INFO L263 TraceCheckUtils]: 1: Hoare triple {21226#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {21226#unseeded} is VALID [2020-07-29 03:06:57,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:57,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:57,563 INFO L263 TraceCheckUtils]: 5: Hoare triple {21226#unseeded} call #t~ret0 := fibo2(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:57,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:57,566 INFO L263 TraceCheckUtils]: 9: Hoare triple {21226#unseeded} call #t~ret2 := fibo1(~n - 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,569 INFO L263 TraceCheckUtils]: 13: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibo2(~n - 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,571 INFO L263 TraceCheckUtils]: 17: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,572 INFO L280 TraceCheckUtils]: 18: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,573 INFO L280 TraceCheckUtils]: 20: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,573 INFO L280 TraceCheckUtils]: 21: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,575 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,576 INFO L263 TraceCheckUtils]: 23: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,577 INFO L280 TraceCheckUtils]: 24: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,579 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,580 INFO L280 TraceCheckUtils]: 28: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,580 INFO L280 TraceCheckUtils]: 29: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,582 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #49#return; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,583 INFO L263 TraceCheckUtils]: 31: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibo2(~n - 2); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,584 INFO L280 TraceCheckUtils]: 32: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,584 INFO L280 TraceCheckUtils]: 33: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,585 INFO L280 TraceCheckUtils]: 34: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,585 INFO L280 TraceCheckUtils]: 35: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,587 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #51#return; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,587 INFO L280 TraceCheckUtils]: 37: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,588 INFO L280 TraceCheckUtils]: 38: Hoare triple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:57,589 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {21613#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21226#unseeded} #45#return; {21226#unseeded} is VALID [2020-07-29 03:06:57,590 INFO L263 TraceCheckUtils]: 40: Hoare triple {21226#unseeded} call #t~ret3 := fibo1(~n - 2); {21226#unseeded} is VALID [2020-07-29 03:06:57,590 INFO L280 TraceCheckUtils]: 41: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:57,591 INFO L280 TraceCheckUtils]: 42: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,592 INFO L280 TraceCheckUtils]: 43: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:57,593 INFO L263 TraceCheckUtils]: 44: Hoare triple {21226#unseeded} call #t~ret0 := fibo2(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,593 INFO L280 TraceCheckUtils]: 45: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:57,594 INFO L280 TraceCheckUtils]: 46: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,594 INFO L280 TraceCheckUtils]: 47: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:57,595 INFO L263 TraceCheckUtils]: 48: Hoare triple {21226#unseeded} call #t~ret2 := fibo1(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,596 INFO L280 TraceCheckUtils]: 49: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:57,596 INFO L280 TraceCheckUtils]: 50: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:57,597 INFO L280 TraceCheckUtils]: 51: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:57,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:06:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:57,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:57,857 INFO L263 TraceCheckUtils]: 0: Hoare triple {21229#(>= oldRank0 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {21740#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2020-07-29 03:06:57,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {21740#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {21744#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:57,859 INFO L280 TraceCheckUtils]: 2: Hoare triple {21744#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {21744#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:57,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {21744#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {21744#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:57,860 INFO L263 TraceCheckUtils]: 4: Hoare triple {21744#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret2 := fibo1(~n - 1); {21754#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:57,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {21754#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {21758#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:57,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {21758#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {21762#(and (<= 1 fibo1_~n) (<= (+ fibo1_~n 2) oldRank0))} is VALID [2020-07-29 03:06:57,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {21762#(and (<= 1 fibo1_~n) (<= (+ fibo1_~n 2) oldRank0))} assume !(1 == ~n); {21239#(or (and (> oldRank0 fibo1_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:57,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:06:57,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:57,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:57,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:57,921 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 [2020-07-29 03:06:57,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 121 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 03:06:58,223 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 121 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 135 states and 142 transitions. Complement of second has 21 states. [2020-07-29 03:06:58,224 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 [2020-07-29 03:06:58,224 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:58,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 121 transitions. cyclomatic complexity: 9 [2020-07-29 03:06:58,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:58,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:58,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 03:06:58,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:06:58,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:58,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:58,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 142 transitions. [2020-07-29 03:06:58,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-07-29 03:06:58,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:58,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:58,230 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 115 states and 121 transitions. cyclomatic complexity: 9 [2020-07-29 03:06:58,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:06:58,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 03:06:58,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:06:58,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:58,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 135 states and 142 transitions. cyclomatic complexity: 10 [2020-07-29 03:06:58,238 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:06:58,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 6 letters. [2020-07-29 03:06:58,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 03:06:58,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 6 letters. [2020-07-29 03:06:58,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 135 letters. Loop has 135 letters. [2020-07-29 03:06:58,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 135 letters. Loop has 135 letters. [2020-07-29 03:06:58,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 135 letters. Loop has 135 letters. [2020-07-29 03:06:58,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:58,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:58,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:58,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:06:58,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:06:58,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:06:58,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:58,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:58,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:58,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:58,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:58,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:58,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:58,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:58,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:58,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:58,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:58,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:58,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:58,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:58,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:58,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:58,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:58,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:58,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:58,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:58,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:58,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:58,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:58,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:58,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:58,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:58,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:58,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:58,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:58,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:58,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:58,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:58,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:58,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:58,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:58,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:58,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:58,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:58,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 6 letters. [2020-07-29 03:06:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 03:06:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 6 letters. [2020-07-29 03:06:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:58,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:58,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:58,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:58,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:58,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:58,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:58,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:58,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:58,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:58,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:58,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:58,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:58,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:58,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:58,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:58,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:58,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:58,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:58,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:58,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:58,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:58,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 142 transitions. cyclomatic complexity: 10 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:58,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,296 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:06:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2020-07-29 03:06:58,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,297 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:06:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:06:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:58,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 03:06:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:58,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:58,432 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:58,439 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:58,442 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:58,450 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:58,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {21226#unseeded} havoc main_#res;havoc main_#t~ret4, main_~x~0, main_~result~0;main_~x~0 := 5; {21226#unseeded} is VALID [2020-07-29 03:06:58,461 INFO L263 TraceCheckUtils]: 1: Hoare triple {21226#unseeded} call main_#t~ret4 := fibo1(main_~x~0); {21226#unseeded} is VALID [2020-07-29 03:06:58,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:58,462 INFO L280 TraceCheckUtils]: 3: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:58,464 INFO L263 TraceCheckUtils]: 5: Hoare triple {21226#unseeded} call #t~ret0 := fibo2(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:58,465 INFO L280 TraceCheckUtils]: 7: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,465 INFO L280 TraceCheckUtils]: 8: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:58,467 INFO L263 TraceCheckUtils]: 9: Hoare triple {21226#unseeded} call #t~ret2 := fibo1(~n - 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,469 INFO L280 TraceCheckUtils]: 12: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,470 INFO L263 TraceCheckUtils]: 13: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibo2(~n - 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,471 INFO L280 TraceCheckUtils]: 14: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,472 INFO L280 TraceCheckUtils]: 15: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,473 INFO L280 TraceCheckUtils]: 16: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,474 INFO L263 TraceCheckUtils]: 17: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := fibo1(~n - 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,474 INFO L280 TraceCheckUtils]: 18: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,475 INFO L280 TraceCheckUtils]: 19: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,476 INFO L280 TraceCheckUtils]: 21: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,478 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,479 INFO L263 TraceCheckUtils]: 23: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := fibo1(~n - 2); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,480 INFO L280 TraceCheckUtils]: 24: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,480 INFO L280 TraceCheckUtils]: 25: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,481 INFO L280 TraceCheckUtils]: 26: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,482 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #47#return; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,483 INFO L280 TraceCheckUtils]: 28: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,484 INFO L280 TraceCheckUtils]: 29: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,485 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #49#return; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,486 INFO L263 TraceCheckUtils]: 31: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibo2(~n - 2); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,487 INFO L280 TraceCheckUtils]: 32: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,488 INFO L280 TraceCheckUtils]: 33: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,488 INFO L280 TraceCheckUtils]: 34: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,489 INFO L280 TraceCheckUtils]: 35: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,491 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #51#return; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,491 INFO L280 TraceCheckUtils]: 37: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,492 INFO L280 TraceCheckUtils]: 38: Hoare triple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:06:58,493 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {21965#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21226#unseeded} #45#return; {21226#unseeded} is VALID [2020-07-29 03:06:58,494 INFO L263 TraceCheckUtils]: 40: Hoare triple {21226#unseeded} call #t~ret3 := fibo1(~n - 2); {21226#unseeded} is VALID [2020-07-29 03:06:58,496 INFO L280 TraceCheckUtils]: 41: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:58,496 INFO L280 TraceCheckUtils]: 42: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,497 INFO L280 TraceCheckUtils]: 43: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:58,498 INFO L263 TraceCheckUtils]: 44: Hoare triple {21226#unseeded} call #t~ret0 := fibo2(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,498 INFO L280 TraceCheckUtils]: 45: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:58,499 INFO L280 TraceCheckUtils]: 46: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,500 INFO L280 TraceCheckUtils]: 47: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:58,500 INFO L263 TraceCheckUtils]: 48: Hoare triple {21226#unseeded} call #t~ret2 := fibo1(~n - 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,501 INFO L280 TraceCheckUtils]: 49: Hoare triple {21226#unseeded} ~n := #in~n; {21226#unseeded} is VALID [2020-07-29 03:06:58,502 INFO L280 TraceCheckUtils]: 50: Hoare triple {21226#unseeded} assume !(~n < 1); {21226#unseeded} is VALID [2020-07-29 03:06:58,502 INFO L280 TraceCheckUtils]: 51: Hoare triple {21226#unseeded} assume !(1 == ~n); {21226#unseeded} is VALID [2020-07-29 03:06:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:58,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:06:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:58,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:58,860 INFO L263 TraceCheckUtils]: 0: Hoare triple {21229#(>= oldRank0 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {22092#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2020-07-29 03:06:58,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {22092#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {22096#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:58,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {22096#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {22096#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:58,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {22096#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {22096#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2020-07-29 03:06:58,865 INFO L263 TraceCheckUtils]: 4: Hoare triple {22096#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret2 := fibo1(~n - 1); {22106#(<= (+ |fibo1_#in~n| 2) oldRank0)} is VALID [2020-07-29 03:06:58,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {22106#(<= (+ |fibo1_#in~n| 2) oldRank0)} ~n := #in~n; {22110#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2020-07-29 03:06:58,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {22110#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {22114#(and (<= 1 fibo1_~n) (<= (+ fibo1_~n 2) oldRank0))} is VALID [2020-07-29 03:06:58,868 INFO L280 TraceCheckUtils]: 7: Hoare triple {22114#(and (<= 1 fibo1_~n) (<= (+ fibo1_~n 2) oldRank0))} assume !(1 == ~n); {21239#(or (and (> oldRank0 fibo1_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:06:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:58,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:06:58,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:58,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:58,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:58,927 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 [2020-07-29 03:06:58,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 121 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 03:06:59,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 121 transitions. cyclomatic complexity: 9. Second operand 8 states. Result 188 states and 198 transitions. Complement of second has 30 states. [2020-07-29 03:06:59,294 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 [2020-07-29 03:06:59,295 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:59,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 121 transitions. cyclomatic complexity: 9 [2020-07-29 03:06:59,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:59,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:59,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 03:06:59,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:59,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:59,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:59,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 198 transitions. [2020-07-29 03:06:59,299 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:59,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:59,300 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 115 states and 121 transitions. cyclomatic complexity: 9 [2020-07-29 03:06:59,300 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:06:59,300 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 03:06:59,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:06:59,302 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:59,302 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 198 transitions. cyclomatic complexity: 13 [2020-07-29 03:06:59,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 198 transitions. cyclomatic complexity: 13 [2020-07-29 03:06:59,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:59,302 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:06:59,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:59,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 188 letters. Loop has 188 letters. [2020-07-29 03:06:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 188 letters. Loop has 188 letters. [2020-07-29 03:06:59,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 188 letters. Loop has 188 letters. [2020-07-29 03:06:59,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:59,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:59,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 115 letters. Loop has 115 letters. [2020-07-29 03:06:59,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:59,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:59,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:06:59,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:59,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:59,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 56 letters. Loop has 8 letters. [2020-07-29 03:06:59,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:59,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:59,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 58 letters. Loop has 8 letters. [2020-07-29 03:06:59,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:59,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:59,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 57 letters. Loop has 8 letters. [2020-07-29 03:06:59,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:59,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:59,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 54 letters. Loop has 8 letters. [2020-07-29 03:06:59,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:59,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:59,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 53 letters. Loop has 8 letters. [2020-07-29 03:06:59,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:59,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:59,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 59 letters. Loop has 8 letters. [2020-07-29 03:06:59,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:59,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:59,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 8 letters. [2020-07-29 03:06:59,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:59,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:59,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 72 letters. Loop has 8 letters. [2020-07-29 03:06:59,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:59,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:59,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 71 letters. Loop has 8 letters. [2020-07-29 03:06:59,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:59,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:59,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 73 letters. Loop has 8 letters. [2020-07-29 03:06:59,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:59,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:59,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 69 letters. Loop has 8 letters. [2020-07-29 03:06:59,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:59,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:59,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 70 letters. Loop has 8 letters. [2020-07-29 03:06:59,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:59,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:59,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 68 letters. Loop has 8 letters. [2020-07-29 03:06:59,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:59,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:59,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 67 letters. Loop has 8 letters. [2020-07-29 03:06:59,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:59,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:59,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 66 letters. Loop has 8 letters. [2020-07-29 03:06:59,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 121 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:59,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:59,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 198 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2020-07-29 03:06:59,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,333 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:06:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 03:06:59,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 8 letters. [2020-07-29 03:06:59,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 60 letters. Loop has 8 letters. [2020-07-29 03:06:59,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 52 letters. Loop has 16 letters. [2020-07-29 03:06:59,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:59,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 198 transitions. cyclomatic complexity: 13 [2020-07-29 03:06:59,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:59,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 0 states and 0 transitions. [2020-07-29 03:06:59,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:06:59,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:06:59,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:06:59,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:06:59,344 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:59,345 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:59,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:06:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:06:59,346 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 14 states. [2020-07-29 03:06:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:59,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:06:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:06:59,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:06:59,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:06:59,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:06:59,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:59,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:06:59,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:06:59,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:06:59,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:06:59,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:06:59,417 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:59,418 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:59,418 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:59,418 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:06:59,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:06:59,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:59,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:59,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:06:59 BoogieIcfgContainer [2020-07-29 03:06:59,426 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:06:59,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:06:59,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:06:59,427 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:06:59,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:06:14" (3/4) ... [2020-07-29 03:06:59,432 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:06:59,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:06:59,435 INFO L168 Benchmark]: Toolchain (without parser) took 45682.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 512.2 MB). Free memory was 960.2 MB in the beginning and 1.4 GB in the end (delta: -432.9 MB). Peak memory consumption was 79.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:59,436 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:06:59,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:59,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 949.5 MB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:59,437 INFO L168 Benchmark]: Boogie Preprocessor took 35.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:59,437 INFO L168 Benchmark]: RCFGBuilder took 331.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:59,438 INFO L168 Benchmark]: BuchiAutomizer took 44767.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -261.9 MB). Peak memory consumption was 87.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:59,439 INFO L168 Benchmark]: Witness Printer took 5.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:06:59,443 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 949.5 MB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44767.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -261.9 MB). Peak memory consumption was 87.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 12 locations. One deterministic module has affine ranking function n and consists of 13 locations. One nondeterministic module has affine ranking function n and consists of 15 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 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.7s and 10 iterations. TraceHistogramMax:8. Analysis of lassos took 22.8s. Construction of modules took 4.9s. Büchi inclusion checks took 15.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 182 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 166 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/51 HoareTripleCheckerStatistics: 319 SDtfs, 805 SDslu, 799 SDs, 0 SdLazy, 2093 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf81 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp79 dnf100 smp100 tf109 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...