./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-numeric/Fibonacci01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 72a153493a873036c1f42f91ea85c7d993e2a590 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 01:29:18,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:18,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:18,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:18,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:18,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:18,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:18,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:18,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:18,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:18,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:18,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:18,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:18,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:18,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:18,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:18,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:18,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:18,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:18,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:18,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:18,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:18,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:18,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:18,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:18,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:18,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:18,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:18,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:18,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:18,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:18,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:18,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:18,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:18,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:18,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:18,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:18,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:18,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:18,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:18,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:18,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:29:18,312 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:18,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:18,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:18,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:18,317 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:18,318 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:18,321 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:18,322 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:18,322 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:18,322 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:18,323 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:18,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:18,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:18,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:18,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:18,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:18,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:18,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:18,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:18,327 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:18,327 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:18,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:18,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:18,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:18,329 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:18,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:18,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:18,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:18,331 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:18,332 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:18,332 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72a153493a873036c1f42f91ea85c7d993e2a590 [2020-07-29 01:29:18,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:18,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:18,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:18,687 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:18,688 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:18,689 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2020-07-29 01:29:18,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5f8dca1/c4d598d7f3104fe78ab5cfefaf7e9ba6/FLAG9a8f3ec63 [2020-07-29 01:29:19,196 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:19,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2020-07-29 01:29:19,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5f8dca1/c4d598d7f3104fe78ab5cfefaf7e9ba6/FLAG9a8f3ec63 [2020-07-29 01:29:19,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5f8dca1/c4d598d7f3104fe78ab5cfefaf7e9ba6 [2020-07-29 01:29:19,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:19,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:19,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:19,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:19,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:19,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:19,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9c1974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19, skipping insertion in model container [2020-07-29 01:29:19,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:19,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:19,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:19,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:19,853 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:19,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:19,889 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:19,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19 WrapperNode [2020-07-29 01:29:19,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:19,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:19,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:19,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:19,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:19,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:20,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:20,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:20,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:20,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (1/1) ... [2020-07-29 01:29:20,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:20,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:20,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:20,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:20,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (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 01:29:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-29 01:29:20,112 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-29 01:29:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:20,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:20,323 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:20,323 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:29:20,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:20 BoogieIcfgContainer [2020-07-29 01:29:20,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:20,328 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:20,328 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:20,331 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:20,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:20,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:19" (1/3) ... [2020-07-29 01:29:20,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@480de591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:20, skipping insertion in model container [2020-07-29 01:29:20,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:20,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:19" (2/3) ... [2020-07-29 01:29:20,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@480de591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:20, skipping insertion in model container [2020-07-29 01:29:20,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:20,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:20" (3/3) ... [2020-07-29 01:29:20,337 INFO L371 chiAutomizerObserver]: Analyzing ICFG Fibonacci01-2.c [2020-07-29 01:29:20,460 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:20,460 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:20,460 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:20,461 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:20,461 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:20,461 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:20,461 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:20,461 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:20,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:29:20,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:20,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:20,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:20,527 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:29:20,527 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:29:20,528 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:20,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:29:20,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:20,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:20,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:20,543 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:29:20,543 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:29:20,552 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 5#L27true assume !(main_~x~0 < 1); 8#L29true call main_#t~ret3 := fibonacci(main_~x~0);< 17#fibonacciENTRYtrue [2020-07-29 01:29:20,552 INFO L796 eck$LassoCheckResult]: Loop: 17#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 7#L17true assume !(1 == ~n); 4#L20true call #t~ret0 := fibonacci(~n - 1);< 17#fibonacciENTRYtrue [2020-07-29 01:29:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 43870, now seen corresponding path program 1 times [2020-07-29 01:29:20,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:20,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884547819] [2020-07-29 01:29:20,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:20,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash 927645, now seen corresponding path program 1 times [2020-07-29 01:29:20,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:20,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35205742] [2020-07-29 01:29:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1860164730, now seen corresponding path program 1 times [2020-07-29 01:29:20,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:20,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542033008] [2020-07-29 01:29:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:20,894 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:20,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:20,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:20,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:20,896 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:20,896 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,896 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:20,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:20,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2020-07-29 01:29:20,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:20,897 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:20,923 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 01:29:20,937 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 01:29:20,942 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 01:29:20,948 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 01:29:20,953 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 01:29:21,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:21,103 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,118 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,118 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#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 01:29:21,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,154 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,154 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=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 01:29:21,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,189 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=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 01:29:21,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,226 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,226 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=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 01:29:21,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,258 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:21,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,371 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:21,373 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:21,373 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:21,374 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:21,374 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:21,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:21,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:21,375 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:21,375 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2020-07-29 01:29:21,375 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:21,375 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:21,385 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 01:29:21,390 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 01:29:21,395 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 01:29:21,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 01:29:21,408 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 01:29:21,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:21,558 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:29:21,566 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:21,578 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 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 01:29:21,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 01:29:21,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:21,621 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,670 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 01:29:21,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,676 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,703 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:21,709 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,758 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 01:29:21,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,763 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 01:29:21,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:21,772 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:21,772 INFO L444 ModelExtractionUtils]: 1 out of 3 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:21,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:21,788 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:21,788 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,831 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:21,836 INFO L393 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< [2020-07-29 01:29:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:21,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {27#unseeded} is VALID [2020-07-29 01:29:21,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume !(main_~x~0 < 1); {27#unseeded} is VALID [2020-07-29 01:29:21,918 INFO L263 TraceCheckUtils]: 2: Hoare triple {27#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {27#unseeded} is VALID [2020-07-29 01:29:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:22,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {51#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 01:29:22,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {55#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:22,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} assume !(1 == ~n); {55#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:22,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {55#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} call #t~ret0 := fibonacci(~n - 1); {40#(or (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)) unseeded)} is VALID [2020-07-29 01:29:22,030 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 01:29:22,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:22,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:22,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,069 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:29:22,070 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-07-29 01:29:22,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 50 states and 62 transitions. Complement of second has 12 states. [2020-07-29 01:29:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:22,311 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:22,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:29:22,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:22,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:22,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:22,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2020-07-29 01:29:22,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:22,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,331 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 01:29:22,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:22,343 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:22,343 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:22,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:22,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:22,347 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 62 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:22,354 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:22,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:29:22,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:29:22,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:29:22,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:22,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:29:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:22,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:22,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:22,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:22,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:22,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:22,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:22,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:22,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:22,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:22,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:22,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:22,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:22,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:22,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:22,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:22,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:22,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:29:22,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:29:22,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:29:22,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:22,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:22,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:22,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:29:22,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,407 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:29:22,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:29:22,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:29:22,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:29:22,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:22,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:22,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 25 states and 34 transitions. [2020-07-29 01:29:22,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:29:22,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:29:22,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-07-29 01:29:22,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:22,464 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 01:29:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-07-29 01:29:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-07-29 01:29:22,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:22,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand 20 states. [2020-07-29 01:29:22,500 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand 20 states. [2020-07-29 01:29:22,502 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 20 states. [2020-07-29 01:29:22,507 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:22,521 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-07-29 01:29:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2020-07-29 01:29:22,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:22,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:22,526 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states and 34 transitions. [2020-07-29 01:29:22,526 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states and 34 transitions. [2020-07-29 01:29:22,531 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:22,547 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2020-07-29 01:29:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-29 01:29:22,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:22,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:22,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:22,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:29:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-29 01:29:22,553 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:29:22,553 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:29:22,553 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:22,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:29:22,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:22,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:22,558 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:22,560 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 142#L27 assume !(main_~x~0 < 1); 134#L29 call main_#t~ret3 := fibonacci(main_~x~0);< 143#fibonacciENTRY ~n := #in~n; 139#L15 assume !(~n < 1); 140#L17 assume !(1 == ~n); 132#L20 call #t~ret0 := fibonacci(~n - 1);< 133#fibonacciENTRY ~n := #in~n; 136#L15 assume ~n < 1;#res := 0; 137#fibonacciFINAL assume true; 135#fibonacciEXIT >#33#return; 130#L20-1 [2020-07-29 01:29:22,560 INFO L796 eck$LassoCheckResult]: Loop: 130#L20-1 call #t~ret1 := fibonacci(~n - 2);< 131#fibonacciENTRY ~n := #in~n; 148#L15 assume !(~n < 1); 146#L17 assume !(1 == ~n); 129#L20 call #t~ret0 := fibonacci(~n - 1);< 131#fibonacciENTRY ~n := #in~n; 148#L15 assume ~n < 1;#res := 0; 145#fibonacciFINAL assume true; 147#fibonacciEXIT >#33#return; 130#L20-1 [2020-07-29 01:29:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 172563538, now seen corresponding path program 1 times [2020-07-29 01:29:22,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817142204] [2020-07-29 01:29:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:22,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:29:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:22,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {356#true} ~n := #in~n; {364#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:22,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {365#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#(<= |fibonacci_#in~n| 0)} assume true; {365#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {365#(<= |fibonacci_#in~n| 0)} {359#(< 1 fibonacci_~n)} #33#return; {357#false} is VALID [2020-07-29 01:29:22,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {356#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {356#true} is VALID [2020-07-29 01:29:22,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#true} assume !(main_~x~0 < 1); {356#true} is VALID [2020-07-29 01:29:22,753 INFO L263 TraceCheckUtils]: 2: Hoare triple {356#true} call main_#t~ret3 := fibonacci(main_~x~0); {356#true} is VALID [2020-07-29 01:29:22,753 INFO L280 TraceCheckUtils]: 3: Hoare triple {356#true} ~n := #in~n; {356#true} is VALID [2020-07-29 01:29:22,754 INFO L280 TraceCheckUtils]: 4: Hoare triple {356#true} assume !(~n < 1); {358#(< 0 fibonacci_~n)} is VALID [2020-07-29 01:29:22,755 INFO L280 TraceCheckUtils]: 5: Hoare triple {358#(< 0 fibonacci_~n)} assume !(1 == ~n); {359#(< 1 fibonacci_~n)} is VALID [2020-07-29 01:29:22,755 INFO L263 TraceCheckUtils]: 6: Hoare triple {359#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {356#true} is VALID [2020-07-29 01:29:22,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#true} ~n := #in~n; {364#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:22,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {364#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {365#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {365#(<= |fibonacci_#in~n| 0)} assume true; {365#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,759 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {365#(<= |fibonacci_#in~n| 0)} {359#(< 1 fibonacci_~n)} #33#return; {357#false} is VALID [2020-07-29 01:29:22,760 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 01:29:22,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817142204] [2020-07-29 01:29:22,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:22,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:29:22,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261004226] [2020-07-29 01:29:22,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2006786507, now seen corresponding path program 1 times [2020-07-29 01:29:22,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737708423] [2020-07-29 01:29:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:22,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:29:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:22,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {366#true} ~n := #in~n; {374#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:22,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {374#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {375#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,837 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#(<= |fibonacci_#in~n| 0)} assume true; {375#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,839 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#(<= |fibonacci_#in~n| 0)} {369#(< 1 fibonacci_~n)} #33#return; {367#false} is VALID [2020-07-29 01:29:22,839 INFO L263 TraceCheckUtils]: 0: Hoare triple {366#true} call #t~ret1 := fibonacci(~n - 2); {366#true} is VALID [2020-07-29 01:29:22,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {366#true} ~n := #in~n; {366#true} is VALID [2020-07-29 01:29:22,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {366#true} assume !(~n < 1); {368#(< 0 fibonacci_~n)} is VALID [2020-07-29 01:29:22,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {368#(< 0 fibonacci_~n)} assume !(1 == ~n); {369#(< 1 fibonacci_~n)} is VALID [2020-07-29 01:29:22,842 INFO L263 TraceCheckUtils]: 4: Hoare triple {369#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {366#true} is VALID [2020-07-29 01:29:22,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {366#true} ~n := #in~n; {374#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:22,844 INFO L280 TraceCheckUtils]: 6: Hoare triple {374#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {375#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#(<= |fibonacci_#in~n| 0)} assume true; {375#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:22,846 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {375#(<= |fibonacci_#in~n| 0)} {369#(< 1 fibonacci_~n)} #33#return; {367#false} is VALID [2020-07-29 01:29:22,847 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 01:29:22,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737708423] [2020-07-29 01:29:22,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:22,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:29:22,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989343546] [2020-07-29 01:29:22,848 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:22,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:29:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:29:22,852 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:29:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:23,060 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 01:29:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:29:23,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:29:23,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:23,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-07-29 01:29:23,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:23,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2020-07-29 01:29:23,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 01:29:23,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:29:23,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2020-07-29 01:29:23,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:23,098 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 01:29:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2020-07-29 01:29:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 01:29:23,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:23,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 30 transitions. Second operand 24 states. [2020-07-29 01:29:23,106 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 30 transitions. Second operand 24 states. [2020-07-29 01:29:23,107 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 24 states. [2020-07-29 01:29:23,108 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:23,116 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-07-29 01:29:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2020-07-29 01:29:23,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:23,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:23,117 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states and 30 transitions. [2020-07-29 01:29:23,118 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states and 30 transitions. [2020-07-29 01:29:23,118 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:23,125 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-07-29 01:29:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2020-07-29 01:29:23,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:23,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:23,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:23,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:29:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-07-29 01:29:23,130 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 01:29:23,130 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 01:29:23,130 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:23,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-07-29 01:29:23,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:23,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:23,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:23,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:23,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 01:29:23,133 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 421#L27 assume !(main_~x~0 < 1); 412#L29 call main_#t~ret3 := fibonacci(main_~x~0);< 422#fibonacciENTRY ~n := #in~n; 418#L15 assume !(~n < 1); 419#L17 assume !(1 == ~n); 411#L20 call #t~ret0 := fibonacci(~n - 1);< 413#fibonacciENTRY ~n := #in~n; 416#L15 assume !(~n < 1); 417#L17 assume 1 == ~n;#res := 1; 423#fibonacciFINAL assume true; 429#fibonacciEXIT >#33#return; 409#L20-1 [2020-07-29 01:29:23,133 INFO L796 eck$LassoCheckResult]: Loop: 409#L20-1 call #t~ret1 := fibonacci(~n - 2);< 410#fibonacciENTRY ~n := #in~n; 430#L15 assume !(~n < 1); 426#L17 assume !(1 == ~n); 408#L20 call #t~ret0 := fibonacci(~n - 1);< 410#fibonacciENTRY ~n := #in~n; 430#L15 assume !(~n < 1); 426#L17 assume !(1 == ~n); 408#L20 call #t~ret0 := fibonacci(~n - 1);< 410#fibonacciENTRY ~n := #in~n; 430#L15 assume !(~n < 1); 426#L17 assume 1 == ~n;#res := 1; 427#fibonacciFINAL assume true; 428#fibonacciEXIT >#33#return; 409#L20-1 call #t~ret1 := fibonacci(~n - 2);< 410#fibonacciENTRY ~n := #in~n; 430#L15 assume ~n < 1;#res := 0; 431#fibonacciFINAL assume true; 414#fibonacciEXIT >#35#return; 415#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 424#fibonacciFINAL assume true; 425#fibonacciEXIT >#33#return; 409#L20-1 [2020-07-29 01:29:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1054526750, now seen corresponding path program 1 times [2020-07-29 01:29:23,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:23,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594880241] [2020-07-29 01:29:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash -370029085, now seen corresponding path program 1 times [2020-07-29 01:29:23,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:23,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108744352] [2020-07-29 01:29:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:23,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1218656064, now seen corresponding path program 1 times [2020-07-29 01:29:23,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:23,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380420971] [2020-07-29 01:29:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:29:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {670#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:23,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {670#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {670#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:23,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {670#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:23,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {671#(<= |fibonacci_#in~n| 1)} assume true; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:23,279 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {671#(<= |fibonacci_#in~n| 1)} {643#true} #33#return; {650#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:23,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-07-29 01:29:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,299 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#true} assume 1 == ~n;#res := 1; {643#true} is VALID [2020-07-29 01:29:23,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,300 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {643#true} {643#true} #33#return; {643#true} is VALID [2020-07-29 01:29:23,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 01:29:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume ~n < 1;#res := 0; {643#true} is VALID [2020-07-29 01:29:23,306 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #35#return; {643#true} is VALID [2020-07-29 01:29:23,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 01:29:23,308 INFO L263 TraceCheckUtils]: 3: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 01:29:23,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,308 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {643#true} assume 1 == ~n;#res := 1; {643#true} is VALID [2020-07-29 01:29:23,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,309 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {643#true} {643#true} #33#return; {643#true} is VALID [2020-07-29 01:29:23,309 INFO L263 TraceCheckUtils]: 9: Hoare triple {643#true} call #t~ret1 := fibonacci(~n - 2); {643#true} is VALID [2020-07-29 01:29:23,310 INFO L280 TraceCheckUtils]: 10: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,310 INFO L280 TraceCheckUtils]: 11: Hoare triple {643#true} assume ~n < 1;#res := 0; {643#true} is VALID [2020-07-29 01:29:23,310 INFO L280 TraceCheckUtils]: 12: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,311 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {643#true} {643#true} #35#return; {643#true} is VALID [2020-07-29 01:29:23,311 INFO L280 TraceCheckUtils]: 14: Hoare triple {643#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {643#true} is VALID [2020-07-29 01:29:23,311 INFO L280 TraceCheckUtils]: 15: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,311 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {643#true} {644#false} #33#return; {644#false} is VALID [2020-07-29 01:29:23,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {643#true} is VALID [2020-07-29 01:29:23,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(main_~x~0 < 1); {643#true} is VALID [2020-07-29 01:29:23,313 INFO L263 TraceCheckUtils]: 2: Hoare triple {643#true} call main_#t~ret3 := fibonacci(main_~x~0); {643#true} is VALID [2020-07-29 01:29:23,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 01:29:23,314 INFO L263 TraceCheckUtils]: 6: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 01:29:23,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {643#true} ~n := #in~n; {670#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:23,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {670#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {670#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:23,316 INFO L280 TraceCheckUtils]: 9: Hoare triple {670#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:23,317 INFO L280 TraceCheckUtils]: 10: Hoare triple {671#(<= |fibonacci_#in~n| 1)} assume true; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:23,319 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {671#(<= |fibonacci_#in~n| 1)} {643#true} #33#return; {650#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:23,320 INFO L263 TraceCheckUtils]: 12: Hoare triple {650#(<= fibonacci_~n 2)} call #t~ret1 := fibonacci(~n - 2); {651#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:23,321 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {652#(<= fibonacci_~n 0)} is VALID [2020-07-29 01:29:23,322 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(<= fibonacci_~n 0)} assume !(~n < 1); {644#false} is VALID [2020-07-29 01:29:23,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {644#false} assume !(1 == ~n); {644#false} is VALID [2020-07-29 01:29:23,322 INFO L263 TraceCheckUtils]: 16: Hoare triple {644#false} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 01:29:23,322 INFO L280 TraceCheckUtils]: 17: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,323 INFO L280 TraceCheckUtils]: 18: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,323 INFO L280 TraceCheckUtils]: 19: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 01:29:23,337 INFO L263 TraceCheckUtils]: 20: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 01:29:23,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,337 INFO L280 TraceCheckUtils]: 22: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,337 INFO L280 TraceCheckUtils]: 23: Hoare triple {643#true} assume 1 == ~n;#res := 1; {643#true} is VALID [2020-07-29 01:29:23,338 INFO L280 TraceCheckUtils]: 24: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,338 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {643#true} {643#true} #33#return; {643#true} is VALID [2020-07-29 01:29:23,338 INFO L263 TraceCheckUtils]: 26: Hoare triple {643#true} call #t~ret1 := fibonacci(~n - 2); {643#true} is VALID [2020-07-29 01:29:23,338 INFO L280 TraceCheckUtils]: 27: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,338 INFO L280 TraceCheckUtils]: 28: Hoare triple {643#true} assume ~n < 1;#res := 0; {643#true} is VALID [2020-07-29 01:29:23,339 INFO L280 TraceCheckUtils]: 29: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,339 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {643#true} {643#true} #35#return; {643#true} is VALID [2020-07-29 01:29:23,339 INFO L280 TraceCheckUtils]: 31: Hoare triple {643#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {643#true} is VALID [2020-07-29 01:29:23,339 INFO L280 TraceCheckUtils]: 32: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 01:29:23,340 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {643#true} {644#false} #33#return; {644#false} is VALID [2020-07-29 01:29:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-29 01:29:23,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380420971] [2020-07-29 01:29:23,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027910043] [2020-07-29 01:29:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:23,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {643#true} is VALID [2020-07-29 01:29:23,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(main_~x~0 < 1); {643#true} is VALID [2020-07-29 01:29:23,578 INFO L263 TraceCheckUtils]: 2: Hoare triple {643#true} call main_#t~ret3 := fibonacci(main_~x~0); {643#true} is VALID [2020-07-29 01:29:23,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 01:29:23,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 01:29:23,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 01:29:23,579 INFO L263 TraceCheckUtils]: 6: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 01:29:23,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {643#true} ~n := #in~n; {705#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:23,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {705#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:23,581 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:23,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {671#(<= |fibonacci_#in~n| 1)} assume true; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:23,583 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {671#(<= |fibonacci_#in~n| 1)} {643#true} #33#return; {650#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:23,584 INFO L263 TraceCheckUtils]: 12: Hoare triple {650#(<= fibonacci_~n 2)} call #t~ret1 := fibonacci(~n - 2); {651#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:23,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {652#(<= fibonacci_~n 0)} is VALID [2020-07-29 01:29:23,586 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(<= fibonacci_~n 0)} assume !(~n < 1); {644#false} is VALID [2020-07-29 01:29:23,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {644#false} assume !(1 == ~n); {644#false} is VALID [2020-07-29 01:29:23,586 INFO L263 TraceCheckUtils]: 16: Hoare triple {644#false} call #t~ret0 := fibonacci(~n - 1); {644#false} is VALID [2020-07-29 01:29:23,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {644#false} ~n := #in~n; {644#false} is VALID [2020-07-29 01:29:23,587 INFO L280 TraceCheckUtils]: 18: Hoare triple {644#false} assume !(~n < 1); {644#false} is VALID [2020-07-29 01:29:23,587 INFO L280 TraceCheckUtils]: 19: Hoare triple {644#false} assume !(1 == ~n); {644#false} is VALID [2020-07-29 01:29:23,587 INFO L263 TraceCheckUtils]: 20: Hoare triple {644#false} call #t~ret0 := fibonacci(~n - 1); {644#false} is VALID [2020-07-29 01:29:23,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {644#false} ~n := #in~n; {644#false} is VALID [2020-07-29 01:29:23,588 INFO L280 TraceCheckUtils]: 22: Hoare triple {644#false} assume !(~n < 1); {644#false} is VALID [2020-07-29 01:29:23,588 INFO L280 TraceCheckUtils]: 23: Hoare triple {644#false} assume 1 == ~n;#res := 1; {644#false} is VALID [2020-07-29 01:29:23,588 INFO L280 TraceCheckUtils]: 24: Hoare triple {644#false} assume true; {644#false} is VALID [2020-07-29 01:29:23,589 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {644#false} {644#false} #33#return; {644#false} is VALID [2020-07-29 01:29:23,589 INFO L263 TraceCheckUtils]: 26: Hoare triple {644#false} call #t~ret1 := fibonacci(~n - 2); {644#false} is VALID [2020-07-29 01:29:23,589 INFO L280 TraceCheckUtils]: 27: Hoare triple {644#false} ~n := #in~n; {644#false} is VALID [2020-07-29 01:29:23,590 INFO L280 TraceCheckUtils]: 28: Hoare triple {644#false} assume ~n < 1;#res := 0; {644#false} is VALID [2020-07-29 01:29:23,590 INFO L280 TraceCheckUtils]: 29: Hoare triple {644#false} assume true; {644#false} is VALID [2020-07-29 01:29:23,590 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {644#false} {644#false} #35#return; {644#false} is VALID [2020-07-29 01:29:23,590 INFO L280 TraceCheckUtils]: 31: Hoare triple {644#false} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {644#false} is VALID [2020-07-29 01:29:23,590 INFO L280 TraceCheckUtils]: 32: Hoare triple {644#false} assume true; {644#false} is VALID [2020-07-29 01:29:23,591 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {644#false} {644#false} #33#return; {644#false} is VALID [2020-07-29 01:29:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-29 01:29:23,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:23,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:29:23,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081836530] [2020-07-29 01:29:23,985 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:23,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:23,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:23,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:23,986 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:23,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:23,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:23,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2020-07-29 01:29:23,986 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:23,986 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:23,994 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 01:29:24,000 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 01:29:24,004 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 01:29:24,007 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 01:29:24,144 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:24,145 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:29:24,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:24,149 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,153 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:24,153 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=1} Honda state: {fibonacci_#t~ret0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 01:29:24,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:24,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:24,181 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:24,181 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:24,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:24,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:24,212 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:24,236 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:24,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,342 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:25,345 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:25,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:25,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:25,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:25,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:25,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:25,346 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:25,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2020-07-29 01:29:25,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:25,346 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:25,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 01:29:25,361 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 01:29:25,366 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 01:29:25,386 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 01:29:25,528 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:25,528 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,532 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 01:29:25,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,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 01:29:25,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,592 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 01:29:25,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:25,609 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:25,609 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:25,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:25,613 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:25,613 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:25,613 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,638 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:25,648 INFO L393 LassoCheck]: Loop: "call #t~ret1 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#33#return;" "call #t~ret1 := fibonacci(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0;" "assume true;" >"#33#return;" [2020-07-29 01:29:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:25,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:25,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:25,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {781#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {781#unseeded} is VALID [2020-07-29 01:29:25,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#unseeded} assume !(main_~x~0 < 1); {781#unseeded} is VALID [2020-07-29 01:29:25,750 INFO L263 TraceCheckUtils]: 2: Hoare triple {781#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {781#unseeded} is VALID [2020-07-29 01:29:25,751 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#unseeded} ~n := #in~n; {781#unseeded} is VALID [2020-07-29 01:29:25,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#unseeded} assume !(~n < 1); {781#unseeded} is VALID [2020-07-29 01:29:25,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#unseeded} assume !(1 == ~n); {781#unseeded} is VALID [2020-07-29 01:29:25,753 INFO L263 TraceCheckUtils]: 6: Hoare triple {781#unseeded} call #t~ret0 := fibonacci(~n - 1); {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:25,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:25,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:25,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:25,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:25,756 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {817#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {781#unseeded} #33#return; {781#unseeded} is VALID [2020-07-29 01:29:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:25,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:29:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:25,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,321 INFO L263 TraceCheckUtils]: 0: Hoare triple {784#(>= oldRank0 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {833#(<= (+ |fibonacci_#in~n| 2) oldRank0)} is VALID [2020-07-29 01:29:26,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {833#(<= (+ |fibonacci_#in~n| 2) oldRank0)} ~n := #in~n; {837#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:26,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {837#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:26,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {837#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:26,326 INFO L263 TraceCheckUtils]: 4: Hoare triple {837#(<= (+ fibonacci_~n 2) oldRank0)} call #t~ret0 := fibonacci(~n - 1); {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:26,327 INFO L280 TraceCheckUtils]: 5: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,328 INFO L280 TraceCheckUtils]: 6: Hoare triple {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,329 INFO L263 TraceCheckUtils]: 8: Hoare triple {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:26,330 INFO L280 TraceCheckUtils]: 9: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {867#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:26,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {867#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {867#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:26,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {867#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {867#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:26,333 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {867#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {851#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} #33#return; {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,334 INFO L263 TraceCheckUtils]: 14: Hoare triple {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:26,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:26,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:26,336 INFO L280 TraceCheckUtils]: 17: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} assume true; {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:26,344 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {847#(<= |old(oldRank0)| oldRank0)} {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #35#return; {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,345 INFO L280 TraceCheckUtils]: 20: Hoare triple {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} assume true; {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:26,347 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {877#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} {837#(<= (+ fibonacci_~n 2) oldRank0)} #33#return; {794#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:29:26,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:29:26,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2020-07-29 01:29:26,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-07-29 01:29:27,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 159 states and 215 transitions. Complement of second has 48 states. [2020-07-29 01:29:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:27,186 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:27,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. cyclomatic complexity: 8 [2020-07-29 01:29:27,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:29:27,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:27,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 215 transitions. [2020-07-29 01:29:27,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 01:29:27,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,212 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 30 transitions. cyclomatic complexity: 8 [2020-07-29 01:29:27,216 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:29:27,219 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:29:27,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:27,225 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:27,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 159 states and 215 transitions. cyclomatic complexity: 61 [2020-07-29 01:29:27,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 21 examples of accepted words. [2020-07-29 01:29:27,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:27,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:27,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:27,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:29:27,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:29:27,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:29:27,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 159 letters. Loop has 159 letters. [2020-07-29 01:29:27,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 159 letters. Loop has 159 letters. [2020-07-29 01:29:27,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 159 letters. Loop has 159 letters. [2020-07-29 01:29:27,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:27,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:27,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:27,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:29:27,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:29:27,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:29:27,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:27,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:27,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:27,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:27,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:27,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:27,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:27,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:27,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:27,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:29:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:29:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:29:27,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 10 letters. [2020-07-29 01:29:27,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 10 letters. [2020-07-29 01:29:27,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 10 letters. [2020-07-29 01:29:27,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:27,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:27,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:27,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 35 letters. [2020-07-29 01:29:27,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 35 letters. [2020-07-29 01:29:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 25 letters. Loop has 35 letters. [2020-07-29 01:29:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:27,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:27,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:27,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:27,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:27,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2020-07-29 01:29:27,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 29 letters. Loop has 4 letters. [2020-07-29 01:29:27,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 29 letters. Loop has 4 letters. [2020-07-29 01:29:27,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 10 letters. [2020-07-29 01:29:27,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 10 letters. [2020-07-29 01:29:27,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 25 letters. Loop has 10 letters. [2020-07-29 01:29:27,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 72 letters. [2020-07-29 01:29:27,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 72 letters. [2020-07-29 01:29:27,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 25 letters. Loop has 72 letters. [2020-07-29 01:29:27,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:29:27,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:29:27,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 23 letters. Loop has 4 letters. [2020-07-29 01:29:27,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:29:27,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:29:27,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 21 letters. Loop has 4 letters. [2020-07-29 01:29:27,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 10 letters. [2020-07-29 01:29:27,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 29 letters. Loop has 10 letters. [2020-07-29 01:29:27,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 29 letters. Loop has 10 letters. [2020-07-29 01:29:27,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 10 letters. [2020-07-29 01:29:27,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 10 letters. [2020-07-29 01:29:27,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 27 letters. Loop has 10 letters. [2020-07-29 01:29:27,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:29:27,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:29:27,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 22 letters. Loop has 4 letters. [2020-07-29 01:29:27,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 10 letters. [2020-07-29 01:29:27,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 10 letters. [2020-07-29 01:29:27,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 10 letters. [2020-07-29 01:29:27,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 14 letters. [2020-07-29 01:29:27,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 14 letters. [2020-07-29 01:29:27,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 14 letters. [2020-07-29 01:29:27,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 4 letters. [2020-07-29 01:29:27,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 4 letters. [2020-07-29 01:29:27,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 24 letters. Loop has 4 letters. [2020-07-29 01:29:27,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 36 letters. Loop has 10 letters. [2020-07-29 01:29:27,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 10 letters. [2020-07-29 01:29:27,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 10 letters. [2020-07-29 01:29:27,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 10 letters. [2020-07-29 01:29:27,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 10 letters. [2020-07-29 01:29:27,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 28 letters. Loop has 10 letters. [2020-07-29 01:29:27,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 36 letters. Loop has 10 letters. [2020-07-29 01:29:27,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 10 letters. [2020-07-29 01:29:27,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 10 letters. [2020-07-29 01:29:27,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 36 letters. Loop has 22 letters. [2020-07-29 01:29:27,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 22 letters. [2020-07-29 01:29:27,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 36 letters. Loop has 22 letters. [2020-07-29 01:29:27,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 26 letters. [2020-07-29 01:29:27,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 26 letters. [2020-07-29 01:29:27,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 26 letters. [2020-07-29 01:29:27,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 14 letters. [2020-07-29 01:29:27,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 14 letters. [2020-07-29 01:29:27,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 159 states and 215 transitions. cyclomatic complexity: 61 Stem has 30 letters. Loop has 14 letters. [2020-07-29 01:29:27,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,333 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:29:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2020-07-29 01:29:27,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 12 letters. Loop has 22 letters. [2020-07-29 01:29:27,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 34 letters. Loop has 22 letters. [2020-07-29 01:29:27,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 12 letters. Loop has 44 letters. [2020-07-29 01:29:27,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 215 transitions. cyclomatic complexity: 61 [2020-07-29 01:29:27,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 01:29:27,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 128 states and 180 transitions. [2020-07-29 01:29:27,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-07-29 01:29:27,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-07-29 01:29:27,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 180 transitions. [2020-07-29 01:29:27,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:27,363 INFO L688 BuchiCegarLoop]: Abstraction has 128 states and 180 transitions. [2020-07-29 01:29:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 180 transitions. [2020-07-29 01:29:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2020-07-29 01:29:27,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:27,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states and 180 transitions. Second operand 106 states. [2020-07-29 01:29:27,375 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states and 180 transitions. Second operand 106 states. [2020-07-29 01:29:27,375 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand 106 states. [2020-07-29 01:29:27,376 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:27,425 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2020-07-29 01:29:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 412 transitions. [2020-07-29 01:29:27,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:27,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:27,438 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 128 states and 180 transitions. [2020-07-29 01:29:27,438 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 128 states and 180 transitions. [2020-07-29 01:29:27,439 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:27,490 INFO L93 Difference]: Finished difference Result 312 states and 432 transitions. [2020-07-29 01:29:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 432 transitions. [2020-07-29 01:29:27,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:27,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:27,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:27,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 01:29:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2020-07-29 01:29:27,508 INFO L711 BuchiCegarLoop]: Abstraction has 106 states and 140 transitions. [2020-07-29 01:29:27,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:27,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:29:27,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:29:27,510 INFO L87 Difference]: Start difference. First operand 106 states and 140 transitions. Second operand 8 states. [2020-07-29 01:29:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:27,775 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2020-07-29 01:29:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:29:27,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:29:27,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:27,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2020-07-29 01:29:27,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:27,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 53 transitions. [2020-07-29 01:29:27,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-07-29 01:29:27,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-07-29 01:29:27,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2020-07-29 01:29:27,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:27,834 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-07-29 01:29:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2020-07-29 01:29:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-07-29 01:29:27,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:27,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 53 transitions. Second operand 38 states. [2020-07-29 01:29:27,838 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 53 transitions. Second operand 38 states. [2020-07-29 01:29:27,839 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 38 states. [2020-07-29 01:29:27,840 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:27,846 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2020-07-29 01:29:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2020-07-29 01:29:27,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:27,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:27,848 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states and 53 transitions. [2020-07-29 01:29:27,848 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states and 53 transitions. [2020-07-29 01:29:27,848 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:27,855 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2020-07-29 01:29:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2020-07-29 01:29:27,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:27,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:27,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:27,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:29:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-07-29 01:29:27,859 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-29 01:29:27,859 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-29 01:29:27,859 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:27,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2020-07-29 01:29:27,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:27,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,862 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:27,862 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 01:29:27,862 INFO L794 eck$LassoCheckResult]: Stem: 2304#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 2305#L27 assume !(main_~x~0 < 1); 2293#L29 call main_#t~ret3 := fibonacci(main_~x~0);< 2310#fibonacciENTRY ~n := #in~n; 2325#L15 assume !(~n < 1); 2324#L17 assume !(1 == ~n); 2292#L20 call #t~ret0 := fibonacci(~n - 1);< 2294#fibonacciENTRY ~n := #in~n; 2301#L15 assume !(~n < 1); 2303#L17 assume !(1 == ~n); 2302#L20 call #t~ret0 := fibonacci(~n - 1);< 2294#fibonacciENTRY ~n := #in~n; 2307#L15 assume !(~n < 1); 2308#L17 assume 1 == ~n;#res := 1; 2309#fibonacciFINAL assume true; 2322#fibonacciEXIT >#33#return; 2299#L20-1 call #t~ret1 := fibonacci(~n - 2);< 2306#fibonacciENTRY ~n := #in~n; 2298#L15 assume ~n < 1;#res := 0; 2300#fibonacciFINAL assume true; 2321#fibonacciEXIT >#35#return; 2320#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2319#fibonacciFINAL assume true; 2318#fibonacciEXIT >#33#return; 2290#L20-1 [2020-07-29 01:29:27,863 INFO L796 eck$LassoCheckResult]: Loop: 2290#L20-1 call #t~ret1 := fibonacci(~n - 2);< 2291#fibonacciENTRY ~n := #in~n; 2316#L15 assume !(~n < 1); 2314#L17 assume !(1 == ~n); 2289#L20 call #t~ret0 := fibonacci(~n - 1);< 2291#fibonacciENTRY ~n := #in~n; 2316#L15 assume !(~n < 1); 2314#L17 assume !(1 == ~n); 2289#L20 call #t~ret0 := fibonacci(~n - 1);< 2291#fibonacciENTRY ~n := #in~n; 2316#L15 assume !(~n < 1); 2314#L17 assume 1 == ~n;#res := 1; 2315#fibonacciFINAL assume true; 2323#fibonacciEXIT >#33#return; 2296#L20-1 call #t~ret1 := fibonacci(~n - 2);< 2313#fibonacciENTRY ~n := #in~n; 2326#L15 assume ~n < 1;#res := 0; 2317#fibonacciFINAL assume true; 2295#fibonacciEXIT >#35#return; 2297#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 2311#fibonacciFINAL assume true; 2312#fibonacciEXIT >#33#return; 2290#L20-1 [2020-07-29 01:29:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2059413222, now seen corresponding path program 2 times [2020-07-29 01:29:27,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:27,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696314677] [2020-07-29 01:29:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,883 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -370029085, now seen corresponding path program 2 times [2020-07-29 01:29:27,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:27,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064151165] [2020-07-29 01:29:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1882223864, now seen corresponding path program 3 times [2020-07-29 01:29:27,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:27,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313300961] [2020-07-29 01:29:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:27,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:29:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} assume true; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,050 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2719#(<= |fibonacci_#in~n| 1)} {2739#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 01:29:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,067 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2699#true} {2745#(<= |fibonacci_#in~n| 2)} #35#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,070 INFO L263 TraceCheckUtils]: 3: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,071 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,072 INFO L280 TraceCheckUtils]: 5: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,073 INFO L280 TraceCheckUtils]: 6: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} assume true; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,075 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2719#(<= |fibonacci_#in~n| 1)} {2739#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,075 INFO L263 TraceCheckUtils]: 9: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 01:29:28,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,076 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,077 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2699#true} {2745#(<= |fibonacci_#in~n| 2)} #35#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,080 INFO L280 TraceCheckUtils]: 15: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} assume true; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,081 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2745#(<= |fibonacci_#in~n| 2)} {2699#true} #33#return; {2718#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:28,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-07-29 01:29:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 01:29:28,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,103 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2699#true} {2699#true} #33#return; {2699#true} is VALID [2020-07-29 01:29:28,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 01:29:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2699#true} {2699#true} #35#return; {2699#true} is VALID [2020-07-29 01:29:28,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 01:29:28,110 INFO L263 TraceCheckUtils]: 3: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,111 INFO L280 TraceCheckUtils]: 6: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 01:29:28,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,111 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2699#true} {2699#true} #33#return; {2699#true} is VALID [2020-07-29 01:29:28,112 INFO L263 TraceCheckUtils]: 9: Hoare triple {2699#true} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 01:29:28,112 INFO L280 TraceCheckUtils]: 10: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,113 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2699#true} {2699#true} #35#return; {2699#true} is VALID [2020-07-29 01:29:28,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {2699#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2699#true} is VALID [2020-07-29 01:29:28,113 INFO L280 TraceCheckUtils]: 15: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,113 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2699#true} {2700#false} #33#return; {2700#false} is VALID [2020-07-29 01:29:28,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {2699#true} is VALID [2020-07-29 01:29:28,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(main_~x~0 < 1); {2699#true} is VALID [2020-07-29 01:29:28,114 INFO L263 TraceCheckUtils]: 2: Hoare triple {2699#true} call main_#t~ret3 := fibonacci(main_~x~0); {2699#true} is VALID [2020-07-29 01:29:28,114 INFO L280 TraceCheckUtils]: 3: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,115 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,115 INFO L280 TraceCheckUtils]: 5: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 01:29:28,115 INFO L263 TraceCheckUtils]: 6: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,116 INFO L280 TraceCheckUtils]: 7: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,117 INFO L280 TraceCheckUtils]: 8: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,118 INFO L263 TraceCheckUtils]: 10: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,119 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,120 INFO L280 TraceCheckUtils]: 12: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,121 INFO L280 TraceCheckUtils]: 13: Hoare triple {2739#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,121 INFO L280 TraceCheckUtils]: 14: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} assume true; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,123 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2719#(<= |fibonacci_#in~n| 1)} {2739#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,124 INFO L263 TraceCheckUtils]: 16: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 01:29:28,124 INFO L280 TraceCheckUtils]: 17: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,124 INFO L280 TraceCheckUtils]: 18: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,124 INFO L280 TraceCheckUtils]: 19: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,126 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2699#true} {2745#(<= |fibonacci_#in~n| 2)} #35#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,127 INFO L280 TraceCheckUtils]: 21: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,127 INFO L280 TraceCheckUtils]: 22: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} assume true; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,129 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2745#(<= |fibonacci_#in~n| 2)} {2699#true} #33#return; {2718#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:28,130 INFO L263 TraceCheckUtils]: 24: Hoare triple {2718#(<= fibonacci_~n 3)} call #t~ret1 := fibonacci(~n - 2); {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,131 INFO L280 TraceCheckUtils]: 25: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:28,131 INFO L280 TraceCheckUtils]: 26: Hoare triple {2720#(<= fibonacci_~n 1)} assume !(~n < 1); {2721#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2020-07-29 01:29:28,132 INFO L280 TraceCheckUtils]: 27: Hoare triple {2721#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {2700#false} is VALID [2020-07-29 01:29:28,132 INFO L263 TraceCheckUtils]: 28: Hoare triple {2700#false} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,133 INFO L280 TraceCheckUtils]: 29: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,133 INFO L280 TraceCheckUtils]: 30: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,133 INFO L280 TraceCheckUtils]: 31: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 01:29:28,133 INFO L263 TraceCheckUtils]: 32: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,133 INFO L280 TraceCheckUtils]: 33: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,134 INFO L280 TraceCheckUtils]: 34: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,134 INFO L280 TraceCheckUtils]: 35: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 01:29:28,134 INFO L280 TraceCheckUtils]: 36: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,134 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2699#true} {2699#true} #33#return; {2699#true} is VALID [2020-07-29 01:29:28,135 INFO L263 TraceCheckUtils]: 38: Hoare triple {2699#true} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 01:29:28,135 INFO L280 TraceCheckUtils]: 39: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,135 INFO L280 TraceCheckUtils]: 40: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,135 INFO L280 TraceCheckUtils]: 41: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,135 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2699#true} {2699#true} #35#return; {2699#true} is VALID [2020-07-29 01:29:28,136 INFO L280 TraceCheckUtils]: 43: Hoare triple {2699#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2699#true} is VALID [2020-07-29 01:29:28,136 INFO L280 TraceCheckUtils]: 44: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,136 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2699#true} {2700#false} #33#return; {2700#false} is VALID [2020-07-29 01:29:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-07-29 01:29:28,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313300961] [2020-07-29 01:29:28,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140140748] [2020-07-29 01:29:28,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:28,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-29 01:29:28,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:28,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {2699#true} is VALID [2020-07-29 01:29:28,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(main_~x~0 < 1); {2699#true} is VALID [2020-07-29 01:29:28,577 INFO L263 TraceCheckUtils]: 2: Hoare triple {2699#true} call main_#t~ret3 := fibonacci(main_~x~0); {2699#true} is VALID [2020-07-29 01:29:28,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,578 INFO L280 TraceCheckUtils]: 5: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 01:29:28,578 INFO L263 TraceCheckUtils]: 6: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,579 INFO L280 TraceCheckUtils]: 7: Hoare triple {2699#true} ~n := #in~n; {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:28,580 INFO L280 TraceCheckUtils]: 8: Hoare triple {2783#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:28,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {2783#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:28,580 INFO L263 TraceCheckUtils]: 10: Hoare triple {2783#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,581 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,581 INFO L280 TraceCheckUtils]: 12: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 01:29:28,581 INFO L280 TraceCheckUtils]: 13: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 01:29:28,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,583 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2699#true} {2783#(<= |fibonacci_#in~n| fibonacci_~n)} #33#return; {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:28,583 INFO L263 TraceCheckUtils]: 16: Hoare triple {2783#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 01:29:28,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {2699#true} ~n := #in~n; {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:28,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {2783#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {2817#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:28,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {2817#(<= |fibonacci_#in~n| 0)} assume true; {2817#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:28,587 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2817#(<= |fibonacci_#in~n| 0)} {2783#(<= |fibonacci_#in~n| fibonacci_~n)} #35#return; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,590 INFO L280 TraceCheckUtils]: 22: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} assume true; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:28,591 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2745#(<= |fibonacci_#in~n| 2)} {2699#true} #33#return; {2718#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:28,593 INFO L263 TraceCheckUtils]: 24: Hoare triple {2718#(<= fibonacci_~n 3)} call #t~ret1 := fibonacci(~n - 2); {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:28,593 INFO L280 TraceCheckUtils]: 25: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:28,594 INFO L280 TraceCheckUtils]: 26: Hoare triple {2720#(<= fibonacci_~n 1)} assume !(~n < 1); {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:28,595 INFO L280 TraceCheckUtils]: 27: Hoare triple {2720#(<= fibonacci_~n 1)} assume !(1 == ~n); {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:28,595 INFO L263 TraceCheckUtils]: 28: Hoare triple {2720#(<= fibonacci_~n 1)} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,596 INFO L280 TraceCheckUtils]: 29: Hoare triple {2699#true} ~n := #in~n; {2851#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,596 INFO L280 TraceCheckUtils]: 30: Hoare triple {2851#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2851#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,597 INFO L280 TraceCheckUtils]: 31: Hoare triple {2851#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2851#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,597 INFO L263 TraceCheckUtils]: 32: Hoare triple {2851#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 01:29:28,598 INFO L280 TraceCheckUtils]: 33: Hoare triple {2699#true} ~n := #in~n; {2851#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,599 INFO L280 TraceCheckUtils]: 34: Hoare triple {2851#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2867#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,600 INFO L280 TraceCheckUtils]: 35: Hoare triple {2867#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2867#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,601 INFO L280 TraceCheckUtils]: 36: Hoare triple {2867#(<= 1 |fibonacci_#in~n|)} assume true; {2867#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,602 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2867#(<= 1 |fibonacci_#in~n|)} {2851#(<= fibonacci_~n |fibonacci_#in~n|)} #33#return; {2877#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,603 INFO L263 TraceCheckUtils]: 38: Hoare triple {2877#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 01:29:28,603 INFO L280 TraceCheckUtils]: 39: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 01:29:28,603 INFO L280 TraceCheckUtils]: 40: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 01:29:28,603 INFO L280 TraceCheckUtils]: 41: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 01:29:28,605 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2699#true} {2877#(<= 2 |fibonacci_#in~n|)} #35#return; {2877#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,605 INFO L280 TraceCheckUtils]: 43: Hoare triple {2877#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2877#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,606 INFO L280 TraceCheckUtils]: 44: Hoare triple {2877#(<= 2 |fibonacci_#in~n|)} assume true; {2877#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:28,607 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2877#(<= 2 |fibonacci_#in~n|)} {2720#(<= fibonacci_~n 1)} #33#return; {2700#false} is VALID [2020-07-29 01:29:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-29 01:29:28,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:28,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2020-07-29 01:29:28,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41014449] [2020-07-29 01:29:28,900 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:28,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:28,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:28,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:28,901 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:28,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:28,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:28,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:28,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2020-07-29 01:29:28,902 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:28,902 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:28,914 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 01:29:28,922 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 01:29:28,927 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 01:29:28,931 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 01:29:29,030 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:29,030 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:29:29,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:29,039 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 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 01:29:29,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:29,087 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 01:29:30,133 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:30,135 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:30,135 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:30,135 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:30,135 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:30,135 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:30,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:30,135 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:30,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2020-07-29 01:29:30,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:30,136 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:30,140 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 01:29:30,148 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 01:29:30,151 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 01:29:30,154 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 01:29:30,250 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:30,251 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:29:30,255 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:30,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:30,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:30,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:30,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:30,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:30,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:30,259 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,282 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 01:29:30,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:30,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:30,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:30,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:30,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:30,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:30,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:30,287 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,310 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 01:29:30,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:30,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:30,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:30,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:30,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:30,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:30,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:30,313 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,335 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 01:29:30,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:30,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:30,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:30,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:30,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:30,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:30,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:30,344 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:30,354 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:30,354 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:30,357 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:30,357 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:30,357 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-07-29 01:29:30,380 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:30,382 INFO L393 LassoCheck]: Loop: "call #t~ret1 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#33#return;" "call #t~ret1 := fibonacci(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0;" "assume true;" >"#33#return;" [2020-07-29 01:29:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:29:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:30,491 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:30,502 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:30,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {2899#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {2899#unseeded} is VALID [2020-07-29 01:29:30,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {2899#unseeded} assume !(main_~x~0 < 1); {2899#unseeded} is VALID [2020-07-29 01:29:30,510 INFO L263 TraceCheckUtils]: 2: Hoare triple {2899#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {2899#unseeded} is VALID [2020-07-29 01:29:30,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {2899#unseeded} ~n := #in~n; {2899#unseeded} is VALID [2020-07-29 01:29:30,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {2899#unseeded} assume !(~n < 1); {2899#unseeded} is VALID [2020-07-29 01:29:30,519 INFO L280 TraceCheckUtils]: 5: Hoare triple {2899#unseeded} assume !(1 == ~n); {2899#unseeded} is VALID [2020-07-29 01:29:30,522 INFO L263 TraceCheckUtils]: 6: Hoare triple {2899#unseeded} call #t~ret0 := fibonacci(~n - 1); {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,526 INFO L263 TraceCheckUtils]: 10: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,529 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,530 INFO L263 TraceCheckUtils]: 16: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,531 INFO L280 TraceCheckUtils]: 17: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,532 INFO L280 TraceCheckUtils]: 18: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,532 INFO L280 TraceCheckUtils]: 19: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,534 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,535 INFO L280 TraceCheckUtils]: 21: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,535 INFO L280 TraceCheckUtils]: 22: Hoare triple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:30,537 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2935#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2899#unseeded} #33#return; {2899#unseeded} is VALID [2020-07-29 01:29:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:29:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:31,134 INFO L263 TraceCheckUtils]: 0: Hoare triple {2902#(>= oldRank0 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {2987#(<= (+ |fibonacci_#in~n| 2) oldRank0)} is VALID [2020-07-29 01:29:31,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {2987#(<= (+ |fibonacci_#in~n| 2) oldRank0)} ~n := #in~n; {2991#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:31,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {2991#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {2991#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:31,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {2991#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {2991#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:31,137 INFO L263 TraceCheckUtils]: 4: Hoare triple {2991#(<= (+ fibonacci_~n 2) oldRank0)} call #t~ret0 := fibonacci(~n - 1); {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:31,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,139 INFO L280 TraceCheckUtils]: 7: Hoare triple {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,140 INFO L263 TraceCheckUtils]: 8: Hoare triple {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:31,140 INFO L280 TraceCheckUtils]: 9: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,141 INFO L280 TraceCheckUtils]: 10: Hoare triple {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {3021#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:31,142 INFO L280 TraceCheckUtils]: 11: Hoare triple {3021#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {3021#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:31,142 INFO L280 TraceCheckUtils]: 12: Hoare triple {3021#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3021#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:31,144 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3021#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3005#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} #33#return; {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,144 INFO L263 TraceCheckUtils]: 14: Hoare triple {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:31,145 INFO L280 TraceCheckUtils]: 15: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:31,145 INFO L280 TraceCheckUtils]: 16: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:31,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} assume true; {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:31,147 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3001#(<= |old(oldRank0)| oldRank0)} {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #35#return; {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,148 INFO L280 TraceCheckUtils]: 19: Hoare triple {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,150 INFO L280 TraceCheckUtils]: 20: Hoare triple {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} assume true; {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:31,151 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3031#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} {2991#(<= (+ fibonacci_~n 2) oldRank0)} #33#return; {2912#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:29:31,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:29:31,219 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 01:29:31,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2020-07-29 01:29:31,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 01:29:31,444 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 45 states and 54 transitions. Complement of second has 11 states. [2020-07-29 01:29:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:31,444 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:31,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:31,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:29:31,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:31,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:31,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2020-07-29 01:29:31,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:31,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,449 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:31,452 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:31,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:29:31,453 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:31,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 17 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:31,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:31,454 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:31,454 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:31,456 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:31,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:29:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:29:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:29:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:31,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:31,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:31,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:31,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:31,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:31,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:31,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:31,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:31,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:31,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:31,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:31,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:31,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:31,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:31,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:31,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:31,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:31,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:31,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:31,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:31,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:31,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:31,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:31,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:31,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:31,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:31,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:31,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:31,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:31,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:31,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:31,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,478 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:29:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-29 01:29:31,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:31,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,480 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:29:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:31,576 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:31,586 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:31,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {2899#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {2899#unseeded} is VALID [2020-07-29 01:29:31,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {2899#unseeded} assume !(main_~x~0 < 1); {2899#unseeded} is VALID [2020-07-29 01:29:31,598 INFO L263 TraceCheckUtils]: 2: Hoare triple {2899#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {2899#unseeded} is VALID [2020-07-29 01:29:31,599 INFO L280 TraceCheckUtils]: 3: Hoare triple {2899#unseeded} ~n := #in~n; {2899#unseeded} is VALID [2020-07-29 01:29:31,599 INFO L280 TraceCheckUtils]: 4: Hoare triple {2899#unseeded} assume !(~n < 1); {2899#unseeded} is VALID [2020-07-29 01:29:31,600 INFO L280 TraceCheckUtils]: 5: Hoare triple {2899#unseeded} assume !(1 == ~n); {2899#unseeded} is VALID [2020-07-29 01:29:31,601 INFO L263 TraceCheckUtils]: 6: Hoare triple {2899#unseeded} call #t~ret0 := fibonacci(~n - 1); {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,602 INFO L280 TraceCheckUtils]: 7: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,604 INFO L263 TraceCheckUtils]: 10: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,606 INFO L280 TraceCheckUtils]: 13: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,608 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,609 INFO L263 TraceCheckUtils]: 16: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,614 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,615 INFO L280 TraceCheckUtils]: 22: Hoare triple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:31,617 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3142#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2899#unseeded} #33#return; {2899#unseeded} is VALID [2020-07-29 01:29:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:29:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:32,079 INFO L263 TraceCheckUtils]: 0: Hoare triple {2902#(>= oldRank0 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3194#(<= (+ |fibonacci_#in~n| 2) oldRank0)} is VALID [2020-07-29 01:29:32,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {3194#(<= (+ |fibonacci_#in~n| 2) oldRank0)} ~n := #in~n; {3198#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:32,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {3198#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {3198#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:32,087 INFO L280 TraceCheckUtils]: 3: Hoare triple {3198#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {3198#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:32,088 INFO L263 TraceCheckUtils]: 4: Hoare triple {3198#(<= (+ fibonacci_~n 2) oldRank0)} call #t~ret0 := fibonacci(~n - 1); {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:32,089 INFO L280 TraceCheckUtils]: 5: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,090 INFO L280 TraceCheckUtils]: 7: Hoare triple {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,091 INFO L263 TraceCheckUtils]: 8: Hoare triple {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:32,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {3228#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:32,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {3228#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {3228#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:32,094 INFO L280 TraceCheckUtils]: 12: Hoare triple {3228#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3228#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:32,095 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3228#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3212#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} #33#return; {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,096 INFO L263 TraceCheckUtils]: 14: Hoare triple {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:32,096 INFO L280 TraceCheckUtils]: 15: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:32,097 INFO L280 TraceCheckUtils]: 16: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:32,097 INFO L280 TraceCheckUtils]: 17: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} assume true; {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:32,099 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3208#(<= |old(oldRank0)| oldRank0)} {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #35#return; {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,099 INFO L280 TraceCheckUtils]: 19: Hoare triple {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,100 INFO L280 TraceCheckUtils]: 20: Hoare triple {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} assume true; {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:32,101 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3238#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} {3198#(<= (+ fibonacci_~n 2) oldRank0)} #33#return; {2912#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:29:32,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:29:32,161 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 01:29:32,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2020-07-29 01:29:32,162 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 01:29:32,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 45 states and 54 transitions. Complement of second has 11 states. [2020-07-29 01:29:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:32,376 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:32,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:32,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:32,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:32,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:29:32,377 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:32,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:32,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2020-07-29 01:29:32,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:32,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:32,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:32,379 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:32,380 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:32,380 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:29:32,380 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:32,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 17 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:32,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:32,381 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:32,381 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:32,383 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:29:32,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:29:32,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:29:32,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:32,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:32,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:32,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:32,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:32,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:32,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:32,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:32,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:32,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:32,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:32,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:32,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:32,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:32,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:32,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:32,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:32,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:32,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:32,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:32,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:32,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:32,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:32,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:32,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:32,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:32,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:32,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:32,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:32,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:32,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:32,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:32,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:32,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:32,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:32,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:32,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,413 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:29:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-29 01:29:32,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:32,414 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:32,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:29:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:32,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:32,516 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:32,524 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:32,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {2899#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {2899#unseeded} is VALID [2020-07-29 01:29:32,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {2899#unseeded} assume !(main_~x~0 < 1); {2899#unseeded} is VALID [2020-07-29 01:29:32,529 INFO L263 TraceCheckUtils]: 2: Hoare triple {2899#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {2899#unseeded} is VALID [2020-07-29 01:29:32,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {2899#unseeded} ~n := #in~n; {2899#unseeded} is VALID [2020-07-29 01:29:32,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {2899#unseeded} assume !(~n < 1); {2899#unseeded} is VALID [2020-07-29 01:29:32,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {2899#unseeded} assume !(1 == ~n); {2899#unseeded} is VALID [2020-07-29 01:29:32,532 INFO L263 TraceCheckUtils]: 6: Hoare triple {2899#unseeded} call #t~ret0 := fibonacci(~n - 1); {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,533 INFO L280 TraceCheckUtils]: 8: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,534 INFO L263 TraceCheckUtils]: 10: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,536 INFO L280 TraceCheckUtils]: 12: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,538 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,540 INFO L263 TraceCheckUtils]: 16: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,540 INFO L280 TraceCheckUtils]: 17: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,541 INFO L280 TraceCheckUtils]: 18: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,541 INFO L280 TraceCheckUtils]: 19: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,543 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,544 INFO L280 TraceCheckUtils]: 21: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,544 INFO L280 TraceCheckUtils]: 22: Hoare triple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:32,546 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3349#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2899#unseeded} #33#return; {2899#unseeded} is VALID [2020-07-29 01:29:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:32,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:29:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:32,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:33,034 INFO L263 TraceCheckUtils]: 0: Hoare triple {2902#(>= oldRank0 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3401#(<= (+ |fibonacci_#in~n| 2) oldRank0)} is VALID [2020-07-29 01:29:33,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {3401#(<= (+ |fibonacci_#in~n| 2) oldRank0)} ~n := #in~n; {3405#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:33,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {3405#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {3405#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:33,036 INFO L280 TraceCheckUtils]: 3: Hoare triple {3405#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {3405#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 01:29:33,037 INFO L263 TraceCheckUtils]: 4: Hoare triple {3405#(<= (+ fibonacci_~n 2) oldRank0)} call #t~ret0 := fibonacci(~n - 1); {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:33,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,038 INFO L280 TraceCheckUtils]: 7: Hoare triple {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,039 INFO L263 TraceCheckUtils]: 8: Hoare triple {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:33,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} assume !(~n < 1); {3435#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:33,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {3435#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {3435#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:33,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {3435#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3435#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2020-07-29 01:29:33,043 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3435#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3419#(and (<= |old(oldRank0)| oldRank0) (<= fibonacci_~n |fibonacci_#in~n|))} #33#return; {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,044 INFO L263 TraceCheckUtils]: 14: Hoare triple {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:33,045 INFO L280 TraceCheckUtils]: 15: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:33,045 INFO L280 TraceCheckUtils]: 16: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:33,046 INFO L280 TraceCheckUtils]: 17: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} assume true; {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:29:33,047 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3415#(<= |old(oldRank0)| oldRank0)} {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #35#return; {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,047 INFO L280 TraceCheckUtils]: 20: Hoare triple {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} assume true; {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} is VALID [2020-07-29 01:29:33,050 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3445#(and (<= |old(oldRank0)| oldRank0) (<= 2 |fibonacci_#in~n|))} {3405#(<= (+ fibonacci_~n 2) oldRank0)} #33#return; {2912#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:29:33,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:29:33,111 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 01:29:33,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,112 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 7 loop predicates [2020-07-29 01:29:33,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 01:29:33,843 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 344 states and 443 transitions. Complement of second has 125 states. [2020-07-29 01:29:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:33,844 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:33,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:33,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:33,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:33,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:29:33,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:33,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:33,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:33,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 443 transitions. [2020-07-29 01:29:33,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:33,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:33,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:33,853 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:33,853 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:33,853 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:29:33,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:33,856 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:33,856 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 344 states and 443 transitions. cyclomatic complexity: 103 [2020-07-29 01:29:33,863 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:29:33,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:33,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:33,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:33,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 33 letters. Loop has 4 letters. [2020-07-29 01:29:33,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 33 letters. Loop has 4 letters. [2020-07-29 01:29:33,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 33 letters. Loop has 4 letters. [2020-07-29 01:29:33,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 344 letters. Loop has 344 letters. [2020-07-29 01:29:33,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 344 letters. Loop has 344 letters. [2020-07-29 01:29:33,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 344 letters. Loop has 344 letters. [2020-07-29 01:29:33,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:33,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:33,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 38 letters. Loop has 38 letters. [2020-07-29 01:29:33,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:29:33,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:29:33,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:29:33,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:33,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:33,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 28 letters. Loop has 4 letters. [2020-07-29 01:29:33,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:33,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:33,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 25 letters. Loop has 4 letters. [2020-07-29 01:29:33,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:33,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:33,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 27 letters. Loop has 4 letters. [2020-07-29 01:29:33,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:33,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:33,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 26 letters. Loop has 4 letters. [2020-07-29 01:29:33,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:33,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:33,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 24 letters. Loop has 34 letters. [2020-07-29 01:29:33,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:33,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:33,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:33,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 54 letters. Loop has 30 letters. [2020-07-29 01:29:33,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 01:29:33,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 54 letters. Loop has 30 letters. [2020-07-29 01:29:33,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 80 letters. Loop has 26 letters. [2020-07-29 01:29:33,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 80 letters. Loop has 26 letters. [2020-07-29 01:29:33,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 80 letters. Loop has 26 letters. [2020-07-29 01:29:33,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 61 letters. Loop has 26 letters. [2020-07-29 01:29:33,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 61 letters. Loop has 26 letters. [2020-07-29 01:29:33,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 61 letters. Loop has 26 letters. [2020-07-29 01:29:33,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 59 letters. Loop has 26 letters. [2020-07-29 01:29:33,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 59 letters. Loop has 26 letters. [2020-07-29 01:29:33,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 59 letters. Loop has 26 letters. [2020-07-29 01:29:33,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2020-07-29 01:29:33,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 4 letters. [2020-07-29 01:29:33,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 36 letters. Loop has 4 letters. [2020-07-29 01:29:33,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 33 letters. Loop has 4 letters. [2020-07-29 01:29:33,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 33 letters. Loop has 4 letters. [2020-07-29 01:29:33,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 33 letters. Loop has 4 letters. [2020-07-29 01:29:33,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 35 letters. Loop has 4 letters. [2020-07-29 01:29:33,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 35 letters. Loop has 4 letters. [2020-07-29 01:29:33,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 35 letters. Loop has 4 letters. [2020-07-29 01:29:33,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 62 letters. Loop has 26 letters. [2020-07-29 01:29:33,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 62 letters. Loop has 26 letters. [2020-07-29 01:29:33,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 62 letters. Loop has 26 letters. [2020-07-29 01:29:33,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 60 letters. Loop has 26 letters. [2020-07-29 01:29:33,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 60 letters. Loop has 26 letters. [2020-07-29 01:29:33,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 60 letters. Loop has 26 letters. [2020-07-29 01:29:33,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 34 letters. Loop has 4 letters. [2020-07-29 01:29:33,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 34 letters. Loop has 4 letters. [2020-07-29 01:29:33,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 34 letters. Loop has 4 letters. [2020-07-29 01:29:33,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 54 letters. Loop has 30 letters. [2020-07-29 01:29:33,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 01:29:33,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 54 letters. Loop has 30 letters. [2020-07-29 01:29:33,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 54 letters. Loop has 43 letters. [2020-07-29 01:29:33,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 54 letters. Loop has 43 letters. [2020-07-29 01:29:33,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 54 letters. Loop has 43 letters. [2020-07-29 01:29:33,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 80 letters. Loop has 39 letters. [2020-07-29 01:29:33,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 80 letters. Loop has 39 letters. [2020-07-29 01:29:33,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 80 letters. Loop has 39 letters. [2020-07-29 01:29:33,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 47 transitions. cyclomatic complexity: 11 Stem has 80 letters. Loop has 26 letters. [2020-07-29 01:29:33,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 80 letters. Loop has 26 letters. [2020-07-29 01:29:33,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 344 states and 443 transitions. cyclomatic complexity: 103 Stem has 80 letters. Loop has 26 letters. [2020-07-29 01:29:33,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,905 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:29:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2020-07-29 01:29:33,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 24 letters. Loop has 22 letters. [2020-07-29 01:29:33,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 46 letters. Loop has 22 letters. [2020-07-29 01:29:33,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 24 letters. Loop has 44 letters. [2020-07-29 01:29:33,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:33,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 443 transitions. cyclomatic complexity: 103 [2020-07-29 01:29:33,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:33,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 219 states and 296 transitions. [2020-07-29 01:29:33,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2020-07-29 01:29:33,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2020-07-29 01:29:33,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 296 transitions. [2020-07-29 01:29:33,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:33,943 INFO L688 BuchiCegarLoop]: Abstraction has 219 states and 296 transitions. [2020-07-29 01:29:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 296 transitions. [2020-07-29 01:29:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 171. [2020-07-29 01:29:33,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:33,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states and 296 transitions. Second operand 171 states. [2020-07-29 01:29:33,958 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states and 296 transitions. Second operand 171 states. [2020-07-29 01:29:33,958 INFO L87 Difference]: Start difference. First operand 219 states and 296 transitions. Second operand 171 states. [2020-07-29 01:29:33,958 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:34,021 INFO L93 Difference]: Finished difference Result 686 states and 957 transitions. [2020-07-29 01:29:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 957 transitions. [2020-07-29 01:29:34,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:34,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:34,027 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 219 states and 296 transitions. [2020-07-29 01:29:34,027 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 219 states and 296 transitions. [2020-07-29 01:29:34,028 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:34,089 INFO L93 Difference]: Finished difference Result 746 states and 1045 transitions. [2020-07-29 01:29:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1045 transitions. [2020-07-29 01:29:34,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:34,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:34,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:34,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-29 01:29:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 222 transitions. [2020-07-29 01:29:34,100 INFO L711 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2020-07-29 01:29:34,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:29:34,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:29:34,101 INFO L87 Difference]: Start difference. First operand 171 states and 222 transitions. Second operand 13 states. [2020-07-29 01:29:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:34,766 INFO L93 Difference]: Finished difference Result 272 states and 373 transitions. [2020-07-29 01:29:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:29:34,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:29:34,854 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 01:29:34,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 373 transitions. [2020-07-29 01:29:34,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:34,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 271 states and 371 transitions. [2020-07-29 01:29:34,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2020-07-29 01:29:34,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2020-07-29 01:29:34,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 371 transitions. [2020-07-29 01:29:34,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:34,894 INFO L688 BuchiCegarLoop]: Abstraction has 271 states and 371 transitions. [2020-07-29 01:29:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 371 transitions. [2020-07-29 01:29:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 217. [2020-07-29 01:29:34,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:34,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states and 371 transitions. Second operand 217 states. [2020-07-29 01:29:34,926 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states and 371 transitions. Second operand 217 states. [2020-07-29 01:29:34,927 INFO L87 Difference]: Start difference. First operand 271 states and 371 transitions. Second operand 217 states. [2020-07-29 01:29:34,927 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:35,032 INFO L93 Difference]: Finished difference Result 963 states and 1360 transitions. [2020-07-29 01:29:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1360 transitions. [2020-07-29 01:29:35,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:35,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:35,045 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 271 states and 371 transitions. [2020-07-29 01:29:35,045 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 271 states and 371 transitions. [2020-07-29 01:29:35,046 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:35,138 INFO L93 Difference]: Finished difference Result 975 states and 1366 transitions. [2020-07-29 01:29:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1366 transitions. [2020-07-29 01:29:35,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:35,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:35,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:35,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-07-29 01:29:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 297 transitions. [2020-07-29 01:29:35,156 INFO L711 BuchiCegarLoop]: Abstraction has 217 states and 297 transitions. [2020-07-29 01:29:35,156 INFO L591 BuchiCegarLoop]: Abstraction has 217 states and 297 transitions. [2020-07-29 01:29:35,156 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:35,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. [2020-07-29 01:29:35,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:35,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:35,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:35,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 01:29:35,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:29:35,160 INFO L794 eck$LassoCheckResult]: Stem: 6868#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 6869#L27 assume !(main_~x~0 < 1); 6870#L29 call main_#t~ret3 := fibonacci(main_~x~0);< 6883#fibonacciENTRY ~n := #in~n; 6920#L15 assume !(~n < 1); 6918#L17 assume !(1 == ~n); 6911#L20 call #t~ret0 := fibonacci(~n - 1);< 6913#fibonacciENTRY ~n := #in~n; 6919#L15 assume !(~n < 1); 6917#L17 assume !(1 == ~n); 6910#L20 call #t~ret0 := fibonacci(~n - 1);< 6913#fibonacciENTRY ~n := #in~n; 6919#L15 assume !(~n < 1); 6917#L17 assume !(1 == ~n); 6910#L20 call #t~ret0 := fibonacci(~n - 1);< 6913#fibonacciENTRY ~n := #in~n; 6919#L15 assume !(~n < 1); 6917#L17 assume !(1 == ~n); 6910#L20 call #t~ret0 := fibonacci(~n - 1);< 6913#fibonacciENTRY ~n := #in~n; 6921#L15 assume !(~n < 1); 6976#L17 assume 1 == ~n;#res := 1; 6975#fibonacciFINAL assume true; 6972#fibonacciEXIT >#33#return; 6968#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6969#fibonacciENTRY ~n := #in~n; 6974#L15 assume ~n < 1;#res := 0; 6971#fibonacciFINAL assume true; 6967#fibonacciEXIT >#35#return; 6965#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6945#fibonacciFINAL assume true; 6938#fibonacciEXIT >#33#return; 6924#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6928#fibonacciENTRY ~n := #in~n; 6959#L15 assume !(~n < 1); 6933#L17 assume 1 == ~n;#res := 1; 6932#fibonacciFINAL assume true; 6923#fibonacciEXIT >#35#return; 6912#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6915#fibonacciFINAL assume true; 6909#fibonacciEXIT >#33#return; 6858#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6903#fibonacciENTRY ~n := #in~n; 6904#L15 assume !(~n < 1); 6934#L17 assume !(1 == ~n); 6857#L20 call #t~ret0 := fibonacci(~n - 1);< 6860#fibonacciENTRY ~n := #in~n; 7054#L15 assume !(~n < 1); 7055#L17 assume !(1 == ~n); 7029#L20 call #t~ret0 := fibonacci(~n - 1);< 7032#fibonacciENTRY [2020-07-29 01:29:35,160 INFO L796 eck$LassoCheckResult]: Loop: 7032#fibonacciENTRY ~n := #in~n; 7046#L15 assume !(~n < 1); 7044#L17 assume !(1 == ~n); 7030#L20 call #t~ret0 := fibonacci(~n - 1);< 7032#fibonacciENTRY [2020-07-29 01:29:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:35,161 INFO L82 PathProgramCache]: Analyzing trace with hash 446854688, now seen corresponding path program 4 times [2020-07-29 01:29:35,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:35,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888742335] [2020-07-29 01:29:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-07-29 01:29:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,416 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10402#(<= |fibonacci_#in~n| 1)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 01:29:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 01:29:35,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,423 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10367#true} {10400#(<= |fibonacci_#in~n| 2)} #35#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,425 INFO L263 TraceCheckUtils]: 3: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,427 INFO L280 TraceCheckUtils]: 6: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,428 INFO L280 TraceCheckUtils]: 7: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,430 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {10402#(<= |fibonacci_#in~n| 1)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,430 INFO L263 TraceCheckUtils]: 9: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,430 INFO L280 TraceCheckUtils]: 10: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,430 INFO L280 TraceCheckUtils]: 11: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 01:29:35,431 INFO L280 TraceCheckUtils]: 12: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,432 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {10367#true} {10400#(<= |fibonacci_#in~n| 2)} #35#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,435 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10400#(<= |fibonacci_#in~n| 2)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 01:29:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 01:29:35,442 INFO L280 TraceCheckUtils]: 3: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,443 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10367#true} {10423#(<= |fibonacci_#in~n| 3)} #35#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,449 INFO L263 TraceCheckUtils]: 7: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,451 INFO L280 TraceCheckUtils]: 11: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,452 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {10402#(<= |fibonacci_#in~n| 1)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,453 INFO L263 TraceCheckUtils]: 13: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,453 INFO L280 TraceCheckUtils]: 15: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 01:29:35,453 INFO L280 TraceCheckUtils]: 16: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,454 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {10367#true} {10400#(<= |fibonacci_#in~n| 2)} #35#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,455 INFO L280 TraceCheckUtils]: 18: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,456 INFO L280 TraceCheckUtils]: 19: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,457 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {10400#(<= |fibonacci_#in~n| 2)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,457 INFO L263 TraceCheckUtils]: 21: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,457 INFO L280 TraceCheckUtils]: 22: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,458 INFO L280 TraceCheckUtils]: 23: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,458 INFO L280 TraceCheckUtils]: 24: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 01:29:35,458 INFO L280 TraceCheckUtils]: 25: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,459 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {10367#true} {10423#(<= |fibonacci_#in~n| 3)} #35#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,460 INFO L280 TraceCheckUtils]: 27: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,460 INFO L280 TraceCheckUtils]: 28: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} assume true; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,461 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {10423#(<= |fibonacci_#in~n| 3)} {10367#true} #33#return; {10399#(<= fibonacci_~n 4)} is VALID [2020-07-29 01:29:35,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {10367#true} is VALID [2020-07-29 01:29:35,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume !(main_~x~0 < 1); {10367#true} is VALID [2020-07-29 01:29:35,463 INFO L263 TraceCheckUtils]: 2: Hoare triple {10367#true} call main_#t~ret3 := fibonacci(main_~x~0); {10367#true} is VALID [2020-07-29 01:29:35,463 INFO L280 TraceCheckUtils]: 3: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 01:29:35,464 INFO L263 TraceCheckUtils]: 6: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,464 INFO L280 TraceCheckUtils]: 7: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,465 INFO L280 TraceCheckUtils]: 8: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 01:29:35,465 INFO L263 TraceCheckUtils]: 10: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,468 INFO L263 TraceCheckUtils]: 14: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,468 INFO L280 TraceCheckUtils]: 15: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,469 INFO L280 TraceCheckUtils]: 17: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,470 INFO L263 TraceCheckUtils]: 18: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,470 INFO L280 TraceCheckUtils]: 19: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,471 INFO L280 TraceCheckUtils]: 20: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:35,472 INFO L280 TraceCheckUtils]: 21: Hoare triple {10405#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,472 INFO L280 TraceCheckUtils]: 22: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,474 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {10402#(<= |fibonacci_#in~n| 1)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,474 INFO L263 TraceCheckUtils]: 24: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,474 INFO L280 TraceCheckUtils]: 25: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,474 INFO L280 TraceCheckUtils]: 26: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 01:29:35,475 INFO L280 TraceCheckUtils]: 27: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,476 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10367#true} {10400#(<= |fibonacci_#in~n| 2)} #35#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,477 INFO L280 TraceCheckUtils]: 29: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,478 INFO L280 TraceCheckUtils]: 30: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,479 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {10400#(<= |fibonacci_#in~n| 2)} {10405#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,479 INFO L263 TraceCheckUtils]: 32: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,480 INFO L280 TraceCheckUtils]: 33: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,480 INFO L280 TraceCheckUtils]: 34: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,480 INFO L280 TraceCheckUtils]: 35: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 01:29:35,481 INFO L280 TraceCheckUtils]: 36: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,482 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {10367#true} {10423#(<= |fibonacci_#in~n| 3)} #35#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,482 INFO L280 TraceCheckUtils]: 38: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,483 INFO L280 TraceCheckUtils]: 39: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} assume true; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,484 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10423#(<= |fibonacci_#in~n| 3)} {10367#true} #33#return; {10399#(<= fibonacci_~n 4)} is VALID [2020-07-29 01:29:35,485 INFO L263 TraceCheckUtils]: 41: Hoare triple {10399#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,486 INFO L280 TraceCheckUtils]: 42: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:35,487 INFO L280 TraceCheckUtils]: 43: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(~n < 1); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:35,487 INFO L280 TraceCheckUtils]: 44: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(1 == ~n); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:35,488 INFO L263 TraceCheckUtils]: 45: Hoare triple {10401#(<= fibonacci_~n 2)} call #t~ret0 := fibonacci(~n - 1); {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,489 INFO L280 TraceCheckUtils]: 46: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {10403#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:35,490 INFO L280 TraceCheckUtils]: 47: Hoare triple {10403#(<= fibonacci_~n 1)} assume !(~n < 1); {10404#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2020-07-29 01:29:35,491 INFO L280 TraceCheckUtils]: 48: Hoare triple {10404#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {10368#false} is VALID [2020-07-29 01:29:35,491 INFO L263 TraceCheckUtils]: 49: Hoare triple {10368#false} call #t~ret0 := fibonacci(~n - 1); {10368#false} is VALID [2020-07-29 01:29:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 60 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-29 01:29:35,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888742335] [2020-07-29 01:29:35,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945367549] [2020-07-29 01:29:35,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:29:35,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:29:35,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:35,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 01:29:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:35,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:35,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {10367#true} is VALID [2020-07-29 01:29:35,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume !(main_~x~0 < 1); {10367#true} is VALID [2020-07-29 01:29:35,847 INFO L263 TraceCheckUtils]: 2: Hoare triple {10367#true} call main_#t~ret3 := fibonacci(main_~x~0); {10367#true} is VALID [2020-07-29 01:29:35,847 INFO L280 TraceCheckUtils]: 3: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 01:29:35,848 INFO L263 TraceCheckUtils]: 6: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,848 INFO L280 TraceCheckUtils]: 8: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 01:29:35,848 INFO L263 TraceCheckUtils]: 10: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,853 INFO L280 TraceCheckUtils]: 11: Hoare triple {10367#true} ~n := #in~n; {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,854 INFO L280 TraceCheckUtils]: 12: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,855 INFO L280 TraceCheckUtils]: 13: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,855 INFO L263 TraceCheckUtils]: 14: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,856 INFO L280 TraceCheckUtils]: 15: Hoare triple {10367#true} ~n := #in~n; {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,856 INFO L280 TraceCheckUtils]: 16: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,857 INFO L280 TraceCheckUtils]: 17: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,857 INFO L263 TraceCheckUtils]: 18: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 01:29:35,857 INFO L280 TraceCheckUtils]: 19: Hoare triple {10367#true} ~n := #in~n; {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,858 INFO L280 TraceCheckUtils]: 20: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:35,858 INFO L280 TraceCheckUtils]: 21: Hoare triple {10474#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,858 INFO L280 TraceCheckUtils]: 22: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,860 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {10402#(<= |fibonacci_#in~n| 1)} {10474#(<= |fibonacci_#in~n| fibonacci_~n)} #33#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,860 INFO L263 TraceCheckUtils]: 24: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,860 INFO L280 TraceCheckUtils]: 25: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,860 INFO L280 TraceCheckUtils]: 26: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 01:29:35,860 INFO L280 TraceCheckUtils]: 27: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,861 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10367#true} {10400#(<= |fibonacci_#in~n| 2)} #35#return; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,861 INFO L280 TraceCheckUtils]: 29: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,862 INFO L280 TraceCheckUtils]: 30: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,864 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {10400#(<= |fibonacci_#in~n| 2)} {10474#(<= |fibonacci_#in~n| fibonacci_~n)} #33#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,864 INFO L263 TraceCheckUtils]: 32: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 01:29:35,864 INFO L280 TraceCheckUtils]: 33: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 01:29:35,864 INFO L280 TraceCheckUtils]: 34: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 01:29:35,864 INFO L280 TraceCheckUtils]: 35: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 01:29:35,864 INFO L280 TraceCheckUtils]: 36: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 01:29:35,865 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {10367#true} {10423#(<= |fibonacci_#in~n| 3)} #35#return; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,866 INFO L280 TraceCheckUtils]: 38: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,866 INFO L280 TraceCheckUtils]: 39: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} assume true; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:35,867 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10423#(<= |fibonacci_#in~n| 3)} {10367#true} #33#return; {10399#(<= fibonacci_~n 4)} is VALID [2020-07-29 01:29:35,867 INFO L263 TraceCheckUtils]: 41: Hoare triple {10399#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:35,868 INFO L280 TraceCheckUtils]: 42: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:35,868 INFO L280 TraceCheckUtils]: 43: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(~n < 1); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:35,869 INFO L280 TraceCheckUtils]: 44: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(1 == ~n); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:35,869 INFO L263 TraceCheckUtils]: 45: Hoare triple {10401#(<= fibonacci_~n 2)} call #t~ret0 := fibonacci(~n - 1); {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:35,870 INFO L280 TraceCheckUtils]: 46: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {10403#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:35,870 INFO L280 TraceCheckUtils]: 47: Hoare triple {10403#(<= fibonacci_~n 1)} assume !(~n < 1); {10404#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2020-07-29 01:29:35,871 INFO L280 TraceCheckUtils]: 48: Hoare triple {10404#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {10368#false} is VALID [2020-07-29 01:29:35,871 INFO L263 TraceCheckUtils]: 49: Hoare triple {10368#false} call #t~ret0 := fibonacci(~n - 1); {10368#false} is VALID [2020-07-29 01:29:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 60 proven. 39 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-29 01:29:35,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:35,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 01:29:35,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035157696] [2020-07-29 01:29:35,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 927645, now seen corresponding path program 2 times [2020-07-29 01:29:35,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:35,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506139338] [2020-07-29 01:29:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:35,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:35,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:35,880 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:35,946 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:35,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:35,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:35,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:35,946 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:35,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:35,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:35,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:35,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2020-07-29 01:29:35,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:35,947 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:35,951 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 01:29:35,960 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 01:29:35,969 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 01:29:35,972 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 01:29:35,975 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 01:29:36,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:36,074 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:36,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:36,080 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:36,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:36,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:36,173 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:36,175 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:36,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:36,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:36,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:36,175 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:36,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:36,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:36,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:36,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2020-07-29 01:29:36,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:36,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:36,180 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 01:29:36,190 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 01:29:36,193 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 01:29:36,196 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 01:29:36,199 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 01:29:36,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:36,290 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:29:36,298 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 01:29:36,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:36,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:36,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:36,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:36,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:36,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:36,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:36,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:36,311 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:36,311 INFO L444 ModelExtractionUtils]: 1 out of 3 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 01:29:36,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:36,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:36,314 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:36,314 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2020-07-29 01:29:36,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:36,338 INFO L393 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< [2020-07-29 01:29:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:36,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:29:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:36,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:36,498 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:36,509 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:36,512 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:36,519 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:36,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {10588#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {10588#unseeded} is VALID [2020-07-29 01:29:36,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {10588#unseeded} assume !(main_~x~0 < 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,535 INFO L263 TraceCheckUtils]: 2: Hoare triple {10588#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {10588#unseeded} is VALID [2020-07-29 01:29:36,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:36,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:36,543 INFO L263 TraceCheckUtils]: 6: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,543 INFO L280 TraceCheckUtils]: 7: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:36,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:36,545 INFO L263 TraceCheckUtils]: 10: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,547 INFO L263 TraceCheckUtils]: 14: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,548 INFO L280 TraceCheckUtils]: 16: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,549 INFO L280 TraceCheckUtils]: 17: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,550 INFO L263 TraceCheckUtils]: 18: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,552 INFO L280 TraceCheckUtils]: 20: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,552 INFO L280 TraceCheckUtils]: 21: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,553 INFO L280 TraceCheckUtils]: 22: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,554 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,555 INFO L263 TraceCheckUtils]: 24: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,556 INFO L280 TraceCheckUtils]: 25: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,556 INFO L280 TraceCheckUtils]: 26: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,557 INFO L280 TraceCheckUtils]: 27: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,558 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,559 INFO L280 TraceCheckUtils]: 29: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,559 INFO L280 TraceCheckUtils]: 30: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,561 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,562 INFO L263 TraceCheckUtils]: 32: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,563 INFO L280 TraceCheckUtils]: 33: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,564 INFO L280 TraceCheckUtils]: 34: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,564 INFO L280 TraceCheckUtils]: 35: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,565 INFO L280 TraceCheckUtils]: 36: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,566 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,567 INFO L280 TraceCheckUtils]: 38: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,567 INFO L280 TraceCheckUtils]: 39: Hoare triple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:36,568 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10636#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10588#unseeded} #33#return; {10588#unseeded} is VALID [2020-07-29 01:29:36,569 INFO L263 TraceCheckUtils]: 41: Hoare triple {10588#unseeded} call #t~ret1 := fibonacci(~n - 2); {10588#unseeded} is VALID [2020-07-29 01:29:36,569 INFO L280 TraceCheckUtils]: 42: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:36,570 INFO L280 TraceCheckUtils]: 43: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,571 INFO L280 TraceCheckUtils]: 44: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:36,572 INFO L263 TraceCheckUtils]: 45: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,572 INFO L280 TraceCheckUtils]: 46: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:36,573 INFO L280 TraceCheckUtils]: 47: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,573 INFO L280 TraceCheckUtils]: 48: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:36,574 INFO L263 TraceCheckUtils]: 49: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:36,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:36,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:36,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {10591#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {10754#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 01:29:36,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {10754#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {10758#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:36,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {10758#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} assume !(1 == ~n); {10758#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:36,684 INFO L263 TraceCheckUtils]: 3: Hoare triple {10758#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} call #t~ret0 := fibonacci(~n - 1); {10601#(or (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)) unseeded)} is VALID [2020-07-29 01:29:36,685 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 01:29:36,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:36,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:36,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:29:36,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-07-29 01:29:36,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 239 states and 322 transitions. Complement of second has 13 states. [2020-07-29 01:29:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:36,839 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:36,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 01:29:36,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:36,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:36,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:36,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:36,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:36,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:36,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 239 states and 322 transitions. [2020-07-29 01:29:36,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:36,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:36,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:36,845 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 01:29:36,853 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:29:36,853 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:36,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:36,854 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:36,854 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 239 states and 322 transitions. cyclomatic complexity: 87 [2020-07-29 01:29:36,862 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:29:36,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:36,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:36,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:36,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 239 letters. Loop has 239 letters. [2020-07-29 01:29:36,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 239 letters. Loop has 239 letters. [2020-07-29 01:29:36,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 239 letters. Loop has 239 letters. [2020-07-29 01:29:36,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:36,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:36,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:36,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:36,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:36,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:36,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:36,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:36,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:36,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:36,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:36,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:36,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:36,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:36,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:36,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:36,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:36,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:36,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:36,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:36,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:36,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:36,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:36,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:36,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:36,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:36,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:36,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:36,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:36,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:36,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:36,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:36,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:36,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:36,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:36,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:36,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:36,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:36,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:36,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:36,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:36,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:36,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:36,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:36,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:36,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 123 letters. Loop has 39 letters. [2020-07-29 01:29:36,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 123 letters. Loop has 39 letters. [2020-07-29 01:29:36,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 123 letters. Loop has 39 letters. [2020-07-29 01:29:36,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:36,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:36,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:36,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:36,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:36,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:36,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:36,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:36,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:36,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:36,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:36,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:36,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:36,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:36,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:36,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 89 letters. Loop has 39 letters. [2020-07-29 01:29:36,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 89 letters. Loop has 39 letters. [2020-07-29 01:29:36,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 89 letters. Loop has 39 letters. [2020-07-29 01:29:36,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 90 letters. Loop has 39 letters. [2020-07-29 01:29:36,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 90 letters. Loop has 39 letters. [2020-07-29 01:29:36,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 90 letters. Loop has 39 letters. [2020-07-29 01:29:36,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:36,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:36,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:36,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 91 letters. Loop has 39 letters. [2020-07-29 01:29:36,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 91 letters. Loop has 39 letters. [2020-07-29 01:29:36,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 91 letters. Loop has 39 letters. [2020-07-29 01:29:36,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 92 letters. Loop has 39 letters. [2020-07-29 01:29:36,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 92 letters. Loop has 39 letters. [2020-07-29 01:29:36,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 92 letters. Loop has 39 letters. [2020-07-29 01:29:36,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:36,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:36,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:36,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 123 letters. Loop has 39 letters. [2020-07-29 01:29:36,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 123 letters. Loop has 39 letters. [2020-07-29 01:29:36,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 123 letters. Loop has 39 letters. [2020-07-29 01:29:36,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:36,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,918 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:29:36,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:36,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:36,920 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:36,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:29:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:37,038 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,044 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,048 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,061 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {10588#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {10588#unseeded} is VALID [2020-07-29 01:29:37,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {10588#unseeded} assume !(main_~x~0 < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,071 INFO L263 TraceCheckUtils]: 2: Hoare triple {10588#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {10588#unseeded} is VALID [2020-07-29 01:29:37,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,074 INFO L263 TraceCheckUtils]: 6: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,074 INFO L280 TraceCheckUtils]: 7: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,075 INFO L280 TraceCheckUtils]: 8: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,075 INFO L280 TraceCheckUtils]: 9: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,076 INFO L263 TraceCheckUtils]: 10: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,077 INFO L280 TraceCheckUtils]: 11: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,078 INFO L280 TraceCheckUtils]: 13: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,079 INFO L263 TraceCheckUtils]: 14: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,080 INFO L280 TraceCheckUtils]: 15: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,081 INFO L280 TraceCheckUtils]: 16: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,081 INFO L280 TraceCheckUtils]: 17: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,083 INFO L263 TraceCheckUtils]: 18: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,083 INFO L280 TraceCheckUtils]: 19: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,084 INFO L280 TraceCheckUtils]: 20: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,085 INFO L280 TraceCheckUtils]: 21: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,085 INFO L280 TraceCheckUtils]: 22: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,087 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,088 INFO L263 TraceCheckUtils]: 24: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,089 INFO L280 TraceCheckUtils]: 25: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,090 INFO L280 TraceCheckUtils]: 26: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,091 INFO L280 TraceCheckUtils]: 27: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,092 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,093 INFO L280 TraceCheckUtils]: 29: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,094 INFO L280 TraceCheckUtils]: 30: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,095 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,096 INFO L263 TraceCheckUtils]: 32: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,097 INFO L280 TraceCheckUtils]: 33: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,098 INFO L280 TraceCheckUtils]: 34: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,098 INFO L280 TraceCheckUtils]: 35: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,099 INFO L280 TraceCheckUtils]: 36: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,100 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,101 INFO L280 TraceCheckUtils]: 38: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,102 INFO L280 TraceCheckUtils]: 39: Hoare triple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,103 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {11058#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10588#unseeded} #33#return; {10588#unseeded} is VALID [2020-07-29 01:29:37,104 INFO L263 TraceCheckUtils]: 41: Hoare triple {10588#unseeded} call #t~ret1 := fibonacci(~n - 2); {10588#unseeded} is VALID [2020-07-29 01:29:37,105 INFO L280 TraceCheckUtils]: 42: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,105 INFO L280 TraceCheckUtils]: 43: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,106 INFO L280 TraceCheckUtils]: 44: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,107 INFO L263 TraceCheckUtils]: 45: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,107 INFO L280 TraceCheckUtils]: 46: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,108 INFO L280 TraceCheckUtils]: 47: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,108 INFO L280 TraceCheckUtils]: 48: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,109 INFO L263 TraceCheckUtils]: 49: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:37,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {10591#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {11176#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 01:29:37,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {11176#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {11180#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:37,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {11180#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} assume !(1 == ~n); {11180#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:37,174 INFO L263 TraceCheckUtils]: 3: Hoare triple {11180#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} call #t~ret0 := fibonacci(~n - 1); {10601#(or (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)) unseeded)} is VALID [2020-07-29 01:29:37,174 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 01:29:37,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:37,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:37,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:29:37,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-07-29 01:29:37,329 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 239 states and 322 transitions. Complement of second has 13 states. [2020-07-29 01:29:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:37,329 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:37,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 01:29:37,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:37,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:37,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:37,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:37,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:37,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:37,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 239 states and 322 transitions. [2020-07-29 01:29:37,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:37,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:37,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:37,335 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 01:29:37,336 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:29:37,336 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:37,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:37,337 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:37,337 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 239 states and 322 transitions. cyclomatic complexity: 87 [2020-07-29 01:29:37,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:29:37,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 239 letters. Loop has 239 letters. [2020-07-29 01:29:37,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 239 letters. Loop has 239 letters. [2020-07-29 01:29:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 239 letters. Loop has 239 letters. [2020-07-29 01:29:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:37,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:37,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:37,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:37,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:37,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:37,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 239 states and 322 transitions. cyclomatic complexity: 87 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,404 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:29:37,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,405 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:29:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:37,522 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,528 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,532 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,539 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:37,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {10588#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {10588#unseeded} is VALID [2020-07-29 01:29:37,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {10588#unseeded} assume !(main_~x~0 < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,550 INFO L263 TraceCheckUtils]: 2: Hoare triple {10588#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {10588#unseeded} is VALID [2020-07-29 01:29:37,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,553 INFO L263 TraceCheckUtils]: 6: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,556 INFO L263 TraceCheckUtils]: 10: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,559 INFO L263 TraceCheckUtils]: 14: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,560 INFO L280 TraceCheckUtils]: 15: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,561 INFO L280 TraceCheckUtils]: 16: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,562 INFO L280 TraceCheckUtils]: 17: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,563 INFO L263 TraceCheckUtils]: 18: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,564 INFO L280 TraceCheckUtils]: 19: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,565 INFO L280 TraceCheckUtils]: 20: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,565 INFO L280 TraceCheckUtils]: 21: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,566 INFO L280 TraceCheckUtils]: 22: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,568 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,569 INFO L263 TraceCheckUtils]: 24: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,570 INFO L280 TraceCheckUtils]: 25: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,571 INFO L280 TraceCheckUtils]: 26: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,571 INFO L280 TraceCheckUtils]: 27: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,573 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,574 INFO L280 TraceCheckUtils]: 29: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,574 INFO L280 TraceCheckUtils]: 30: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,576 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,577 INFO L263 TraceCheckUtils]: 32: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,578 INFO L280 TraceCheckUtils]: 33: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,578 INFO L280 TraceCheckUtils]: 34: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,579 INFO L280 TraceCheckUtils]: 35: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,580 INFO L280 TraceCheckUtils]: 36: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,581 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,582 INFO L280 TraceCheckUtils]: 38: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,583 INFO L280 TraceCheckUtils]: 39: Hoare triple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:37,584 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {11480#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10588#unseeded} #33#return; {10588#unseeded} is VALID [2020-07-29 01:29:37,585 INFO L263 TraceCheckUtils]: 41: Hoare triple {10588#unseeded} call #t~ret1 := fibonacci(~n - 2); {10588#unseeded} is VALID [2020-07-29 01:29:37,585 INFO L280 TraceCheckUtils]: 42: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,586 INFO L280 TraceCheckUtils]: 43: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,586 INFO L280 TraceCheckUtils]: 44: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,587 INFO L263 TraceCheckUtils]: 45: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,588 INFO L280 TraceCheckUtils]: 46: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 01:29:37,588 INFO L280 TraceCheckUtils]: 47: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,589 INFO L280 TraceCheckUtils]: 48: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 01:29:37,590 INFO L263 TraceCheckUtils]: 49: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 01:29:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:37,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:37,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {10591#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {11598#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 01:29:37,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {11598#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {11602#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:37,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {11602#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} assume !(1 == ~n); {11602#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} is VALID [2020-07-29 01:29:37,647 INFO L263 TraceCheckUtils]: 3: Hoare triple {11602#(and (<= 1 fibonacci_~n) (<= fibonacci_~n oldRank0))} call #t~ret0 := fibonacci(~n - 1); {10601#(or (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)) unseeded)} is VALID [2020-07-29 01:29:37,647 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 01:29:37,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:37,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:37,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,687 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 3 loop predicates [2020-07-29 01:29:37,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-07-29 01:29:37,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 290 states and 375 transitions. Complement of second has 14 states. [2020-07-29 01:29:37,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:37,875 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:37,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 01:29:37,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:37,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:37,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:37,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:37,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:37,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:37,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 375 transitions. [2020-07-29 01:29:37,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:37,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:37,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:37,881 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 01:29:37,881 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:29:37,881 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:37,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:37,882 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:37,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 290 states and 375 transitions. cyclomatic complexity: 89 [2020-07-29 01:29:37,886 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:29:37,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 290 letters. Loop has 290 letters. [2020-07-29 01:29:37,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 290 letters. Loop has 290 letters. [2020-07-29 01:29:37,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 290 letters. Loop has 290 letters. [2020-07-29 01:29:37,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:37,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:37,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 217 letters. Loop has 217 letters. [2020-07-29 01:29:37,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:37,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:37,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:37,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 52 letters. Loop has 4 letters. [2020-07-29 01:29:37,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 51 letters. Loop has 4 letters. [2020-07-29 01:29:37,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 87 letters. Loop has 39 letters. [2020-07-29 01:29:37,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 86 letters. Loop has 39 letters. [2020-07-29 01:29:37,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 53 letters. Loop has 4 letters. [2020-07-29 01:29:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 88 letters. Loop has 39 letters. [2020-07-29 01:29:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:37,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 81 letters. Loop has 39 letters. [2020-07-29 01:29:37,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 82 letters. Loop has 39 letters. [2020-07-29 01:29:37,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 39 letters. [2020-07-29 01:29:37,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 39 letters. [2020-07-29 01:29:37,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 85 letters. Loop has 39 letters. [2020-07-29 01:29:37,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 119 letters. Loop has 39 letters. [2020-07-29 01:29:37,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 217 states and 297 transitions. cyclomatic complexity: 84 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 43 letters. [2020-07-29 01:29:37,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,940 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:29:37,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 50 letters. Loop has 4 letters. [2020-07-29 01:29:37,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 54 letters. Loop has 4 letters. [2020-07-29 01:29:37,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 50 letters. Loop has 8 letters. [2020-07-29 01:29:37,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:37,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 375 transitions. cyclomatic complexity: 89 [2020-07-29 01:29:37,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:37,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 235 states and 318 transitions. [2020-07-29 01:29:37,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2020-07-29 01:29:37,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2020-07-29 01:29:37,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 318 transitions. [2020-07-29 01:29:37,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:37,967 INFO L688 BuchiCegarLoop]: Abstraction has 235 states and 318 transitions. [2020-07-29 01:29:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 318 transitions. [2020-07-29 01:29:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2020-07-29 01:29:37,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:37,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states and 318 transitions. Second operand 229 states. [2020-07-29 01:29:37,974 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states and 318 transitions. Second operand 229 states. [2020-07-29 01:29:37,975 INFO L87 Difference]: Start difference. First operand 235 states and 318 transitions. Second operand 229 states. [2020-07-29 01:29:37,975 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:38,058 INFO L93 Difference]: Finished difference Result 875 states and 1203 transitions. [2020-07-29 01:29:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1203 transitions. [2020-07-29 01:29:38,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:38,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:38,065 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 235 states and 318 transitions. [2020-07-29 01:29:38,066 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 235 states and 318 transitions. [2020-07-29 01:29:38,066 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:38,150 INFO L93 Difference]: Finished difference Result 875 states and 1203 transitions. [2020-07-29 01:29:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1203 transitions. [2020-07-29 01:29:38,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:38,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:38,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:38,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-29 01:29:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 311 transitions. [2020-07-29 01:29:38,165 INFO L711 BuchiCegarLoop]: Abstraction has 229 states and 311 transitions. [2020-07-29 01:29:38,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:38,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:29:38,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:29:38,167 INFO L87 Difference]: Start difference. First operand 229 states and 311 transitions. Second operand 11 states. [2020-07-29 01:29:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:38,658 INFO L93 Difference]: Finished difference Result 414 states and 604 transitions. [2020-07-29 01:29:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:29:38,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:29:38,715 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 01:29:38,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 604 transitions. [2020-07-29 01:29:38,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:38,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 401 states and 586 transitions. [2020-07-29 01:29:38,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2020-07-29 01:29:38,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2020-07-29 01:29:38,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 586 transitions. [2020-07-29 01:29:38,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:38,761 INFO L688 BuchiCegarLoop]: Abstraction has 401 states and 586 transitions. [2020-07-29 01:29:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 586 transitions. [2020-07-29 01:29:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 291. [2020-07-29 01:29:38,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:38,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states and 586 transitions. Second operand 291 states. [2020-07-29 01:29:38,774 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states and 586 transitions. Second operand 291 states. [2020-07-29 01:29:38,774 INFO L87 Difference]: Start difference. First operand 401 states and 586 transitions. Second operand 291 states. [2020-07-29 01:29:38,774 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:38,963 INFO L93 Difference]: Finished difference Result 1537 states and 2212 transitions. [2020-07-29 01:29:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2212 transitions. [2020-07-29 01:29:38,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:38,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:38,977 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 401 states and 586 transitions. [2020-07-29 01:29:38,978 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 401 states and 586 transitions. [2020-07-29 01:29:38,978 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:39,199 INFO L93 Difference]: Finished difference Result 1599 states and 2243 transitions. [2020-07-29 01:29:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2243 transitions. [2020-07-29 01:29:39,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:39,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:39,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:39,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-07-29 01:29:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-07-29 01:29:39,223 INFO L711 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 01:29:39,223 INFO L591 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 01:29:39,223 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:39,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. [2020-07-29 01:29:39,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:39,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:39,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:39,227 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 9, 8, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2020-07-29 01:29:39,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:29:39,228 INFO L794 eck$LassoCheckResult]: Stem: 15619#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 15620#L27 assume !(main_~x~0 < 1); 15621#L29 call main_#t~ret3 := fibonacci(main_~x~0);< 15632#fibonacciENTRY ~n := #in~n; 15669#L15 assume !(~n < 1); 15668#L17 assume !(1 == ~n); 15659#L20 call #t~ret0 := fibonacci(~n - 1);< 15667#fibonacciENTRY ~n := #in~n; 15739#L15 assume !(~n < 1); 15740#L17 assume !(1 == ~n); 15661#L20 call #t~ret0 := fibonacci(~n - 1);< 15663#fibonacciENTRY ~n := #in~n; 15769#L15 assume !(~n < 1); 15670#L17 assume !(1 == ~n); 15660#L20 call #t~ret0 := fibonacci(~n - 1);< 15663#fibonacciENTRY ~n := #in~n; 15769#L15 assume !(~n < 1); 15670#L17 assume !(1 == ~n); 15660#L20 call #t~ret0 := fibonacci(~n - 1);< 15663#fibonacciENTRY ~n := #in~n; 15770#L15 assume !(~n < 1); 15790#L17 assume 1 == ~n;#res := 1; 15789#fibonacciFINAL assume true; 15786#fibonacciEXIT >#33#return; 15782#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15783#fibonacciENTRY ~n := #in~n; 15788#L15 assume ~n < 1;#res := 0; 15785#fibonacciFINAL assume true; 15781#fibonacciEXIT >#35#return; 15777#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15773#fibonacciFINAL assume true; 15768#fibonacciEXIT >#33#return; 15704#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15707#fibonacciENTRY ~n := #in~n; 15743#L15 assume !(~n < 1); 15736#L17 assume 1 == ~n;#res := 1; 15645#fibonacciFINAL assume true; 15703#fibonacciEXIT >#35#return; 15693#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15691#fibonacciFINAL assume true; 15685#fibonacciEXIT >#33#return; 15682#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15687#fibonacciENTRY ~n := #in~n; 15738#L15 assume !(~n < 1); 15737#L17 assume !(1 == ~n); 15719#L20 call #t~ret0 := fibonacci(~n - 1);< 15720#fibonacciENTRY ~n := #in~n; 15825#L15 assume !(~n < 1); 15732#L17 assume 1 == ~n;#res := 1; 15730#fibonacciFINAL assume true; 15718#fibonacciEXIT >#33#return; 15698#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15702#fibonacciENTRY ~n := #in~n; 15735#L15 assume ~n < 1;#res := 0; 15734#fibonacciFINAL assume true; 15694#fibonacciEXIT >#35#return; 15701#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15689#fibonacciFINAL assume true; 15681#fibonacciEXIT >#35#return; 15662#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15665#fibonacciFINAL assume true; 15658#fibonacciEXIT >#33#return; 15644#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15652#fibonacciENTRY ~n := #in~n; 15653#L15 assume !(~n < 1); 15642#L17 assume !(1 == ~n); 15631#L20 call #t~ret0 := fibonacci(~n - 1);< 15826#fibonacciENTRY ~n := #in~n; 15848#L15 assume !(~n < 1); 15629#L17 assume !(1 == ~n); 15624#L20 call #t~ret0 := fibonacci(~n - 1);< 15605#fibonacciENTRY ~n := #in~n; 15626#L15 assume !(~n < 1); 15860#L17 assume !(1 == ~n); 15623#L20 [2020-07-29 01:29:39,228 INFO L796 eck$LassoCheckResult]: Loop: 15623#L20 call #t~ret0 := fibonacci(~n - 1);< 15605#fibonacciENTRY ~n := #in~n; 15626#L15 assume !(~n < 1); 15860#L17 assume !(1 == ~n); 15623#L20 [2020-07-29 01:29:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2117965904, now seen corresponding path program 5 times [2020-07-29 01:29:39,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:39,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768152304] [2020-07-29 01:29:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:29:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,500 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {21224#(<= |fibonacci_#in~n| 1)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 01:29:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21162#true} {21222#(<= |fibonacci_#in~n| 2)} #35#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,508 INFO L263 TraceCheckUtils]: 3: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,509 INFO L280 TraceCheckUtils]: 6: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,510 INFO L280 TraceCheckUtils]: 7: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,511 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {21224#(<= |fibonacci_#in~n| 1)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,511 INFO L263 TraceCheckUtils]: 9: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,512 INFO L280 TraceCheckUtils]: 10: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,512 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,513 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {21162#true} {21222#(<= |fibonacci_#in~n| 2)} #35#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,514 INFO L280 TraceCheckUtils]: 15: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,516 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {21222#(<= |fibonacci_#in~n| 2)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 01:29:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,521 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,523 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {21162#true} {21220#(<= |fibonacci_#in~n| 3)} #35#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,526 INFO L263 TraceCheckUtils]: 7: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,530 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {21224#(<= |fibonacci_#in~n| 1)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,530 INFO L263 TraceCheckUtils]: 13: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,530 INFO L280 TraceCheckUtils]: 14: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,531 INFO L280 TraceCheckUtils]: 16: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,532 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {21162#true} {21222#(<= |fibonacci_#in~n| 2)} #35#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,532 INFO L280 TraceCheckUtils]: 18: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,533 INFO L280 TraceCheckUtils]: 19: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,534 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {21222#(<= |fibonacci_#in~n| 2)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,534 INFO L263 TraceCheckUtils]: 21: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,535 INFO L280 TraceCheckUtils]: 22: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,535 INFO L280 TraceCheckUtils]: 23: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,535 INFO L280 TraceCheckUtils]: 24: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,535 INFO L280 TraceCheckUtils]: 25: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,536 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {21162#true} {21220#(<= |fibonacci_#in~n| 3)} #35#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,537 INFO L280 TraceCheckUtils]: 27: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,537 INFO L280 TraceCheckUtils]: 28: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,539 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {21220#(<= |fibonacci_#in~n| 3)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:29:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 01:29:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,554 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 01:29:39,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 01:29:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,558 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 01:29:39,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 01:29:39,559 INFO L263 TraceCheckUtils]: 3: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,560 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 01:29:39,560 INFO L263 TraceCheckUtils]: 9: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,561 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 01:29:39,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {21162#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21162#true} is VALID [2020-07-29 01:29:39,562 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,563 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {21162#true} {21258#(<= |fibonacci_#in~n| 4)} #35#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,565 INFO L263 TraceCheckUtils]: 3: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,573 INFO L263 TraceCheckUtils]: 7: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,575 INFO L263 TraceCheckUtils]: 11: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,596 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {21224#(<= |fibonacci_#in~n| 1)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,596 INFO L263 TraceCheckUtils]: 17: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,596 INFO L280 TraceCheckUtils]: 18: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,597 INFO L280 TraceCheckUtils]: 19: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,597 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {21162#true} {21222#(<= |fibonacci_#in~n| 2)} #35#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,598 INFO L280 TraceCheckUtils]: 22: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,598 INFO L280 TraceCheckUtils]: 23: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,599 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {21222#(<= |fibonacci_#in~n| 2)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,599 INFO L263 TraceCheckUtils]: 25: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,600 INFO L280 TraceCheckUtils]: 26: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,600 INFO L280 TraceCheckUtils]: 27: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,600 INFO L280 TraceCheckUtils]: 28: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,601 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {21162#true} {21220#(<= |fibonacci_#in~n| 3)} #35#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,602 INFO L280 TraceCheckUtils]: 31: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,602 INFO L280 TraceCheckUtils]: 32: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,604 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {21220#(<= |fibonacci_#in~n| 3)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,604 INFO L263 TraceCheckUtils]: 34: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,605 INFO L280 TraceCheckUtils]: 35: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,605 INFO L280 TraceCheckUtils]: 36: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,605 INFO L280 TraceCheckUtils]: 37: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 01:29:39,605 INFO L263 TraceCheckUtils]: 38: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,605 INFO L280 TraceCheckUtils]: 39: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,605 INFO L280 TraceCheckUtils]: 40: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,606 INFO L280 TraceCheckUtils]: 41: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,606 INFO L280 TraceCheckUtils]: 42: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,606 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 01:29:39,606 INFO L263 TraceCheckUtils]: 44: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,607 INFO L280 TraceCheckUtils]: 45: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,607 INFO L280 TraceCheckUtils]: 46: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,607 INFO L280 TraceCheckUtils]: 47: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,607 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 01:29:39,608 INFO L280 TraceCheckUtils]: 49: Hoare triple {21162#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21162#true} is VALID [2020-07-29 01:29:39,608 INFO L280 TraceCheckUtils]: 50: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,614 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {21162#true} {21258#(<= |fibonacci_#in~n| 4)} #35#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,615 INFO L280 TraceCheckUtils]: 52: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,615 INFO L280 TraceCheckUtils]: 53: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} assume true; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,616 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {21258#(<= |fibonacci_#in~n| 4)} {21162#true} #33#return; {21219#(<= fibonacci_~n 5)} is VALID [2020-07-29 01:29:39,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {21162#true} is VALID [2020-07-29 01:29:39,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(main_~x~0 < 1); {21162#true} is VALID [2020-07-29 01:29:39,619 INFO L263 TraceCheckUtils]: 2: Hoare triple {21162#true} call main_#t~ret3 := fibonacci(main_~x~0); {21162#true} is VALID [2020-07-29 01:29:39,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 01:29:39,620 INFO L263 TraceCheckUtils]: 6: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,622 INFO L263 TraceCheckUtils]: 10: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,623 INFO L280 TraceCheckUtils]: 12: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,623 INFO L263 TraceCheckUtils]: 14: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,624 INFO L280 TraceCheckUtils]: 16: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,625 INFO L280 TraceCheckUtils]: 17: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,625 INFO L263 TraceCheckUtils]: 18: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,626 INFO L280 TraceCheckUtils]: 20: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 01:29:39,626 INFO L280 TraceCheckUtils]: 21: Hoare triple {21227#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,628 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {21224#(<= |fibonacci_#in~n| 1)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,628 INFO L263 TraceCheckUtils]: 24: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,628 INFO L280 TraceCheckUtils]: 25: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,629 INFO L280 TraceCheckUtils]: 27: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,632 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {21162#true} {21222#(<= |fibonacci_#in~n| 2)} #35#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,633 INFO L280 TraceCheckUtils]: 29: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,633 INFO L280 TraceCheckUtils]: 30: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,634 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {21222#(<= |fibonacci_#in~n| 2)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,634 INFO L263 TraceCheckUtils]: 32: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,635 INFO L280 TraceCheckUtils]: 33: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,635 INFO L280 TraceCheckUtils]: 34: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,635 INFO L280 TraceCheckUtils]: 35: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,635 INFO L280 TraceCheckUtils]: 36: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,636 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {21162#true} {21220#(<= |fibonacci_#in~n| 3)} #35#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,637 INFO L280 TraceCheckUtils]: 38: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,637 INFO L280 TraceCheckUtils]: 39: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,638 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {21220#(<= |fibonacci_#in~n| 3)} {21227#(= fibonacci_~n |fibonacci_#in~n|)} #33#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,638 INFO L263 TraceCheckUtils]: 41: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,639 INFO L280 TraceCheckUtils]: 42: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,639 INFO L280 TraceCheckUtils]: 43: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,639 INFO L280 TraceCheckUtils]: 44: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 01:29:39,639 INFO L263 TraceCheckUtils]: 45: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:39,639 INFO L280 TraceCheckUtils]: 46: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,639 INFO L280 TraceCheckUtils]: 47: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:39,640 INFO L280 TraceCheckUtils]: 48: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:39,640 INFO L280 TraceCheckUtils]: 49: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,640 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 01:29:39,640 INFO L263 TraceCheckUtils]: 51: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:39,640 INFO L280 TraceCheckUtils]: 52: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:39,640 INFO L280 TraceCheckUtils]: 53: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:39,641 INFO L280 TraceCheckUtils]: 54: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,641 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 01:29:39,641 INFO L280 TraceCheckUtils]: 56: Hoare triple {21162#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21162#true} is VALID [2020-07-29 01:29:39,641 INFO L280 TraceCheckUtils]: 57: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:39,642 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {21162#true} {21258#(<= |fibonacci_#in~n| 4)} #35#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,643 INFO L280 TraceCheckUtils]: 59: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,643 INFO L280 TraceCheckUtils]: 60: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} assume true; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:39,644 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {21258#(<= |fibonacci_#in~n| 4)} {21162#true} #33#return; {21219#(<= fibonacci_~n 5)} is VALID [2020-07-29 01:29:39,645 INFO L263 TraceCheckUtils]: 62: Hoare triple {21219#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:39,646 INFO L280 TraceCheckUtils]: 63: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:39,646 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(~n < 1); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:39,647 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(1 == ~n); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:39,647 INFO L263 TraceCheckUtils]: 66: Hoare triple {21221#(<= fibonacci_~n 3)} call #t~ret0 := fibonacci(~n - 1); {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:39,648 INFO L280 TraceCheckUtils]: 67: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:39,649 INFO L280 TraceCheckUtils]: 68: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(~n < 1); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:39,649 INFO L280 TraceCheckUtils]: 69: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(1 == ~n); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:39,650 INFO L263 TraceCheckUtils]: 70: Hoare triple {21223#(<= fibonacci_~n 2)} call #t~ret0 := fibonacci(~n - 1); {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:39,651 INFO L280 TraceCheckUtils]: 71: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {21225#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:39,651 INFO L280 TraceCheckUtils]: 72: Hoare triple {21225#(<= fibonacci_~n 1)} assume !(~n < 1); {21226#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2020-07-29 01:29:39,652 INFO L280 TraceCheckUtils]: 73: Hoare triple {21226#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {21163#false} is VALID [2020-07-29 01:29:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 103 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-07-29 01:29:39,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768152304] [2020-07-29 01:29:39,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966148367] [2020-07-29 01:29:39,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 01:29:39,707 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2020-07-29 01:29:39,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:29:39,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:29:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:39,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:40,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {21162#true} is VALID [2020-07-29 01:29:40,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(main_~x~0 < 1); {21162#true} is VALID [2020-07-29 01:29:40,174 INFO L263 TraceCheckUtils]: 2: Hoare triple {21162#true} call main_#t~ret3 := fibonacci(main_~x~0); {21162#true} is VALID [2020-07-29 01:29:40,174 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:40,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:40,175 INFO L280 TraceCheckUtils]: 5: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 01:29:40,175 INFO L263 TraceCheckUtils]: 6: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:40,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,176 INFO L280 TraceCheckUtils]: 8: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,177 INFO L280 TraceCheckUtils]: 9: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,177 INFO L263 TraceCheckUtils]: 10: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:40,177 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,178 INFO L280 TraceCheckUtils]: 12: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,178 INFO L280 TraceCheckUtils]: 13: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,178 INFO L263 TraceCheckUtils]: 14: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:40,179 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,180 INFO L280 TraceCheckUtils]: 16: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,180 INFO L280 TraceCheckUtils]: 17: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,180 INFO L263 TraceCheckUtils]: 18: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:40,180 INFO L280 TraceCheckUtils]: 19: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:40,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:40,181 INFO L280 TraceCheckUtils]: 21: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:40,181 INFO L280 TraceCheckUtils]: 22: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:40,182 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {21162#true} {21340#(<= |fibonacci_#in~n| fibonacci_~n)} #33#return; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,182 INFO L263 TraceCheckUtils]: 24: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:40,183 INFO L280 TraceCheckUtils]: 25: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 01:29:40,183 INFO L280 TraceCheckUtils]: 26: Hoare triple {21340#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {21398#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:40,184 INFO L280 TraceCheckUtils]: 27: Hoare triple {21398#(<= |fibonacci_#in~n| 0)} assume true; {21398#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 01:29:40,185 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {21398#(<= |fibonacci_#in~n| 0)} {21340#(<= |fibonacci_#in~n| fibonacci_~n)} #35#return; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:40,185 INFO L280 TraceCheckUtils]: 29: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:40,186 INFO L280 TraceCheckUtils]: 30: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:40,186 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {21222#(<= |fibonacci_#in~n| 2)} {21340#(<= |fibonacci_#in~n| fibonacci_~n)} #33#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:40,187 INFO L263 TraceCheckUtils]: 32: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:40,187 INFO L280 TraceCheckUtils]: 33: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:40,187 INFO L280 TraceCheckUtils]: 34: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:40,187 INFO L280 TraceCheckUtils]: 35: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:40,187 INFO L280 TraceCheckUtils]: 36: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:40,188 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {21162#true} {21220#(<= |fibonacci_#in~n| 3)} #35#return; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:40,188 INFO L280 TraceCheckUtils]: 38: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:40,191 INFO L280 TraceCheckUtils]: 39: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:40,192 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {21220#(<= |fibonacci_#in~n| 3)} {21340#(<= |fibonacci_#in~n| fibonacci_~n)} #33#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:40,192 INFO L263 TraceCheckUtils]: 41: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:40,192 INFO L280 TraceCheckUtils]: 42: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:40,192 INFO L280 TraceCheckUtils]: 43: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:40,192 INFO L280 TraceCheckUtils]: 44: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L263 TraceCheckUtils]: 45: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L280 TraceCheckUtils]: 46: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L280 TraceCheckUtils]: 47: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L280 TraceCheckUtils]: 48: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L280 TraceCheckUtils]: 49: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L263 TraceCheckUtils]: 51: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 01:29:40,193 INFO L280 TraceCheckUtils]: 52: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 01:29:40,194 INFO L280 TraceCheckUtils]: 53: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 01:29:40,194 INFO L280 TraceCheckUtils]: 54: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:40,194 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 01:29:40,194 INFO L280 TraceCheckUtils]: 56: Hoare triple {21162#true} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21162#true} is VALID [2020-07-29 01:29:40,194 INFO L280 TraceCheckUtils]: 57: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 01:29:40,198 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {21162#true} {21258#(<= |fibonacci_#in~n| 4)} #35#return; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:40,199 INFO L280 TraceCheckUtils]: 59: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:40,199 INFO L280 TraceCheckUtils]: 60: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} assume true; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 01:29:40,200 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {21258#(<= |fibonacci_#in~n| 4)} {21162#true} #33#return; {21219#(<= fibonacci_~n 5)} is VALID [2020-07-29 01:29:40,201 INFO L263 TraceCheckUtils]: 62: Hoare triple {21219#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 01:29:40,201 INFO L280 TraceCheckUtils]: 63: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:40,201 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(~n < 1); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:40,202 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(1 == ~n); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 01:29:40,203 INFO L263 TraceCheckUtils]: 66: Hoare triple {21221#(<= fibonacci_~n 3)} call #t~ret0 := fibonacci(~n - 1); {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 01:29:40,203 INFO L280 TraceCheckUtils]: 67: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:40,203 INFO L280 TraceCheckUtils]: 68: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(~n < 1); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:40,204 INFO L280 TraceCheckUtils]: 69: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(1 == ~n); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 01:29:40,204 INFO L263 TraceCheckUtils]: 70: Hoare triple {21223#(<= fibonacci_~n 2)} call #t~ret0 := fibonacci(~n - 1); {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 01:29:40,205 INFO L280 TraceCheckUtils]: 71: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {21225#(<= fibonacci_~n 1)} is VALID [2020-07-29 01:29:40,205 INFO L280 TraceCheckUtils]: 72: Hoare triple {21225#(<= fibonacci_~n 1)} assume !(~n < 1); {21226#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2020-07-29 01:29:40,206 INFO L280 TraceCheckUtils]: 73: Hoare triple {21226#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {21163#false} is VALID [2020-07-29 01:29:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 108 proven. 109 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-07-29 01:29:40,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:29:40,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2020-07-29 01:29:40,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111099068] [2020-07-29 01:29:40,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1876965, now seen corresponding path program 3 times [2020-07-29 01:29:40,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:40,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070110760] [2020-07-29 01:29:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:40,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:40,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:40,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:40,285 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:40,286 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:40,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:40,286 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:40,286 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:40,286 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:40,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:40,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration6_Loop [2020-07-29 01:29:40,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:40,287 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:40,292 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 01:29:40,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 01:29:40,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 01:29:40,301 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 01:29:40,403 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:40,403 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:40,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:40,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:40,409 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret1=0} Honda state: {fibonacci_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:40,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:40,435 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:40,435 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:40,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:40,460 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,462 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:40,463 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret0=0} Honda state: {fibonacci_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 01:29:40,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:40,487 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:40,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:47,845 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:47,847 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:47,847 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:47,847 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:47,847 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:47,847 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:47,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:47,848 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:47,848 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:47,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration6_Loop [2020-07-29 01:29:47,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:47,848 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:47,851 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 01:29:47,854 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 01:29:47,857 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 01:29:47,860 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 01:29:47,960 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:47,960 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:29:47,964 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 01:29:47,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:47,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:47,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:47,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:47,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:47,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:47,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:47,967 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 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 01:29:47,989 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 01:29:47,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:47,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:47,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:47,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:47,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:47,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:47,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:47,993 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 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 01:29:48,020 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 01:29:48,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:48,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:48,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:48,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:48,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:48,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:48,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:48,024 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 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 01:29:48,048 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 01:29:48,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:48,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:48,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:48,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:48,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:48,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:48,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:48,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:48,055 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:48,055 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 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 01:29:48,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:48,057 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:48,057 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:48,058 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-07-29 01:29:48,079 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:48,081 INFO L393 LassoCheck]: Loop: "call #t~ret0 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2020-07-29 01:29:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 01:29:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:48,246 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,261 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,267 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,273 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,278 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,286 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,292 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,298 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {21539#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {21539#unseeded} is VALID [2020-07-29 01:29:48,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {21539#unseeded} assume !(main_~x~0 < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,307 INFO L263 TraceCheckUtils]: 2: Hoare triple {21539#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {21539#unseeded} is VALID [2020-07-29 01:29:48,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,309 INFO L280 TraceCheckUtils]: 4: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,309 INFO L280 TraceCheckUtils]: 5: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,310 INFO L263 TraceCheckUtils]: 6: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,312 INFO L263 TraceCheckUtils]: 10: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,313 INFO L280 TraceCheckUtils]: 11: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,313 INFO L280 TraceCheckUtils]: 12: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,314 INFO L263 TraceCheckUtils]: 14: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,314 INFO L280 TraceCheckUtils]: 15: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,315 INFO L280 TraceCheckUtils]: 16: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,315 INFO L280 TraceCheckUtils]: 17: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,316 INFO L263 TraceCheckUtils]: 18: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,317 INFO L280 TraceCheckUtils]: 19: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,318 INFO L280 TraceCheckUtils]: 20: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,318 INFO L280 TraceCheckUtils]: 21: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,319 INFO L280 TraceCheckUtils]: 22: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,321 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,322 INFO L263 TraceCheckUtils]: 24: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,322 INFO L280 TraceCheckUtils]: 25: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,323 INFO L280 TraceCheckUtils]: 26: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,324 INFO L280 TraceCheckUtils]: 27: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,325 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,325 INFO L280 TraceCheckUtils]: 29: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,329 INFO L280 TraceCheckUtils]: 30: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,333 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,335 INFO L263 TraceCheckUtils]: 32: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,335 INFO L280 TraceCheckUtils]: 33: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,336 INFO L280 TraceCheckUtils]: 34: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,336 INFO L280 TraceCheckUtils]: 35: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,337 INFO L280 TraceCheckUtils]: 36: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,338 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,339 INFO L280 TraceCheckUtils]: 38: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,340 INFO L280 TraceCheckUtils]: 39: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,341 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,342 INFO L263 TraceCheckUtils]: 41: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,343 INFO L280 TraceCheckUtils]: 42: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,344 INFO L280 TraceCheckUtils]: 43: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,344 INFO L280 TraceCheckUtils]: 44: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,345 INFO L263 TraceCheckUtils]: 45: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,346 INFO L280 TraceCheckUtils]: 46: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,346 INFO L280 TraceCheckUtils]: 47: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,347 INFO L280 TraceCheckUtils]: 48: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,348 INFO L280 TraceCheckUtils]: 49: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,349 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,350 INFO L263 TraceCheckUtils]: 51: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,351 INFO L280 TraceCheckUtils]: 52: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,351 INFO L280 TraceCheckUtils]: 53: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,352 INFO L280 TraceCheckUtils]: 54: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,353 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,354 INFO L280 TraceCheckUtils]: 56: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,355 INFO L280 TraceCheckUtils]: 57: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,356 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,357 INFO L280 TraceCheckUtils]: 59: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,357 INFO L280 TraceCheckUtils]: 60: Hoare triple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,358 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {21575#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21539#unseeded} #33#return; {21539#unseeded} is VALID [2020-07-29 01:29:48,359 INFO L263 TraceCheckUtils]: 62: Hoare triple {21539#unseeded} call #t~ret1 := fibonacci(~n - 2); {21539#unseeded} is VALID [2020-07-29 01:29:48,360 INFO L280 TraceCheckUtils]: 63: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,364 INFO L280 TraceCheckUtils]: 64: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,367 INFO L280 TraceCheckUtils]: 65: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,368 INFO L263 TraceCheckUtils]: 66: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,368 INFO L280 TraceCheckUtils]: 67: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,369 INFO L280 TraceCheckUtils]: 68: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,369 INFO L280 TraceCheckUtils]: 69: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,370 INFO L263 TraceCheckUtils]: 70: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,371 INFO L280 TraceCheckUtils]: 71: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,371 INFO L280 TraceCheckUtils]: 72: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,372 INFO L280 TraceCheckUtils]: 73: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:48,507 INFO L263 TraceCheckUtils]: 0: Hoare triple {21542#(>= oldRank0 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {21777#(<= (+ |fibonacci_#in~n| 1) oldRank0)} is VALID [2020-07-29 01:29:48,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {21777#(<= (+ |fibonacci_#in~n| 1) oldRank0)} ~n := #in~n; {21781#(<= (+ fibonacci_~n 1) oldRank0)} is VALID [2020-07-29 01:29:48,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {21781#(<= (+ fibonacci_~n 1) oldRank0)} assume !(~n < 1); {21785#(and (<= 1 fibonacci_~n) (<= (+ fibonacci_~n 1) oldRank0))} is VALID [2020-07-29 01:29:48,510 INFO L280 TraceCheckUtils]: 3: Hoare triple {21785#(and (<= 1 fibonacci_~n) (<= (+ fibonacci_~n 1) oldRank0))} assume !(1 == ~n); {21552#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:48,511 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 01:29:48,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:29:48,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:48,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-07-29 01:29:48,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138 Second operand 6 states. [2020-07-29 01:29:48,688 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138. Second operand 6 states. Result 300 states and 435 transitions. Complement of second has 18 states. [2020-07-29 01:29:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:48,688 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:48,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 01:29:48,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:48,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:48,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:29:48,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:48,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:48,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:48,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 435 transitions. [2020-07-29 01:29:48,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:48,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:48,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:48,694 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 01:29:48,700 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:29:48,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:29:48,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:48,702 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:48,702 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 300 states and 435 transitions. cyclomatic complexity: 139 [2020-07-29 01:29:48,708 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:29:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:48,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:48,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:48,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 300 letters. Loop has 300 letters. [2020-07-29 01:29:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 300 letters. Loop has 300 letters. [2020-07-29 01:29:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 300 letters. Loop has 300 letters. [2020-07-29 01:29:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:48,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:48,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:48,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:48,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:48,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:48,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:48,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:48,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:48,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:48,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:48,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:48,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:48,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:48,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:48,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:48,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:48,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:48,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:48,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:48,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:48,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:48,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:48,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:48,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:48,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:48,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:48,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:48,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:48,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 132 letters. Loop has 64 letters. [2020-07-29 01:29:48,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 132 letters. Loop has 64 letters. [2020-07-29 01:29:48,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 132 letters. Loop has 64 letters. [2020-07-29 01:29:48,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 133 letters. Loop has 64 letters. [2020-07-29 01:29:48,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 133 letters. Loop has 64 letters. [2020-07-29 01:29:48,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 133 letters. Loop has 64 letters. [2020-07-29 01:29:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 134 letters. Loop has 64 letters. [2020-07-29 01:29:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 64 letters. [2020-07-29 01:29:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 134 letters. Loop has 64 letters. [2020-07-29 01:29:48,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 135 letters. Loop has 64 letters. [2020-07-29 01:29:48,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 135 letters. Loop has 64 letters. [2020-07-29 01:29:48,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 135 letters. Loop has 64 letters. [2020-07-29 01:29:48,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:48,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:48,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:48,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 435 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:48,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,739 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:29:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-29 01:29:48,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:48,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:48,741 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 01:29:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:48,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:48,903 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,909 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,912 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,918 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,921 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,930 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,935 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,938 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:48,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {21539#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {21539#unseeded} is VALID [2020-07-29 01:29:48,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {21539#unseeded} assume !(main_~x~0 < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,948 INFO L263 TraceCheckUtils]: 2: Hoare triple {21539#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {21539#unseeded} is VALID [2020-07-29 01:29:48,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,950 INFO L263 TraceCheckUtils]: 6: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,953 INFO L263 TraceCheckUtils]: 10: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,954 INFO L280 TraceCheckUtils]: 11: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,954 INFO L280 TraceCheckUtils]: 12: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,955 INFO L280 TraceCheckUtils]: 13: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,956 INFO L263 TraceCheckUtils]: 14: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,956 INFO L280 TraceCheckUtils]: 15: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,957 INFO L280 TraceCheckUtils]: 16: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,958 INFO L263 TraceCheckUtils]: 18: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,959 INFO L280 TraceCheckUtils]: 19: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,959 INFO L280 TraceCheckUtils]: 20: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,960 INFO L280 TraceCheckUtils]: 21: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,960 INFO L280 TraceCheckUtils]: 22: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,962 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,962 INFO L263 TraceCheckUtils]: 24: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,963 INFO L280 TraceCheckUtils]: 25: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,964 INFO L280 TraceCheckUtils]: 26: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,964 INFO L280 TraceCheckUtils]: 27: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,965 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,966 INFO L280 TraceCheckUtils]: 29: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,966 INFO L280 TraceCheckUtils]: 30: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,968 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,969 INFO L263 TraceCheckUtils]: 32: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,969 INFO L280 TraceCheckUtils]: 33: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,970 INFO L280 TraceCheckUtils]: 34: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,970 INFO L280 TraceCheckUtils]: 35: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,971 INFO L280 TraceCheckUtils]: 36: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,972 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,973 INFO L280 TraceCheckUtils]: 38: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,973 INFO L280 TraceCheckUtils]: 39: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,974 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,975 INFO L263 TraceCheckUtils]: 41: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,976 INFO L280 TraceCheckUtils]: 42: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,976 INFO L280 TraceCheckUtils]: 43: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,977 INFO L280 TraceCheckUtils]: 44: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,978 INFO L263 TraceCheckUtils]: 45: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,978 INFO L280 TraceCheckUtils]: 46: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,979 INFO L280 TraceCheckUtils]: 47: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,979 INFO L280 TraceCheckUtils]: 48: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,980 INFO L280 TraceCheckUtils]: 49: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,981 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,982 INFO L263 TraceCheckUtils]: 51: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,983 INFO L280 TraceCheckUtils]: 52: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,983 INFO L280 TraceCheckUtils]: 53: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,984 INFO L280 TraceCheckUtils]: 54: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,985 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,986 INFO L280 TraceCheckUtils]: 56: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,986 INFO L280 TraceCheckUtils]: 57: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,988 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,988 INFO L280 TraceCheckUtils]: 59: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,989 INFO L280 TraceCheckUtils]: 60: Hoare triple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:48,990 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {22136#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21539#unseeded} #33#return; {21539#unseeded} is VALID [2020-07-29 01:29:48,991 INFO L263 TraceCheckUtils]: 62: Hoare triple {21539#unseeded} call #t~ret1 := fibonacci(~n - 2); {21539#unseeded} is VALID [2020-07-29 01:29:48,991 INFO L280 TraceCheckUtils]: 63: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,992 INFO L280 TraceCheckUtils]: 64: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,992 INFO L280 TraceCheckUtils]: 65: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,993 INFO L263 TraceCheckUtils]: 66: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,993 INFO L280 TraceCheckUtils]: 67: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,994 INFO L280 TraceCheckUtils]: 68: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,995 INFO L280 TraceCheckUtils]: 69: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:48,995 INFO L263 TraceCheckUtils]: 70: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,996 INFO L280 TraceCheckUtils]: 71: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:48,996 INFO L280 TraceCheckUtils]: 72: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:48,997 INFO L280 TraceCheckUtils]: 73: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:49,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {21542#(>= oldRank0 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {22338#(<= (+ |fibonacci_#in~n| 1) oldRank0)} is VALID [2020-07-29 01:29:49,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {22338#(<= (+ |fibonacci_#in~n| 1) oldRank0)} ~n := #in~n; {22342#(<= (+ fibonacci_~n 1) oldRank0)} is VALID [2020-07-29 01:29:49,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {22342#(<= (+ fibonacci_~n 1) oldRank0)} assume !(~n < 1); {22346#(and (<= 1 fibonacci_~n) (<= (+ fibonacci_~n 1) oldRank0))} is VALID [2020-07-29 01:29:49,133 INFO L280 TraceCheckUtils]: 3: Hoare triple {22346#(and (<= 1 fibonacci_~n) (<= (+ fibonacci_~n 1) oldRank0))} assume !(1 == ~n); {21552#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:49,133 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 01:29:49,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:29:49,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:49,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:49,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,163 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2020-07-29 01:29:49,163 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138 Second operand 6 states. [2020-07-29 01:29:49,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138. Second operand 6 states. Result 306 states and 441 transitions. Complement of second has 17 states. [2020-07-29 01:29:49,357 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 01:29:49,358 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:49,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 01:29:49,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:29:49,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:49,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 441 transitions. [2020-07-29 01:29:49,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:49,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:49,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:49,364 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 01:29:49,365 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:29:49,365 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:29:49,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:49,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:49,366 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 306 states and 441 transitions. cyclomatic complexity: 139 [2020-07-29 01:29:49,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:29:49,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:49,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:29:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:29:49,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:29:49,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:49,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:49,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 306 letters. Loop has 306 letters. [2020-07-29 01:29:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 306 letters. Loop has 306 letters. [2020-07-29 01:29:49,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 306 letters. Loop has 306 letters. [2020-07-29 01:29:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:49,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:49,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:49,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:49,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:49,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:49,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:49,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:49,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:49,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:49,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:49,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:49,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:49,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:49,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:49,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:49,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:49,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:49,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:49,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:49,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:49,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:49,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:49,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:49,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:49,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:49,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:49,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:49,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:49,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:49,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:49,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:49,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:29:49,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:29:49,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:29:49,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 198 letters. Loop has 64 letters. [2020-07-29 01:29:49,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 198 letters. Loop has 64 letters. [2020-07-29 01:29:49,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 198 letters. Loop has 64 letters. [2020-07-29 01:29:49,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 135 letters. Loop has 64 letters. [2020-07-29 01:29:49,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 135 letters. Loop has 64 letters. [2020-07-29 01:29:49,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 135 letters. Loop has 64 letters. [2020-07-29 01:29:49,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 136 letters. Loop has 64 letters. [2020-07-29 01:29:49,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 136 letters. Loop has 64 letters. [2020-07-29 01:29:49,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 136 letters. Loop has 64 letters. [2020-07-29 01:29:49,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 137 letters. Loop has 64 letters. [2020-07-29 01:29:49,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 137 letters. Loop has 64 letters. [2020-07-29 01:29:49,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 137 letters. Loop has 64 letters. [2020-07-29 01:29:49,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 138 letters. Loop has 64 letters. [2020-07-29 01:29:49,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 138 letters. Loop has 64 letters. [2020-07-29 01:29:49,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 138 letters. Loop has 64 letters. [2020-07-29 01:29:49,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 139 letters. Loop has 64 letters. [2020-07-29 01:29:49,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 139 letters. Loop has 64 letters. [2020-07-29 01:29:49,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 139 letters. Loop has 64 letters. [2020-07-29 01:29:49,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:49,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:49,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:49,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:49,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:49,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:49,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 198 letters. Loop has 64 letters. [2020-07-29 01:29:49,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 198 letters. Loop has 64 letters. [2020-07-29 01:29:49,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 198 letters. Loop has 64 letters. [2020-07-29 01:29:49,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,418 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:29:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-07-29 01:29:49,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:49,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,419 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:49,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 01:29:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:49,629 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,633 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,637 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,643 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,647 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,655 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,660 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,663 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:49,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {21539#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; {21539#unseeded} is VALID [2020-07-29 01:29:49,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {21539#unseeded} assume !(main_~x~0 < 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,676 INFO L263 TraceCheckUtils]: 2: Hoare triple {21539#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {21539#unseeded} is VALID [2020-07-29 01:29:49,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:49,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:49,680 INFO L263 TraceCheckUtils]: 6: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,680 INFO L280 TraceCheckUtils]: 7: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,681 INFO L280 TraceCheckUtils]: 9: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,682 INFO L263 TraceCheckUtils]: 10: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,683 INFO L280 TraceCheckUtils]: 11: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,684 INFO L280 TraceCheckUtils]: 13: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,685 INFO L263 TraceCheckUtils]: 14: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,686 INFO L280 TraceCheckUtils]: 15: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,686 INFO L280 TraceCheckUtils]: 16: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,687 INFO L280 TraceCheckUtils]: 17: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,688 INFO L263 TraceCheckUtils]: 18: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,688 INFO L280 TraceCheckUtils]: 19: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,689 INFO L280 TraceCheckUtils]: 21: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,691 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,692 INFO L263 TraceCheckUtils]: 24: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,693 INFO L280 TraceCheckUtils]: 25: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,694 INFO L280 TraceCheckUtils]: 27: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,695 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,696 INFO L280 TraceCheckUtils]: 29: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,697 INFO L280 TraceCheckUtils]: 30: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,698 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,699 INFO L263 TraceCheckUtils]: 32: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,699 INFO L280 TraceCheckUtils]: 33: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,700 INFO L280 TraceCheckUtils]: 34: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,700 INFO L280 TraceCheckUtils]: 35: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,701 INFO L280 TraceCheckUtils]: 36: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,702 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,703 INFO L280 TraceCheckUtils]: 38: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,703 INFO L280 TraceCheckUtils]: 39: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,705 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,706 INFO L263 TraceCheckUtils]: 41: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,706 INFO L280 TraceCheckUtils]: 42: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,707 INFO L280 TraceCheckUtils]: 43: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,707 INFO L280 TraceCheckUtils]: 44: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,708 INFO L263 TraceCheckUtils]: 45: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := fibonacci(~n - 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,709 INFO L280 TraceCheckUtils]: 46: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,709 INFO L280 TraceCheckUtils]: 47: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,710 INFO L280 TraceCheckUtils]: 48: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,710 INFO L280 TraceCheckUtils]: 49: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,712 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #33#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,713 INFO L263 TraceCheckUtils]: 51: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := fibonacci(~n - 2); {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,713 INFO L280 TraceCheckUtils]: 52: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,714 INFO L280 TraceCheckUtils]: 53: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,714 INFO L280 TraceCheckUtils]: 54: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,717 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,718 INFO L280 TraceCheckUtils]: 56: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,719 INFO L280 TraceCheckUtils]: 57: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,720 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #35#return; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,721 INFO L280 TraceCheckUtils]: 59: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,721 INFO L280 TraceCheckUtils]: 60: Hoare triple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:29:49,722 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {22704#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {21539#unseeded} #33#return; {21539#unseeded} is VALID [2020-07-29 01:29:49,723 INFO L263 TraceCheckUtils]: 62: Hoare triple {21539#unseeded} call #t~ret1 := fibonacci(~n - 2); {21539#unseeded} is VALID [2020-07-29 01:29:49,723 INFO L280 TraceCheckUtils]: 63: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:49,724 INFO L280 TraceCheckUtils]: 64: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,725 INFO L280 TraceCheckUtils]: 65: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:49,725 INFO L263 TraceCheckUtils]: 66: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,726 INFO L280 TraceCheckUtils]: 67: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:49,726 INFO L280 TraceCheckUtils]: 68: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,727 INFO L280 TraceCheckUtils]: 69: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:49,727 INFO L263 TraceCheckUtils]: 70: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,728 INFO L280 TraceCheckUtils]: 71: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 01:29:49,729 INFO L280 TraceCheckUtils]: 72: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 01:29:49,729 INFO L280 TraceCheckUtils]: 73: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 01:29:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:49,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:49,878 INFO L263 TraceCheckUtils]: 0: Hoare triple {21542#(>= oldRank0 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {22906#(<= (+ |fibonacci_#in~n| 1) oldRank0)} is VALID [2020-07-29 01:29:49,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {22906#(<= (+ |fibonacci_#in~n| 1) oldRank0)} ~n := #in~n; {22910#(<= (+ fibonacci_~n 1) oldRank0)} is VALID [2020-07-29 01:29:49,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {22910#(<= (+ fibonacci_~n 1) oldRank0)} assume !(~n < 1); {22914#(and (<= 1 fibonacci_~n) (<= (+ fibonacci_~n 1) oldRank0))} is VALID [2020-07-29 01:29:49,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {22914#(and (<= 1 fibonacci_~n) (<= (+ fibonacci_~n 1) oldRank0))} assume !(1 == ~n); {21552#(or (and (> oldRank0 fibonacci_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:49,881 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 01:29:49,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:29:49,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:49,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:49,916 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 4 loop predicates [2020-07-29 01:29:49,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138 Second operand 6 states. [2020-07-29 01:29:50,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138. Second operand 6 states. Result 353 states and 503 transitions. Complement of second has 27 states. [2020-07-29 01:29:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:50,073 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:50,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 01:29:50,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:29:50,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:50,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 353 states and 503 transitions. [2020-07-29 01:29:50,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:50,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,080 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 01:29:50,080 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:29:50,081 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:29:50,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:50,082 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:50,082 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 353 states and 503 transitions. cyclomatic complexity: 154 [2020-07-29 01:29:50,088 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:50,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:50,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:50,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:50,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:50,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:50,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:50,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:50,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:50,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:50,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 353 letters. Loop has 353 letters. [2020-07-29 01:29:50,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 353 letters. Loop has 353 letters. [2020-07-29 01:29:50,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 353 letters. Loop has 353 letters. [2020-07-29 01:29:50,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:50,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:50,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 291 letters. Loop has 291 letters. [2020-07-29 01:29:50,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:50,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:50,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:50,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:50,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:50,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 127 letters. Loop has 64 letters. [2020-07-29 01:29:50,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:50,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:50,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 128 letters. Loop has 64 letters. [2020-07-29 01:29:50,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:50,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:50,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:50,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:50,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:50,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:50,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:50,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:50,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:50,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:50,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:50,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 130 letters. Loop has 64 letters. [2020-07-29 01:29:50,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:50,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:50,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 129 letters. Loop has 64 letters. [2020-07-29 01:29:50,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:50,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:50,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 190 letters. Loop has 64 letters. [2020-07-29 01:29:50,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:50,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:50,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 130 letters. Loop has 68 letters. [2020-07-29 01:29:50,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:50,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:50,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:50,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:50,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:50,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:50,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:50,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:50,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 131 letters. Loop has 64 letters. [2020-07-29 01:29:50,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 132 letters. Loop has 64 letters. [2020-07-29 01:29:50,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 132 letters. Loop has 64 letters. [2020-07-29 01:29:50,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 132 letters. Loop has 64 letters. [2020-07-29 01:29:50,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 133 letters. Loop has 64 letters. [2020-07-29 01:29:50,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 133 letters. Loop has 64 letters. [2020-07-29 01:29:50,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 133 letters. Loop has 64 letters. [2020-07-29 01:29:50,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 134 letters. Loop has 64 letters. [2020-07-29 01:29:50,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 64 letters. [2020-07-29 01:29:50,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 134 letters. Loop has 64 letters. [2020-07-29 01:29:50,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:50,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:50,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:50,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:50,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:50,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 194 letters. Loop has 64 letters. [2020-07-29 01:29:50,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 291 states and 425 transitions. cyclomatic complexity: 138 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:50,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:50,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 134 letters. Loop has 68 letters. [2020-07-29 01:29:50,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,142 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:29:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-29 01:29:50,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 74 letters. Loop has 4 letters. [2020-07-29 01:29:50,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 78 letters. Loop has 4 letters. [2020-07-29 01:29:50,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 74 letters. Loop has 8 letters. [2020-07-29 01:29:50,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:50,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 503 transitions. cyclomatic complexity: 154 [2020-07-29 01:29:50,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:29:50,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 291 states and 425 transitions. [2020-07-29 01:29:50,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2020-07-29 01:29:50,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2020-07-29 01:29:50,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 425 transitions. [2020-07-29 01:29:50,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:50,185 INFO L688 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 01:29:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 425 transitions. [2020-07-29 01:29:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-07-29 01:29:50,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:50,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states and 425 transitions. Second operand 291 states. [2020-07-29 01:29:50,197 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states and 425 transitions. Second operand 291 states. [2020-07-29 01:29:50,197 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 291 states. [2020-07-29 01:29:50,197 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:50,351 INFO L93 Difference]: Finished difference Result 1272 states and 1776 transitions. [2020-07-29 01:29:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1776 transitions. [2020-07-29 01:29:50,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:50,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:50,360 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 291 states and 425 transitions. [2020-07-29 01:29:50,360 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 291 states and 425 transitions. [2020-07-29 01:29:50,361 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:50,507 INFO L93 Difference]: Finished difference Result 1272 states and 1776 transitions. [2020-07-29 01:29:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1776 transitions. [2020-07-29 01:29:50,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:50,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:50,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:50,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-07-29 01:29:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-07-29 01:29:50,532 INFO L711 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 01:29:50,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:50,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:29:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:29:50,536 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 14 states. [2020-07-29 01:29:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:51,623 INFO L93 Difference]: Finished difference Result 416 states and 612 transitions. [2020-07-29 01:29:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-29 01:29:51,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:29:51,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:51,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 612 transitions. [2020-07-29 01:29:51,738 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:51,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 0 states and 0 transitions. [2020-07-29 01:29:51,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:51,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:51,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:51,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:51,739 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:51,739 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:51,739 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:51,739 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:29:51,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:51,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:51,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:51,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:51 BoogieIcfgContainer [2020-07-29 01:29:51,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:51,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:51,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:51,748 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:51,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:20" (3/4) ... [2020-07-29 01:29:51,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:51,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:51,755 INFO L168 Benchmark]: Toolchain (without parser) took 32147.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 296.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:51,756 INFO L168 Benchmark]: CDTParser took 0.44 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 01:29:51,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.75 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 950.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:51,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:51,761 INFO L168 Benchmark]: Boogie Preprocessor took 20.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:51,762 INFO L168 Benchmark]: RCFGBuilder took 285.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:51,763 INFO L168 Benchmark]: BuchiAutomizer took 31419.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 302.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:51,763 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:51,771 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.44 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 278.75 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 950.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 285.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31419.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 302.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 10 terminating modules (5 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 10 locations. One nondeterministic module has affine ranking function n and consists of 10 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.3s and 7 iterations. TraceHistogramMax:13. Analysis of lassos took 16.7s. Construction of modules took 2.2s. Büchi inclusion checks took 10.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 1.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 248 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 291 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 16/46 HoareTripleCheckerStatistics: 190 SDtfs, 547 SDslu, 215 SDs, 0 SdLazy, 767 SolverSat, 369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf85 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp75 dnf100 smp100 tf110 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...