./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Fibonacci03.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive/Fibonacci03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:05:24,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:05:24,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:05:24,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:05:24,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:05:24,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:05:24,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:05:24,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:05:24,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:05:24,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:05:24,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:05:24,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:05:24,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:05:24,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:05:24,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:05:24,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:05:24,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:05:24,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:05:24,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:05:24,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:05:24,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:05:24,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:05:24,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:05:24,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:05:24,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:05:24,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:05:24,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:05:24,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:05:24,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:05:24,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:05:24,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:05:24,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:05:24,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:05:24,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:05:24,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:05:24,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:05:24,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:05:24,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:05:24,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:05:24,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:05:24,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:05:24,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:05:24,452 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:05:24,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:05:24,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:05:24,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:05:24,455 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:05:24,455 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:05:24,456 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:05:24,456 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:05:24,456 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:05:24,457 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:05:24,457 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:05:24,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:05:24,457 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:05:24,458 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:05:24,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:05:24,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:05:24,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:05:24,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:05:24,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:05:24,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:05:24,460 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:05:24,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:05:24,460 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:05:24,461 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:05:24,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:05:24,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:05:24,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:05:24,462 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:05:24,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:05:24,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:05:24,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:05:24,463 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:05:24,464 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:05:24,465 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 [2020-07-29 03:05:24,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:05:24,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:05:24,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:05:24,872 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:05:24,873 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:05:24,874 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci03.c [2020-07-29 03:05:24,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecef0d0c1/4ec67c082121414996d743c43eb60c7f/FLAG1dd87a44c [2020-07-29 03:05:25,604 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:05:25,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c [2020-07-29 03:05:25,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecef0d0c1/4ec67c082121414996d743c43eb60c7f/FLAG1dd87a44c [2020-07-29 03:05:25,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecef0d0c1/4ec67c082121414996d743c43eb60c7f [2020-07-29 03:05:25,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:05:25,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:05:25,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:05:25,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:05:25,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:05:25,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:05:25" (1/1) ... [2020-07-29 03:05:25,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40495eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:25, skipping insertion in model container [2020-07-29 03:05:25,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:05:25" (1/1) ... [2020-07-29 03:05:25,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:05:25,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:05:26,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:05:26,181 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:05:26,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:05:26,222 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:05:26,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26 WrapperNode [2020-07-29 03:05:26,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:05:26,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:05:26,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:05:26,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:05:26,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:05:26,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:05:26,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:05:26,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:05:26,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... [2020-07-29 03:05:26,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:05:26,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:05:26,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:05:26,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:05:26,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-29 03:05:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-29 03:05:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:05:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:05:26,769 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:05:26,770 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 03:05:26,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:26 BoogieIcfgContainer [2020-07-29 03:05:26,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:05:26,785 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:05:26,785 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:05:26,800 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:05:26,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:26,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:05:25" (1/3) ... [2020-07-29 03:05:26,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dcdb843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:26, skipping insertion in model container [2020-07-29 03:05:26,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:26,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:26" (2/3) ... [2020-07-29 03:05:26,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dcdb843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:26, skipping insertion in model container [2020-07-29 03:05:26,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:26,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:26" (3/3) ... [2020-07-29 03:05:26,823 INFO L371 chiAutomizerObserver]: Analyzing ICFG Fibonacci03.c [2020-07-29 03:05:26,918 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:05:26,918 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:05:26,919 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:05:26,919 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:05:26,919 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:05:26,919 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:05:26,920 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:05:26,920 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:05:26,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:05:26,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:26,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:26,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:27,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 03:05:27,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:27,002 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:05:27,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:05:27,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:27,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:27,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:27,009 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 03:05:27,009 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:27,017 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 > 46); 9#L30true call main_#t~ret3 := fibonacci(main_~x~0);< 16#fibonacciENTRYtrue [2020-07-29 03:05:27,017 INFO L796 eck$LassoCheckResult]: Loop: 16#fibonacciENTRYtrue ~n := #in~n; 14#L15true assume !(~n < 1); 6#L17true assume !(1 == ~n); 4#L20true call #t~ret0 := fibonacci(~n - 1);< 16#fibonacciENTRYtrue [2020-07-29 03:05:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 43870, now seen corresponding path program 1 times [2020-07-29 03:05:27,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:27,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389134384] [2020-07-29 03:05:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:27,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:27,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:27,160 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:27,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 927645, now seen corresponding path program 1 times [2020-07-29 03:05:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:27,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815594398] [2020-07-29 03:05:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:27,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:27,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:27,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1860164730, now seen corresponding path program 1 times [2020-07-29 03:05:27,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:27,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570173215] [2020-07-29 03:05:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:27,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:27,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:27,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:27,544 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:27,546 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:27,546 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:27,546 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:27,547 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:27,547 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:27,547 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:27,547 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:27,548 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration1_Loop [2020-07-29 03:05:27,548 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:27,548 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:27,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:27,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:27,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:27,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:27,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:27,835 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:27,837 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:27,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:27,857 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:27,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:27,875 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) [2020-07-29 03:05:27,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:27,936 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:27,946 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:27,946 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 03:05:28,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:28,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:28,007 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:28,008 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 03:05:28,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:28,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:28,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:28,059 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 03:05:28,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:28,105 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 03:05:28,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:28,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:28,218 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:28,221 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:28,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:28,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:28,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:28,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:28,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:28,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:28,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:28,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration1_Loop [2020-07-29 03:05:28,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:28,224 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:28,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:28,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:28,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:28,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:28,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:28,429 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:28,435 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 03:05:28,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:28,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:28,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:28,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:28,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:28,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:28,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:28,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:28,460 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 03:05:28,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:28,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:28,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:28,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:28,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:28,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:28,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:28,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:28,519 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:28,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:28,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:28,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:28,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:28,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:28,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:28,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:28,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:28,562 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 03:05:28,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:28,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:28,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:28,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:28,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:28,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:28,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:28,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:28,613 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 03:05:28,665 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:28,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:28,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:28,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:28,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:28,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:28,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:28,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:28,682 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:28,690 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:28,691 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:28,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:28,699 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:28,699 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:28,700 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2020-07-29 03:05:28,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:28,738 INFO L393 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< [2020-07-29 03:05:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:28,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:28,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:28,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:28,837 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 03:05:28,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume !(main_~x~0 > 46); {27#unseeded} is VALID [2020-07-29 03:05:28,843 INFO L263 TraceCheckUtils]: 2: Hoare triple {27#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {27#unseeded} is VALID [2020-07-29 03:05:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:28,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:28,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:28,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {51#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 03:05:28,976 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 03:05:28,977 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 03:05:28,980 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 03:05:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:28,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:05:29,018 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 03:05:29,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:29,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,037 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 03:05:29,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-07-29 03:05:29,362 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 03:05:29,363 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 03:05:29,363 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:29,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:05:29,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:29,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:29,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:29,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:05:29,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:29,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:29,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:29,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2020-07-29 03:05:29,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:29,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:29,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:29,391 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 03:05:29,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:29,403 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:29,404 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:05:29,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:29,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:29,416 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 62 transitions. cyclomatic complexity: 14 [2020-07-29 03:05:29,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:29,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:29,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:29,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,421 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 03:05:29,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:29,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:29,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,422 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 03:05:29,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,424 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 03:05:29,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:05:29,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:05:29,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,426 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 03:05:29,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:05:29,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:05:29,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,427 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 03:05:29,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:29,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:29,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,429 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 03:05:29,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:29,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:29,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,430 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 03:05:29,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:29,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:29,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,432 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 03:05:29,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:29,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:29,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,434 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 03:05:29,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,436 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 03:05:29,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,437 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 03:05:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,439 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 03:05:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,441 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 03:05:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,442 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 03:05:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,444 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 03:05:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,446 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 03:05:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,448 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 03:05:29,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,449 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 03:05:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 03:05:29,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,451 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 03:05:29,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,452 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:05:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:05:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 8 letters. [2020-07-29 03:05:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:29,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. cyclomatic complexity: 14 [2020-07-29 03:05:29,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:29,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 25 states and 34 transitions. [2020-07-29 03:05:29,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:05:29,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:05:29,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-07-29 03:05:29,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:29,489 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 03:05:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-07-29 03:05:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-07-29 03:05:29,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:29,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand 20 states. [2020-07-29 03:05:29,532 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand 20 states. [2020-07-29 03:05:29,536 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 20 states. [2020-07-29 03:05:29,541 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:29,551 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-07-29 03:05:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2020-07-29 03:05:29,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:29,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:29,555 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states and 34 transitions. [2020-07-29 03:05:29,555 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states and 34 transitions. [2020-07-29 03:05:29,556 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:29,567 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2020-07-29 03:05:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-29 03:05:29,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:29,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:29,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:29,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:05:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-29 03:05:29,574 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:05:29,574 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:05:29,574 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:05:29,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:05:29,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:29,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:29,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:29,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:29,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:29,578 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 > 46); 134#L30 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 03:05:29,578 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 03:05:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:29,579 INFO L82 PathProgramCache]: Analyzing trace with hash 172563538, now seen corresponding path program 1 times [2020-07-29 03:05:29,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:29,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008172626] [2020-07-29 03:05:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:29,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 03:05:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:29,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {356#true} ~n := #in~n; {364#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:29,731 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 03:05:29,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#(<= |fibonacci_#in~n| 0)} assume true; {365#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 03:05:29,734 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {365#(<= |fibonacci_#in~n| 0)} {359#(< 1 fibonacci_~n)} #33#return; {357#false} is VALID [2020-07-29 03:05:29,735 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 03:05:29,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#true} assume !(main_~x~0 > 46); {356#true} is VALID [2020-07-29 03:05:29,736 INFO L263 TraceCheckUtils]: 2: Hoare triple {356#true} call main_#t~ret3 := fibonacci(main_~x~0); {356#true} is VALID [2020-07-29 03:05:29,736 INFO L280 TraceCheckUtils]: 3: Hoare triple {356#true} ~n := #in~n; {356#true} is VALID [2020-07-29 03:05:29,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {356#true} assume !(~n < 1); {358#(< 0 fibonacci_~n)} is VALID [2020-07-29 03:05:29,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {358#(< 0 fibonacci_~n)} assume !(1 == ~n); {359#(< 1 fibonacci_~n)} is VALID [2020-07-29 03:05:29,740 INFO L263 TraceCheckUtils]: 6: Hoare triple {359#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {356#true} is VALID [2020-07-29 03:05:29,741 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#true} ~n := #in~n; {364#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:29,742 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 03:05:29,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {365#(<= |fibonacci_#in~n| 0)} assume true; {365#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 03:05:29,746 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {365#(<= |fibonacci_#in~n| 0)} {359#(< 1 fibonacci_~n)} #33#return; {357#false} is VALID [2020-07-29 03:05:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:05:29,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008172626] [2020-07-29 03:05:29,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:29,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:05:29,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289678740] [2020-07-29 03:05:29,756 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:05:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2006786507, now seen corresponding path program 1 times [2020-07-29 03:05:29,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:29,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634335815] [2020-07-29 03:05:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:29,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 03:05:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:29,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {366#true} ~n := #in~n; {374#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:29,862 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 03:05:29,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#(<= |fibonacci_#in~n| 0)} assume true; {375#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 03:05:29,865 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#(<= |fibonacci_#in~n| 0)} {369#(< 1 fibonacci_~n)} #33#return; {367#false} is VALID [2020-07-29 03:05:29,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {366#true} call #t~ret1 := fibonacci(~n - 2); {366#true} is VALID [2020-07-29 03:05:29,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {366#true} ~n := #in~n; {366#true} is VALID [2020-07-29 03:05:29,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {366#true} assume !(~n < 1); {368#(< 0 fibonacci_~n)} is VALID [2020-07-29 03:05:29,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {368#(< 0 fibonacci_~n)} assume !(1 == ~n); {369#(< 1 fibonacci_~n)} is VALID [2020-07-29 03:05:29,871 INFO L263 TraceCheckUtils]: 4: Hoare triple {369#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {366#true} is VALID [2020-07-29 03:05:29,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {366#true} ~n := #in~n; {374#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:29,874 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 03:05:29,876 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#(<= |fibonacci_#in~n| 0)} assume true; {375#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 03:05:29,879 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {375#(<= |fibonacci_#in~n| 0)} {369#(< 1 fibonacci_~n)} #33#return; {367#false} is VALID [2020-07-29 03:05:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:05:29,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634335815] [2020-07-29 03:05:29,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:29,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:05:29,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087050002] [2020-07-29 03:05:29,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:05:29,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:05:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:05:29,889 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 03:05:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:30,188 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 03:05:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:05:30,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:05:30,213 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 03:05:30,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-07-29 03:05:30,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:30,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2020-07-29 03:05:30,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:05:30,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:05:30,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2020-07-29 03:05:30,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:30,225 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 03:05:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2020-07-29 03:05:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 03:05:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:30,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 30 transitions. Second operand 24 states. [2020-07-29 03:05:30,231 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 30 transitions. Second operand 24 states. [2020-07-29 03:05:30,231 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 24 states. [2020-07-29 03:05:30,232 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:30,243 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-07-29 03:05:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2020-07-29 03:05:30,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:30,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:30,246 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states and 30 transitions. [2020-07-29 03:05:30,246 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states and 30 transitions. [2020-07-29 03:05:30,248 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:30,257 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-07-29 03:05:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2020-07-29 03:05:30,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:30,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:30,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:30,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 03:05:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-07-29 03:05:30,265 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 03:05:30,265 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 03:05:30,265 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:05:30,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-07-29 03:05:30,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:30,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:30,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:30,269 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:30,269 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 03:05:30,270 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 > 46); 412#L30 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 03:05:30,270 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 03:05:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1054526750, now seen corresponding path program 1 times [2020-07-29 03:05:30,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:30,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678766380] [2020-07-29 03:05:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:30,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:30,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:30,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:30,328 INFO L82 PathProgramCache]: Analyzing trace with hash -370029085, now seen corresponding path program 1 times [2020-07-29 03:05:30,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:30,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033947801] [2020-07-29 03:05:30,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:30,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:30,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:30,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1218656064, now seen corresponding path program 1 times [2020-07-29 03:05:30,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:30,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751098387] [2020-07-29 03:05:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 03:05:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {670#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:30,614 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 03:05:30,616 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 03:05:30,618 INFO L280 TraceCheckUtils]: 3: Hoare triple {671#(<= |fibonacci_#in~n| 1)} assume true; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:30,622 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {671#(<= |fibonacci_#in~n| 1)} {643#true} #33#return; {650#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:30,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-07-29 03:05:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:30,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#true} assume 1 == ~n;#res := 1; {643#true} is VALID [2020-07-29 03:05:30,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,675 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {643#true} {643#true} #33#return; {643#true} is VALID [2020-07-29 03:05:30,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:05:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume ~n < 1;#res := 0; {643#true} is VALID [2020-07-29 03:05:30,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,692 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {643#true} {643#true} #35#return; {643#true} is VALID [2020-07-29 03:05:30,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:30,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 03:05:30,694 INFO L263 TraceCheckUtils]: 3: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 03:05:30,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:30,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {643#true} assume 1 == ~n;#res := 1; {643#true} is VALID [2020-07-29 03:05:30,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,696 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {643#true} {643#true} #33#return; {643#true} is VALID [2020-07-29 03:05:30,696 INFO L263 TraceCheckUtils]: 9: Hoare triple {643#true} call #t~ret1 := fibonacci(~n - 2); {643#true} is VALID [2020-07-29 03:05:30,697 INFO L280 TraceCheckUtils]: 10: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {643#true} assume ~n < 1;#res := 0; {643#true} is VALID [2020-07-29 03:05:30,698 INFO L280 TraceCheckUtils]: 12: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,699 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {643#true} {643#true} #35#return; {643#true} is VALID [2020-07-29 03:05:30,699 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 03:05:30,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,700 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {643#true} {644#false} #33#return; {644#false} is VALID [2020-07-29 03:05:30,702 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 03:05:30,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(main_~x~0 > 46); {643#true} is VALID [2020-07-29 03:05:30,703 INFO L263 TraceCheckUtils]: 2: Hoare triple {643#true} call main_#t~ret3 := fibonacci(main_~x~0); {643#true} is VALID [2020-07-29 03:05:30,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:30,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 03:05:30,704 INFO L263 TraceCheckUtils]: 6: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 03:05:30,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {643#true} ~n := #in~n; {670#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:30,706 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 03:05:30,707 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 03:05:30,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {671#(<= |fibonacci_#in~n| 1)} assume true; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:30,710 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {671#(<= |fibonacci_#in~n| 1)} {643#true} #33#return; {650#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:30,712 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 03:05:30,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {652#(<= fibonacci_~n 0)} is VALID [2020-07-29 03:05:30,716 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(<= fibonacci_~n 0)} assume !(~n < 1); {644#false} is VALID [2020-07-29 03:05:30,716 INFO L280 TraceCheckUtils]: 15: Hoare triple {644#false} assume !(1 == ~n); {644#false} is VALID [2020-07-29 03:05:30,716 INFO L263 TraceCheckUtils]: 16: Hoare triple {644#false} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 03:05:30,717 INFO L280 TraceCheckUtils]: 17: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,717 INFO L280 TraceCheckUtils]: 18: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:30,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 03:05:30,718 INFO L263 TraceCheckUtils]: 20: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 03:05:30,718 INFO L280 TraceCheckUtils]: 21: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,719 INFO L280 TraceCheckUtils]: 22: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:30,719 INFO L280 TraceCheckUtils]: 23: Hoare triple {643#true} assume 1 == ~n;#res := 1; {643#true} is VALID [2020-07-29 03:05:30,719 INFO L280 TraceCheckUtils]: 24: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,720 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {643#true} {643#true} #33#return; {643#true} is VALID [2020-07-29 03:05:30,720 INFO L263 TraceCheckUtils]: 26: Hoare triple {643#true} call #t~ret1 := fibonacci(~n - 2); {643#true} is VALID [2020-07-29 03:05:30,721 INFO L280 TraceCheckUtils]: 27: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:30,721 INFO L280 TraceCheckUtils]: 28: Hoare triple {643#true} assume ~n < 1;#res := 0; {643#true} is VALID [2020-07-29 03:05:30,722 INFO L280 TraceCheckUtils]: 29: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,722 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {643#true} {643#true} #35#return; {643#true} is VALID [2020-07-29 03:05:30,723 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 03:05:30,723 INFO L280 TraceCheckUtils]: 32: Hoare triple {643#true} assume true; {643#true} is VALID [2020-07-29 03:05:30,724 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {643#true} {644#false} #33#return; {644#false} is VALID [2020-07-29 03:05:30,726 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 03:05:30,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751098387] [2020-07-29 03:05:30,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274300830] [2020-07-29 03:05:30,728 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 03:05:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:05:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:30,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:31,029 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 03:05:31,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#true} assume !(main_~x~0 > 46); {643#true} is VALID [2020-07-29 03:05:31,030 INFO L263 TraceCheckUtils]: 2: Hoare triple {643#true} call main_#t~ret3 := fibonacci(main_~x~0); {643#true} is VALID [2020-07-29 03:05:31,030 INFO L280 TraceCheckUtils]: 3: Hoare triple {643#true} ~n := #in~n; {643#true} is VALID [2020-07-29 03:05:31,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {643#true} assume !(~n < 1); {643#true} is VALID [2020-07-29 03:05:31,031 INFO L280 TraceCheckUtils]: 5: Hoare triple {643#true} assume !(1 == ~n); {643#true} is VALID [2020-07-29 03:05:31,031 INFO L263 TraceCheckUtils]: 6: Hoare triple {643#true} call #t~ret0 := fibonacci(~n - 1); {643#true} is VALID [2020-07-29 03:05:31,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {643#true} ~n := #in~n; {705#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:31,034 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 03:05:31,035 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 03:05:31,036 INFO L280 TraceCheckUtils]: 10: Hoare triple {671#(<= |fibonacci_#in~n| 1)} assume true; {671#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:31,038 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {671#(<= |fibonacci_#in~n| 1)} {643#true} #33#return; {650#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:31,039 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 03:05:31,040 INFO L280 TraceCheckUtils]: 13: Hoare triple {651#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {652#(<= fibonacci_~n 0)} is VALID [2020-07-29 03:05:31,041 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(<= fibonacci_~n 0)} assume !(~n < 1); {644#false} is VALID [2020-07-29 03:05:31,042 INFO L280 TraceCheckUtils]: 15: Hoare triple {644#false} assume !(1 == ~n); {644#false} is VALID [2020-07-29 03:05:31,042 INFO L263 TraceCheckUtils]: 16: Hoare triple {644#false} call #t~ret0 := fibonacci(~n - 1); {644#false} is VALID [2020-07-29 03:05:31,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {644#false} ~n := #in~n; {644#false} is VALID [2020-07-29 03:05:31,042 INFO L280 TraceCheckUtils]: 18: Hoare triple {644#false} assume !(~n < 1); {644#false} is VALID [2020-07-29 03:05:31,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {644#false} assume !(1 == ~n); {644#false} is VALID [2020-07-29 03:05:31,043 INFO L263 TraceCheckUtils]: 20: Hoare triple {644#false} call #t~ret0 := fibonacci(~n - 1); {644#false} is VALID [2020-07-29 03:05:31,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {644#false} ~n := #in~n; {644#false} is VALID [2020-07-29 03:05:31,043 INFO L280 TraceCheckUtils]: 22: Hoare triple {644#false} assume !(~n < 1); {644#false} is VALID [2020-07-29 03:05:31,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {644#false} assume 1 == ~n;#res := 1; {644#false} is VALID [2020-07-29 03:05:31,044 INFO L280 TraceCheckUtils]: 24: Hoare triple {644#false} assume true; {644#false} is VALID [2020-07-29 03:05:31,044 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {644#false} {644#false} #33#return; {644#false} is VALID [2020-07-29 03:05:31,045 INFO L263 TraceCheckUtils]: 26: Hoare triple {644#false} call #t~ret1 := fibonacci(~n - 2); {644#false} is VALID [2020-07-29 03:05:31,045 INFO L280 TraceCheckUtils]: 27: Hoare triple {644#false} ~n := #in~n; {644#false} is VALID [2020-07-29 03:05:31,045 INFO L280 TraceCheckUtils]: 28: Hoare triple {644#false} assume ~n < 1;#res := 0; {644#false} is VALID [2020-07-29 03:05:31,045 INFO L280 TraceCheckUtils]: 29: Hoare triple {644#false} assume true; {644#false} is VALID [2020-07-29 03:05:31,046 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {644#false} {644#false} #35#return; {644#false} is VALID [2020-07-29 03:05:31,046 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 03:05:31,046 INFO L280 TraceCheckUtils]: 32: Hoare triple {644#false} assume true; {644#false} is VALID [2020-07-29 03:05:31,046 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {644#false} {644#false} #33#return; {644#false} is VALID [2020-07-29 03:05:31,048 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 03:05:31,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:05:31,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 03:05:31,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770822187] [2020-07-29 03:05:31,544 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:31,545 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:31,545 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:31,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:31,545 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:31,546 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:31,546 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:31,546 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:31,546 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration3_Loop [2020-07-29 03:05:31,546 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:31,546 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:31,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:31,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:31,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:31,749 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:31,749 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 03:05:31,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:31,755 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 03:05:31,761 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:31,761 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) [2020-07-29 03:05:31,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:31,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:31,811 INFO L437 LassoAnalysis]: Proved nontermination for one component. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:31,811 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 03:05:31,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:31,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:31,844 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:31,845 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 03:05:31,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:31,876 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 03:05:31,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:31,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:33,117 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:33,120 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:33,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:33,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:33,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:33,121 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:33,121 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:33,121 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:33,121 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:33,121 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration3_Loop [2020-07-29 03:05:33,121 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:33,121 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:33,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:33,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:33,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:33,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:33,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:33,317 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) [2020-07-29 03:05:33,334 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:33,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:33,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:33,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:33,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:33,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:33,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:33,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:33,341 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 03:05:33,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:33,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:33,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:33,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:33,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:33,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:33,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:33,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:33,374 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 03:05:33,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:33,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:33,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:33,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:33,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:33,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:33,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:33,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:33,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:33,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:05:33,417 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:33,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:33,422 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:33,422 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:33,422 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-07-29 03:05:33,446 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:33,450 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 03:05:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:33,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:05:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:33,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:33,568 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 03:05:33,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#unseeded} assume !(main_~x~0 > 46); {781#unseeded} is VALID [2020-07-29 03:05:33,570 INFO L263 TraceCheckUtils]: 2: Hoare triple {781#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {781#unseeded} is VALID [2020-07-29 03:05:33,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#unseeded} ~n := #in~n; {781#unseeded} is VALID [2020-07-29 03:05:33,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#unseeded} assume !(~n < 1); {781#unseeded} is VALID [2020-07-29 03:05:33,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#unseeded} assume !(1 == ~n); {781#unseeded} is VALID [2020-07-29 03:05:33,576 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 03:05:33,577 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 03:05:33,577 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 03:05:33,578 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 03:05:33,579 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 03:05:33,580 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 03:05:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:33,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 03:05:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:33,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:34,246 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 03:05:34,248 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 03:05:34,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {837#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 03:05:34,250 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {837#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 03:05:34,251 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 03:05:34,252 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 03:05:34,254 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 03:05:34,255 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 03:05:34,257 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 03:05:34,258 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 03:05:34,260 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 03:05:34,262 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 03:05:34,264 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 03:05:34,266 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 03:05:34,268 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 03:05:34,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:34,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:34,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {847#(<= |old(oldRank0)| oldRank0)} assume true; {847#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:34,273 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 03:05:34,274 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 03:05:34,276 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 03:05:34,278 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 03:05:34,279 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 03:05:34,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:05:34,335 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 03:05:34,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 03:05:34,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:34,336 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 03:05:34,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-07-29 03:05:35,339 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 03:05:35,339 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 03:05:35,339 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:35,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. cyclomatic complexity: 8 [2020-07-29 03:05:35,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:35,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:35,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 03:05:35,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:35,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:35,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:35,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 215 transitions. [2020-07-29 03:05:35,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 03:05:35,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:35,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:35,364 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 30 transitions. cyclomatic complexity: 8 [2020-07-29 03:05:35,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:05:35,367 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 03:05:35,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:35,371 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:35,371 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 159 states and 215 transitions. cyclomatic complexity: 61 [2020-07-29 03:05:35,383 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 21 examples of accepted words. [2020-07-29 03:05:35,384 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 03:05:35,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 03:05:35,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,385 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 03:05:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,387 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 03:05:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:05:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,388 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 03:05:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,388 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 03:05:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:05:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,389 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 03:05:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,389 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 03:05:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 159 letters. Loop has 159 letters. [2020-07-29 03:05:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,390 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 03:05:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,391 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 03:05:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:05:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,391 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 03:05:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,392 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 03:05:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 03:05:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,392 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 03:05:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,392 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 03:05:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,393 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 03:05:35,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,394 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 03:05:35,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 03:05:35,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,395 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 03:05:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,397 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 03:05:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,398 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 03:05:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,398 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 03:05:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:35,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,399 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 03:05:35,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,400 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 03:05:35,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:35,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,400 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 03:05:35,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,401 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 03:05:35,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 22 letters. [2020-07-29 03:05:35,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,402 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 03:05:35,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,403 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 03:05:35,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 10 letters. [2020-07-29 03:05:35,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,404 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 03:05:35,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,405 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 03:05:35,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:05:35,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,406 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 03:05:35,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,406 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 03:05:35,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:05:35,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,407 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 03:05:35,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,407 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 03:05:35,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:05:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,408 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 03:05:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,408 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 03:05:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 29 letters. Loop has 10 letters. [2020-07-29 03:05:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,409 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 03:05:35,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,410 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 03:05:35,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 10 letters. [2020-07-29 03:05:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,411 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 03:05:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,411 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 03:05:35,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:05:35,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,412 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 03:05:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,413 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 03:05:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 10 letters. [2020-07-29 03:05:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,414 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 03:05:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,414 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 03:05:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 14 letters. [2020-07-29 03:05:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,415 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 03:05:35,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,416 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 03:05:35,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:05:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,417 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 03:05:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,417 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 03:05:35,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 10 letters. [2020-07-29 03:05:35,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,418 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 03:05:35,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,419 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 03:05:35,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 10 letters. [2020-07-29 03:05:35,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,420 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 03:05:35,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,420 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 03:05:35,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 10 letters. [2020-07-29 03:05:35,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,421 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 03:05:35,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,422 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 03:05:35,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 22 letters. [2020-07-29 03:05:35,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,423 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 03:05:35,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,424 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 03:05:35,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 26 letters. [2020-07-29 03:05:35,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,425 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 03:05:35,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,426 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 03:05:35,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 30 letters. Loop has 14 letters. [2020-07-29 03:05:35,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,427 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 03:05:35,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,428 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 03:05:35,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 35 letters. [2020-07-29 03:05:35,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,429 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 03:05:35,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,429 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 03:05:35,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 03:05:35,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,430 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 03:05:35,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,430 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 03:05:35,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 03:05:35,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,431 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 03:05:35,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,432 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 03:05:35,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 03:05:35,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,432 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 03:05:35,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,433 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 03:05:35,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 29 letters. Loop has 4 letters. [2020-07-29 03:05:35,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,433 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 03:05:35,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,434 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 03:05:35,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 10 letters. [2020-07-29 03:05:35,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,434 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 03:05:35,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,435 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 03:05:35,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 72 letters. [2020-07-29 03:05:35,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,436 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 03:05:35,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,437 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 03:05:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2020-07-29 03:05:35,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 12 letters. Loop has 22 letters. [2020-07-29 03:05:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 34 letters. Loop has 22 letters. [2020-07-29 03:05:35,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 12 letters. Loop has 44 letters. [2020-07-29 03:05:35,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:35,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 215 transitions. cyclomatic complexity: 61 [2020-07-29 03:05:35,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 03:05:35,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 128 states and 180 transitions. [2020-07-29 03:05:35,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-07-29 03:05:35,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-07-29 03:05:35,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 180 transitions. [2020-07-29 03:05:35,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:35,475 INFO L688 BuchiCegarLoop]: Abstraction has 128 states and 180 transitions. [2020-07-29 03:05:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 180 transitions. [2020-07-29 03:05:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2020-07-29 03:05:35,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:35,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states and 180 transitions. Second operand 106 states. [2020-07-29 03:05:35,490 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states and 180 transitions. Second operand 106 states. [2020-07-29 03:05:35,490 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand 106 states. [2020-07-29 03:05:35,495 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:35,531 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2020-07-29 03:05:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 412 transitions. [2020-07-29 03:05:35,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:35,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:35,541 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 128 states and 180 transitions. [2020-07-29 03:05:35,541 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 128 states and 180 transitions. [2020-07-29 03:05:35,541 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:35,584 INFO L93 Difference]: Finished difference Result 312 states and 432 transitions. [2020-07-29 03:05:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 432 transitions. [2020-07-29 03:05:35,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:35,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:35,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:35,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 03:05:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2020-07-29 03:05:35,596 INFO L711 BuchiCegarLoop]: Abstraction has 106 states and 140 transitions. [2020-07-29 03:05:35,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:05:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:05:35,597 INFO L87 Difference]: Start difference. First operand 106 states and 140 transitions. Second operand 8 states. [2020-07-29 03:05:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:35,958 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2020-07-29 03:05:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:05:35,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:05:36,036 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 03:05:36,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2020-07-29 03:05:36,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:36,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 53 transitions. [2020-07-29 03:05:36,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-07-29 03:05:36,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-07-29 03:05:36,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2020-07-29 03:05:36,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:36,058 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-07-29 03:05:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2020-07-29 03:05:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-07-29 03:05:36,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:36,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 53 transitions. Second operand 38 states. [2020-07-29 03:05:36,067 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 53 transitions. Second operand 38 states. [2020-07-29 03:05:36,067 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 38 states. [2020-07-29 03:05:36,068 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:36,081 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2020-07-29 03:05:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2020-07-29 03:05:36,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:36,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:36,083 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states and 53 transitions. [2020-07-29 03:05:36,083 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states and 53 transitions. [2020-07-29 03:05:36,084 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:36,095 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2020-07-29 03:05:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2020-07-29 03:05:36,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:36,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:36,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:36,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 03:05:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-07-29 03:05:36,100 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-29 03:05:36,100 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-29 03:05:36,100 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:05:36,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2020-07-29 03:05:36,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:36,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:36,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:36,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:36,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 03:05:36,107 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 > 46); 2293#L30 call main_#t~ret3 := fibonacci(main_~x~0);< 2311#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 03:05:36,107 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; 2310#fibonacciFINAL assume true; 2312#fibonacciEXIT >#33#return; 2290#L20-1 [2020-07-29 03:05:36,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:36,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2059413222, now seen corresponding path program 2 times [2020-07-29 03:05:36,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:36,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881191771] [2020-07-29 03:05:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:36,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:36,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:36,151 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -370029085, now seen corresponding path program 2 times [2020-07-29 03:05:36,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:36,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208954605] [2020-07-29 03:05:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:36,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:36,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:36,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1882223864, now seen corresponding path program 3 times [2020-07-29 03:05:36,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:36,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706206603] [2020-07-29 03:05:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 03:05:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:36,412 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 03:05:36,413 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 03:05:36,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} assume true; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:36,417 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 03:05:36,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:05:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,436 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:36,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,442 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 03:05:36,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:36,445 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 03:05:36,446 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 03:05:36,446 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 03:05:36,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:36,448 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 03:05:36,448 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 03:05:36,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} assume true; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:36,451 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 03:05:36,451 INFO L263 TraceCheckUtils]: 9: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 03:05:36,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:36,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,454 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 03:05:36,454 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 03:05:36,459 INFO L280 TraceCheckUtils]: 15: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} assume true; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:36,461 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2745#(<= |fibonacci_#in~n| 2)} {2699#true} #33#return; {2718#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:36,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-07-29 03:05:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:36,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 03:05:36,479 INFO L280 TraceCheckUtils]: 3: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,480 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2699#true} {2699#true} #33#return; {2699#true} is VALID [2020-07-29 03:05:36,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:05:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:36,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,486 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2699#true} {2699#true} #35#return; {2699#true} is VALID [2020-07-29 03:05:36,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:36,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 03:05:36,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 03:05:36,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:36,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 03:05:36,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,489 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2699#true} {2699#true} #33#return; {2699#true} is VALID [2020-07-29 03:05:36,489 INFO L263 TraceCheckUtils]: 9: Hoare triple {2699#true} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 03:05:36,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:36,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,490 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2699#true} {2699#true} #35#return; {2699#true} is VALID [2020-07-29 03:05:36,491 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 03:05:36,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,491 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2699#true} {2700#false} #33#return; {2700#false} is VALID [2020-07-29 03:05:36,492 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 03:05:36,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(main_~x~0 > 46); {2699#true} is VALID [2020-07-29 03:05:36,492 INFO L263 TraceCheckUtils]: 2: Hoare triple {2699#true} call main_#t~ret3 := fibonacci(main_~x~0); {2699#true} is VALID [2020-07-29 03:05:36,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:36,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 03:05:36,493 INFO L263 TraceCheckUtils]: 6: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 03:05:36,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:36,495 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 03:05:36,496 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 03:05:36,497 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 03:05:36,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} ~n := #in~n; {2739#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:36,498 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 03:05:36,500 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 03:05:36,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} assume true; {2719#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:36,503 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 03:05:36,503 INFO L263 TraceCheckUtils]: 16: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 03:05:36,503 INFO L280 TraceCheckUtils]: 17: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,504 INFO L280 TraceCheckUtils]: 18: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:36,504 INFO L280 TraceCheckUtils]: 19: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,506 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 03:05:36,507 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 03:05:36,509 INFO L280 TraceCheckUtils]: 22: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} assume true; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:36,512 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2745#(<= |fibonacci_#in~n| 2)} {2699#true} #33#return; {2718#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:36,513 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 03:05:36,515 INFO L280 TraceCheckUtils]: 25: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:36,515 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 03:05:36,516 INFO L280 TraceCheckUtils]: 27: Hoare triple {2721#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {2700#false} is VALID [2020-07-29 03:05:36,516 INFO L263 TraceCheckUtils]: 28: Hoare triple {2700#false} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 03:05:36,517 INFO L280 TraceCheckUtils]: 29: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,517 INFO L280 TraceCheckUtils]: 30: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:36,518 INFO L280 TraceCheckUtils]: 31: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 03:05:36,518 INFO L263 TraceCheckUtils]: 32: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 03:05:36,518 INFO L280 TraceCheckUtils]: 33: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,518 INFO L280 TraceCheckUtils]: 34: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:36,519 INFO L280 TraceCheckUtils]: 35: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 03:05:36,519 INFO L280 TraceCheckUtils]: 36: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,519 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2699#true} {2699#true} #33#return; {2699#true} is VALID [2020-07-29 03:05:36,520 INFO L263 TraceCheckUtils]: 38: Hoare triple {2699#true} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 03:05:36,520 INFO L280 TraceCheckUtils]: 39: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:36,520 INFO L280 TraceCheckUtils]: 40: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:36,520 INFO L280 TraceCheckUtils]: 41: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,521 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2699#true} {2699#true} #35#return; {2699#true} is VALID [2020-07-29 03:05:36,521 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 03:05:36,522 INFO L280 TraceCheckUtils]: 44: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:36,522 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2699#true} {2700#false} #33#return; {2700#false} is VALID [2020-07-29 03:05:36,525 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 03:05:36,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706206603] [2020-07-29 03:05:36,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997448982] [2020-07-29 03:05:36,526 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 03:05:36,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-29 03:05:36,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:05:36,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 03:05:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:36,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:37,041 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 03:05:37,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {2699#true} assume !(main_~x~0 > 46); {2699#true} is VALID [2020-07-29 03:05:37,042 INFO L263 TraceCheckUtils]: 2: Hoare triple {2699#true} call main_#t~ret3 := fibonacci(main_~x~0); {2699#true} is VALID [2020-07-29 03:05:37,042 INFO L280 TraceCheckUtils]: 3: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:37,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:37,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {2699#true} assume !(1 == ~n); {2699#true} is VALID [2020-07-29 03:05:37,043 INFO L263 TraceCheckUtils]: 6: Hoare triple {2699#true} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 03:05:37,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {2699#true} ~n := #in~n; {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:37,045 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 03:05:37,046 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 03:05:37,046 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 03:05:37,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:37,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {2699#true} assume !(~n < 1); {2699#true} is VALID [2020-07-29 03:05:37,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {2699#true} assume 1 == ~n;#res := 1; {2699#true} is VALID [2020-07-29 03:05:37,047 INFO L280 TraceCheckUtils]: 14: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:37,049 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 03:05:37,049 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 03:05:37,050 INFO L280 TraceCheckUtils]: 17: Hoare triple {2699#true} ~n := #in~n; {2783#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:37,052 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 03:05:37,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {2817#(<= |fibonacci_#in~n| 0)} assume true; {2817#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 03:05:37,055 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 03:05:37,056 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 03:05:37,057 INFO L280 TraceCheckUtils]: 22: Hoare triple {2745#(<= |fibonacci_#in~n| 2)} assume true; {2745#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:37,059 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2745#(<= |fibonacci_#in~n| 2)} {2699#true} #33#return; {2718#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:37,061 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 03:05:37,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {2719#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:37,064 INFO L280 TraceCheckUtils]: 26: Hoare triple {2720#(<= fibonacci_~n 1)} assume !(~n < 1); {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:37,065 INFO L280 TraceCheckUtils]: 27: Hoare triple {2720#(<= fibonacci_~n 1)} assume !(1 == ~n); {2720#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:37,066 INFO L263 TraceCheckUtils]: 28: Hoare triple {2720#(<= fibonacci_~n 1)} call #t~ret0 := fibonacci(~n - 1); {2699#true} is VALID [2020-07-29 03:05:37,066 INFO L280 TraceCheckUtils]: 29: Hoare triple {2699#true} ~n := #in~n; {2851#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:37,067 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 03:05:37,068 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 03:05:37,068 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 03:05:37,069 INFO L280 TraceCheckUtils]: 33: Hoare triple {2699#true} ~n := #in~n; {2851#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:37,071 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 03:05:37,072 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 03:05:37,073 INFO L280 TraceCheckUtils]: 36: Hoare triple {2867#(<= 1 |fibonacci_#in~n|)} assume true; {2867#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:37,074 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 03:05:37,075 INFO L263 TraceCheckUtils]: 38: Hoare triple {2877#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2699#true} is VALID [2020-07-29 03:05:37,075 INFO L280 TraceCheckUtils]: 39: Hoare triple {2699#true} ~n := #in~n; {2699#true} is VALID [2020-07-29 03:05:37,075 INFO L280 TraceCheckUtils]: 40: Hoare triple {2699#true} assume ~n < 1;#res := 0; {2699#true} is VALID [2020-07-29 03:05:37,076 INFO L280 TraceCheckUtils]: 41: Hoare triple {2699#true} assume true; {2699#true} is VALID [2020-07-29 03:05:37,078 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 03:05:37,079 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 03:05:37,080 INFO L280 TraceCheckUtils]: 44: Hoare triple {2877#(<= 2 |fibonacci_#in~n|)} assume true; {2877#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:37,082 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2877#(<= 2 |fibonacci_#in~n|)} {2720#(<= fibonacci_~n 1)} #33#return; {2700#false} is VALID [2020-07-29 03:05:37,085 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 03:05:37,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:05:37,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2020-07-29 03:05:37,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68682386] [2020-07-29 03:05:37,433 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:37,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:37,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:37,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:37,433 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:37,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:37,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:37,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:37,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration4_Loop [2020-07-29 03:05:37,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:37,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:37,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:37,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:37,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:37,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:37,563 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:37,563 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:37,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:37,567 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:37,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:37,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:38,815 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:38,818 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:38,819 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:38,819 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:38,819 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:38,819 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:38,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:38,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:38,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:38,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration4_Loop [2020-07-29 03:05:38,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:38,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:38,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:38,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:38,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:38,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:38,964 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:38,964 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:38,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:38,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:38,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:38,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:38,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:38,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:38,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:38,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:38,973 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 03:05:39,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:39,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:39,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:39,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:39,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:39,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:39,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:39,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:39,005 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 03:05:39,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:39,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:39,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:39,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:39,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:39,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:39,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:39,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:39,037 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 03:05:39,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:39,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:39,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:39,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:39,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:39,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:39,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:39,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:39,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:39,094 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:05:39,095 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 03:05:39,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:39,104 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:39,105 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:39,105 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-07-29 03:05:39,143 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:39,146 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 03:05:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:39,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:39,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:05:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:39,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:39,262 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:39,274 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:39,278 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 03:05:39,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {2899#unseeded} assume !(main_~x~0 > 46); {2899#unseeded} is VALID [2020-07-29 03:05:39,280 INFO L263 TraceCheckUtils]: 2: Hoare triple {2899#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {2899#unseeded} is VALID [2020-07-29 03:05:39,280 INFO L280 TraceCheckUtils]: 3: Hoare triple {2899#unseeded} ~n := #in~n; {2899#unseeded} is VALID [2020-07-29 03:05:39,281 INFO L280 TraceCheckUtils]: 4: Hoare triple {2899#unseeded} assume !(~n < 1); {2899#unseeded} is VALID [2020-07-29 03:05:39,281 INFO L280 TraceCheckUtils]: 5: Hoare triple {2899#unseeded} assume !(1 == ~n); {2899#unseeded} is VALID [2020-07-29 03:05:39,283 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 03:05:39,284 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 03:05:39,285 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 03:05:39,285 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 03:05:39,286 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 03:05:39,287 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 03:05:39,288 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 03:05:39,289 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 03:05:39,289 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 03:05:39,292 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 03:05:39,294 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 03:05:39,295 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 03:05:39,297 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 03:05:39,297 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 03:05:39,301 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 03:05:39,302 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 03:05:39,303 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 03:05:39,305 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 03:05:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:39,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 03:05:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:39,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:39,990 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 03:05:39,992 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 03:05:39,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {2991#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {2991#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 03:05:39,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {2991#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {2991#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 03:05:39,994 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 03:05:39,994 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 03:05:39,995 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 03:05:39,996 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 03:05:39,996 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 03:05:39,997 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 03:05:39,999 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 03:05:40,000 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 03:05:40,003 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 03:05:40,005 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 03:05:40,006 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 03:05:40,006 INFO L280 TraceCheckUtils]: 15: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:40,007 INFO L280 TraceCheckUtils]: 16: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:40,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {3001#(<= |old(oldRank0)| oldRank0)} assume true; {3001#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:40,009 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 03:05:40,010 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 03:05:40,010 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 03:05:40,011 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 03:05:40,011 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 03:05:40,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:05:40,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:40,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:40,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,084 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 03:05:40,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 03:05:40,339 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 03:05:40,339 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 03:05:40,339 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:40,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:40,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:40,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:40,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 03:05:40,341 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:40,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:40,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2020-07-29 03:05:40,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:40,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:40,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:40,344 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:40,347 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:40,347 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 03:05:40,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:40,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 17 transitions. cyclomatic complexity: 15 [2020-07-29 03:05:40,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:40,349 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:05:40,349 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:40,352 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:40,352 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 03:05:40,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:40,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,353 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 03:05:40,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,354 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 03:05:40,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:40,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,354 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 03:05:40,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,355 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 03:05:40,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:05:40,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,355 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 03:05:40,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,356 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 03:05:40,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:05:40,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,356 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 03:05:40,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,356 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 03:05:40,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:05:40,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,357 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 03:05:40,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,357 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 03:05:40,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 03:05:40,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,358 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 03:05:40,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,359 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 03:05:40,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:40,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,359 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 03:05:40,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,359 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 03:05:40,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:05:40,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,360 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 03:05:40,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,360 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 03:05:40,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 03:05:40,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,361 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 03:05:40,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,361 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 03:05:40,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 03:05:40,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,362 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 03:05:40,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,362 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 03:05:40,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 03:05:40,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,363 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 03:05:40,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,363 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 03:05:40,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:40,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,364 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 03:05:40,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,364 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 03:05:40,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:05:40,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,365 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 03:05:40,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,365 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 03:05:40,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 03:05:40,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,366 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 03:05:40,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,366 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 03:05:40,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 03:05:40,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,367 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 03:05:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,367 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 03:05:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 03:05:40,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,368 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 03:05:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,368 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 03:05:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 03:05:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,369 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 03:05:40,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,369 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 03:05:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-29 03:05:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:40,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:40,371 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:05:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:40,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:05:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:40,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:40,481 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:40,494 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:40,504 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 03:05:40,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {2899#unseeded} assume !(main_~x~0 > 46); {2899#unseeded} is VALID [2020-07-29 03:05:40,507 INFO L263 TraceCheckUtils]: 2: Hoare triple {2899#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {2899#unseeded} is VALID [2020-07-29 03:05:40,508 INFO L280 TraceCheckUtils]: 3: Hoare triple {2899#unseeded} ~n := #in~n; {2899#unseeded} is VALID [2020-07-29 03:05:40,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {2899#unseeded} assume !(~n < 1); {2899#unseeded} is VALID [2020-07-29 03:05:40,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {2899#unseeded} assume !(1 == ~n); {2899#unseeded} is VALID [2020-07-29 03:05:40,511 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 03:05:40,512 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 03:05:40,513 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 03:05:40,514 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 03:05:40,515 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 03:05:40,516 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 03:05:40,517 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 03:05:40,518 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 03:05:40,519 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 03:05:40,520 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 03:05:40,522 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 03:05:40,523 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 03:05:40,524 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 03:05:40,525 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 03:05:40,526 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 03:05:40,527 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 03:05:40,528 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 03:05:40,530 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 03:05:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:40,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 03:05:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:40,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:41,078 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 03:05:41,083 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 03:05:41,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 03:05:41,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 03:05:41,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 03:05:41,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 03:05:41,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 03:05:41,092 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 03:05:41,096 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 03:05:41,097 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 03:05:41,098 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 03:05:41,099 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 03:05:41,100 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 03:05:41,102 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 03:05:41,103 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 03:05:41,103 INFO L280 TraceCheckUtils]: 15: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:41,104 INFO L280 TraceCheckUtils]: 16: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:41,104 INFO L280 TraceCheckUtils]: 17: Hoare triple {3208#(<= |old(oldRank0)| oldRank0)} assume true; {3208#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:41,106 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 03:05:41,107 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 03:05:41,107 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 03:05:41,109 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 03:05:41,109 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 03:05:41,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:05:41,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:41,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:41,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,179 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 03:05:41,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 03:05:41,423 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 03:05:41,423 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 03:05:41,423 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:41,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:41,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:41,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:41,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 03:05:41,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:41,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:41,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2020-07-29 03:05:41,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:41,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:41,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:41,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:41,428 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:41,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 03:05:41,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:41,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 17 transitions. cyclomatic complexity: 15 [2020-07-29 03:05:41,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:41,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:05:41,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:41,433 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:41,433 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 03:05:41,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,434 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 03:05:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,434 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 03:05:41,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:41,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,435 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 03:05:41,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,435 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 03:05:41,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:05:41,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,436 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 03:05:41,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,436 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 03:05:41,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:05:41,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,436 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 03:05:41,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,437 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 03:05:41,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:05:41,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,437 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 03:05:41,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,437 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 03:05:41,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 03:05:41,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,438 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 03:05:41,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,438 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 03:05:41,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:41,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,439 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 03:05:41,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,439 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 03:05:41,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:05:41,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,440 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 03:05:41,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,440 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 03:05:41,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 03:05:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,441 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 03:05:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,441 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 03:05:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 03:05:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,442 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 03:05:41,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,442 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 03:05:41,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 03:05:41,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,442 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 03:05:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,443 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 03:05:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,443 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 03:05:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,444 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 03:05:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:05:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,444 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 03:05:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,445 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 03:05:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 03:05:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,445 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 03:05:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,445 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 03:05:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 03:05:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,446 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 03:05:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,446 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 03:05:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 03:05:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,447 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 03:05:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,447 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 03:05:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 03:05:41,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,448 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 03:05:41,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,448 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 03:05:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-29 03:05:41,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:41,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:41,450 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:05:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:41,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:05:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:41,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:41,553 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:41,562 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:41,568 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 03:05:41,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {2899#unseeded} assume !(main_~x~0 > 46); {2899#unseeded} is VALID [2020-07-29 03:05:41,570 INFO L263 TraceCheckUtils]: 2: Hoare triple {2899#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {2899#unseeded} is VALID [2020-07-29 03:05:41,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {2899#unseeded} ~n := #in~n; {2899#unseeded} is VALID [2020-07-29 03:05:41,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {2899#unseeded} assume !(~n < 1); {2899#unseeded} is VALID [2020-07-29 03:05:41,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {2899#unseeded} assume !(1 == ~n); {2899#unseeded} is VALID [2020-07-29 03:05:41,577 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 03:05:41,577 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 03:05:41,578 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 03:05:41,578 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 03:05:41,581 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 03:05:41,582 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 03:05:41,583 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 03:05:41,583 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 03:05:41,584 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 03:05:41,589 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 03:05:41,592 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 03:05:41,593 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 03:05:41,593 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 03:05:41,594 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 03:05:41,599 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 03:05:41,600 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 03:05:41,600 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 03:05:41,602 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 03:05:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:41,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 03:05:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:41,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:42,148 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 03:05:42,149 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 03:05:42,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {3405#(<= (+ fibonacci_~n 2) oldRank0)} assume !(~n < 1); {3405#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 03:05:42,151 INFO L280 TraceCheckUtils]: 3: Hoare triple {3405#(<= (+ fibonacci_~n 2) oldRank0)} assume !(1 == ~n); {3405#(<= (+ fibonacci_~n 2) oldRank0)} is VALID [2020-07-29 03:05:42,152 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 03:05:42,152 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 03:05:42,153 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 03:05:42,153 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 03:05:42,156 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 03:05:42,157 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 03:05:42,157 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 03:05:42,159 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 03:05:42,159 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 03:05:42,161 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 03:05:42,163 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 03:05:42,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:42,164 INFO L280 TraceCheckUtils]: 16: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:42,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {3415#(<= |old(oldRank0)| oldRank0)} assume true; {3415#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 03:05:42,167 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 03:05:42,167 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 03:05:42,168 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 03:05:42,169 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 03:05:42,170 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 03:05:42,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:05:42,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:42,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:42,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:42,258 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 03:05:42,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 03:05:43,164 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 03:05:43,164 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 03:05:43,164 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:43,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:43,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:43,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:43,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 03:05:43,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:43,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:43,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:43,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 443 transitions. [2020-07-29 03:05:43,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:43,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:43,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:43,174 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 47 transitions. cyclomatic complexity: 11 [2020-07-29 03:05:43,175 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:43,175 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 03:05:43,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:43,179 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:43,179 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 344 states and 443 transitions. cyclomatic complexity: 103 [2020-07-29 03:05:43,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 03:05:43,188 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 03:05:43,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:43,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,189 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 03:05:43,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,193 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 03:05:43,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:05:43,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,194 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 03:05:43,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,194 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 03:05:43,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 33 letters. Loop has 4 letters. [2020-07-29 03:05:43,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,195 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 03:05:43,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,195 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 03:05:43,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 344 letters. Loop has 344 letters. [2020-07-29 03:05:43,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,198 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 03:05:43,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,199 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 03:05:43,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:05:43,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,199 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 03:05:43,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,199 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 03:05:43,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 03:05:43,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,200 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 03:05:43,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,200 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 03:05:43,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 28 letters. Loop has 4 letters. [2020-07-29 03:05:43,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,201 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 03:05:43,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,201 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 03:05:43,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:43,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,202 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 03:05:43,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,203 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 03:05:43,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:05:43,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,204 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 03:05:43,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,204 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 03:05:43,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 27 letters. Loop has 4 letters. [2020-07-29 03:05:43,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,205 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 03:05:43,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,205 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 03:05:43,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 26 letters. Loop has 4 letters. [2020-07-29 03:05:43,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,207 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 03:05:43,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,207 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 03:05:43,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 24 letters. Loop has 34 letters. [2020-07-29 03:05:43,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,208 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 03:05:43,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,209 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 03:05:43,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:05:43,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,210 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 03:05:43,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,210 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 03:05:43,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:05:43,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,212 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 03:05:43,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,212 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 03:05:43,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 80 letters. Loop has 26 letters. [2020-07-29 03:05:43,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,213 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 03:05:43,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,214 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 03:05:43,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 61 letters. Loop has 26 letters. [2020-07-29 03:05:43,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,215 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 03:05:43,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,215 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 03:05:43,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 59 letters. Loop has 26 letters. [2020-07-29 03:05:43,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,216 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 03:05:43,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,216 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 03:05:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 36 letters. Loop has 4 letters. [2020-07-29 03:05:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,217 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 03:05:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,218 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 03:05:43,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 33 letters. Loop has 4 letters. [2020-07-29 03:05:43,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,218 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 03:05:43,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,219 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 03:05:43,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 35 letters. Loop has 4 letters. [2020-07-29 03:05:43,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,219 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 03:05:43,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,220 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 03:05:43,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 62 letters. Loop has 26 letters. [2020-07-29 03:05:43,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,220 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 03:05:43,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,221 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 03:05:43,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 60 letters. Loop has 26 letters. [2020-07-29 03:05:43,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,222 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 03:05:43,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,222 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 03:05:43,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 34 letters. Loop has 4 letters. [2020-07-29 03:05:43,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,223 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 03:05:43,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,223 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 03:05:43,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:05:43,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,225 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 03:05:43,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,225 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 03:05:43,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 54 letters. Loop has 43 letters. [2020-07-29 03:05:43,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,226 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 03:05:43,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,227 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 03:05:43,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 80 letters. Loop has 39 letters. [2020-07-29 03:05:43,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,228 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 03:05:43,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,229 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 03:05:43,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 80 letters. Loop has 26 letters. [2020-07-29 03:05:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,230 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 03:05:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,230 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 03:05:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2020-07-29 03:05:43,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 24 letters. Loop has 22 letters. [2020-07-29 03:05:43,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 46 letters. Loop has 22 letters. [2020-07-29 03:05:43,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 24 letters. Loop has 44 letters. [2020-07-29 03:05:43,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:43,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 443 transitions. cyclomatic complexity: 103 [2020-07-29 03:05:43,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:43,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 219 states and 296 transitions. [2020-07-29 03:05:43,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2020-07-29 03:05:43,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2020-07-29 03:05:43,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 296 transitions. [2020-07-29 03:05:43,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:43,290 INFO L688 BuchiCegarLoop]: Abstraction has 219 states and 296 transitions. [2020-07-29 03:05:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 296 transitions. [2020-07-29 03:05:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 171. [2020-07-29 03:05:43,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:43,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states and 296 transitions. Second operand 171 states. [2020-07-29 03:05:43,315 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states and 296 transitions. Second operand 171 states. [2020-07-29 03:05:43,315 INFO L87 Difference]: Start difference. First operand 219 states and 296 transitions. Second operand 171 states. [2020-07-29 03:05:43,316 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:43,398 INFO L93 Difference]: Finished difference Result 686 states and 957 transitions. [2020-07-29 03:05:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 957 transitions. [2020-07-29 03:05:43,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:43,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:43,405 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 219 states and 296 transitions. [2020-07-29 03:05:43,405 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 219 states and 296 transitions. [2020-07-29 03:05:43,406 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:43,496 INFO L93 Difference]: Finished difference Result 746 states and 1045 transitions. [2020-07-29 03:05:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1045 transitions. [2020-07-29 03:05:43,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:43,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:43,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:43,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-29 03:05:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 222 transitions. [2020-07-29 03:05:43,514 INFO L711 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2020-07-29 03:05:43,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:05:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:05:43,515 INFO L87 Difference]: Start difference. First operand 171 states and 222 transitions. Second operand 13 states. [2020-07-29 03:05:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:44,324 INFO L93 Difference]: Finished difference Result 272 states and 373 transitions. [2020-07-29 03:05:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 03:05:44,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:05:44,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:44,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 373 transitions. [2020-07-29 03:05:44,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:44,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 271 states and 371 transitions. [2020-07-29 03:05:44,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2020-07-29 03:05:44,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2020-07-29 03:05:44,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 371 transitions. [2020-07-29 03:05:44,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:44,486 INFO L688 BuchiCegarLoop]: Abstraction has 271 states and 371 transitions. [2020-07-29 03:05:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 371 transitions. [2020-07-29 03:05:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 217. [2020-07-29 03:05:44,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:44,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states and 371 transitions. Second operand 217 states. [2020-07-29 03:05:44,526 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states and 371 transitions. Second operand 217 states. [2020-07-29 03:05:44,526 INFO L87 Difference]: Start difference. First operand 271 states and 371 transitions. Second operand 217 states. [2020-07-29 03:05:44,527 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:44,643 INFO L93 Difference]: Finished difference Result 963 states and 1360 transitions. [2020-07-29 03:05:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1360 transitions. [2020-07-29 03:05:44,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:44,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:44,652 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 271 states and 371 transitions. [2020-07-29 03:05:44,652 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 271 states and 371 transitions. [2020-07-29 03:05:44,653 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:44,789 INFO L93 Difference]: Finished difference Result 975 states and 1366 transitions. [2020-07-29 03:05:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1366 transitions. [2020-07-29 03:05:44,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:44,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:44,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:44,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-07-29 03:05:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 297 transitions. [2020-07-29 03:05:44,816 INFO L711 BuchiCegarLoop]: Abstraction has 217 states and 297 transitions. [2020-07-29 03:05:44,816 INFO L591 BuchiCegarLoop]: Abstraction has 217 states and 297 transitions. [2020-07-29 03:05:44,816 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:05:44,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. [2020-07-29 03:05:44,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:44,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:44,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:44,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-07-29 03:05:44,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:44,823 INFO L794 eck$LassoCheckResult]: Stem: 6870#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; 6871#L27 assume !(main_~x~0 > 46); 6872#L30 call main_#t~ret3 := fibonacci(main_~x~0);< 6894#fibonacciENTRY ~n := #in~n; 6924#L15 assume !(~n < 1); 6922#L17 assume !(1 == ~n); 6915#L20 call #t~ret0 := fibonacci(~n - 1);< 6917#fibonacciENTRY ~n := #in~n; 6923#L15 assume !(~n < 1); 6921#L17 assume !(1 == ~n); 6914#L20 call #t~ret0 := fibonacci(~n - 1);< 6917#fibonacciENTRY ~n := #in~n; 6923#L15 assume !(~n < 1); 6921#L17 assume !(1 == ~n); 6914#L20 call #t~ret0 := fibonacci(~n - 1);< 6917#fibonacciENTRY ~n := #in~n; 6923#L15 assume !(~n < 1); 6921#L17 assume !(1 == ~n); 6914#L20 call #t~ret0 := fibonacci(~n - 1);< 6917#fibonacciENTRY ~n := #in~n; 6925#L15 assume !(~n < 1); 6978#L17 assume 1 == ~n;#res := 1; 6977#fibonacciFINAL assume true; 6974#fibonacciEXIT >#33#return; 6970#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6971#fibonacciENTRY ~n := #in~n; 6976#L15 assume ~n < 1;#res := 0; 6973#fibonacciFINAL assume true; 6969#fibonacciEXIT >#35#return; 6967#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6947#fibonacciFINAL assume true; 6942#fibonacciEXIT >#33#return; 6928#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6932#fibonacciENTRY ~n := #in~n; 6961#L15 assume !(~n < 1); 6937#L17 assume 1 == ~n;#res := 1; 6936#fibonacciFINAL assume true; 6927#fibonacciEXIT >#35#return; 6916#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 6919#fibonacciFINAL assume true; 6913#fibonacciEXIT >#33#return; 6859#L20-1 call #t~ret1 := fibonacci(~n - 2);< 6907#fibonacciENTRY ~n := #in~n; 6908#L15 assume !(~n < 1); 6938#L17 assume !(1 == ~n); 6852#L20 call #t~ret0 := fibonacci(~n - 1);< 6861#fibonacciENTRY ~n := #in~n; 7055#L15 assume !(~n < 1); 6900#L17 assume !(1 == ~n); 6901#L20 call #t~ret0 := fibonacci(~n - 1);< 7034#fibonacciENTRY [2020-07-29 03:05:44,823 INFO L796 eck$LassoCheckResult]: Loop: 7034#fibonacciENTRY ~n := #in~n; 7049#L15 assume !(~n < 1); 7047#L17 assume !(1 == ~n); 7031#L20 call #t~ret0 := fibonacci(~n - 1);< 7034#fibonacciENTRY [2020-07-29 03:05:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 446854688, now seen corresponding path program 4 times [2020-07-29 03:05:44,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:44,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262517052] [2020-07-29 03:05:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:44,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-07-29 03:05:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,063 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 03:05:45,063 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 03:05:45,064 INFO L280 TraceCheckUtils]: 3: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:45,066 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 03:05:45,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:05:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,073 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 03:05:45,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,074 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 03:05:45,075 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,076 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 03:05:45,076 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 03:05:45,077 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 03:05:45,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,078 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 03:05:45,079 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 03:05:45,080 INFO L280 TraceCheckUtils]: 7: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:45,082 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 03:05:45,082 INFO L263 TraceCheckUtils]: 9: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,082 INFO L280 TraceCheckUtils]: 10: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,082 INFO L280 TraceCheckUtils]: 11: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 03:05:45,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,085 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 03:05:45,085 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 03:05:45,086 INFO L280 TraceCheckUtils]: 15: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:45,088 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 03:05:45,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:05:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 03:05:45,097 INFO L280 TraceCheckUtils]: 3: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,099 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 03:05:45,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,100 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 03:05:45,101 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 03:05:45,101 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 03:05:45,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,102 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 03:05:45,103 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 03:05:45,103 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 03:05:45,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,104 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 03:05:45,105 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 03:05:45,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:45,106 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 03:05:45,107 INFO L263 TraceCheckUtils]: 13: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,107 INFO L280 TraceCheckUtils]: 14: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 03:05:45,107 INFO L280 TraceCheckUtils]: 16: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,108 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 03:05:45,109 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 03:05:45,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:45,111 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 03:05:45,111 INFO L263 TraceCheckUtils]: 21: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,111 INFO L280 TraceCheckUtils]: 23: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,112 INFO L280 TraceCheckUtils]: 24: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 03:05:45,112 INFO L280 TraceCheckUtils]: 25: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,113 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 03:05:45,114 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 03:05:45,115 INFO L280 TraceCheckUtils]: 28: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} assume true; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:45,116 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {10423#(<= |fibonacci_#in~n| 3)} {10367#true} #33#return; {10399#(<= fibonacci_~n 4)} is VALID [2020-07-29 03:05:45,117 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 03:05:45,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume !(main_~x~0 > 46); {10367#true} is VALID [2020-07-29 03:05:45,117 INFO L263 TraceCheckUtils]: 2: Hoare triple {10367#true} call main_#t~ret3 := fibonacci(main_~x~0); {10367#true} is VALID [2020-07-29 03:05:45,118 INFO L280 TraceCheckUtils]: 3: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,118 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,118 INFO L280 TraceCheckUtils]: 5: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 03:05:45,118 INFO L263 TraceCheckUtils]: 6: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 03:05:45,118 INFO L280 TraceCheckUtils]: 7: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,119 INFO L280 TraceCheckUtils]: 9: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 03:05:45,119 INFO L263 TraceCheckUtils]: 10: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 03:05:45,134 INFO L280 TraceCheckUtils]: 11: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,135 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 03:05:45,136 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 03:05:45,137 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 03:05:45,137 INFO L280 TraceCheckUtils]: 15: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,138 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 03:05:45,139 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 03:05:45,139 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 03:05:45,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {10367#true} ~n := #in~n; {10405#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:45,141 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 03:05:45,142 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 03:05:45,143 INFO L280 TraceCheckUtils]: 22: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:45,145 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 03:05:45,145 INFO L263 TraceCheckUtils]: 24: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,145 INFO L280 TraceCheckUtils]: 25: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,145 INFO L280 TraceCheckUtils]: 26: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 03:05:45,146 INFO L280 TraceCheckUtils]: 27: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,147 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 03:05:45,148 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 03:05:45,149 INFO L280 TraceCheckUtils]: 30: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:45,150 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 03:05:45,150 INFO L263 TraceCheckUtils]: 32: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,151 INFO L280 TraceCheckUtils]: 33: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,151 INFO L280 TraceCheckUtils]: 34: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,151 INFO L280 TraceCheckUtils]: 35: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 03:05:45,151 INFO L280 TraceCheckUtils]: 36: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,153 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 03:05:45,153 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 03:05:45,154 INFO L280 TraceCheckUtils]: 39: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} assume true; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:45,155 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10423#(<= |fibonacci_#in~n| 3)} {10367#true} #33#return; {10399#(<= fibonacci_~n 4)} is VALID [2020-07-29 03:05:45,156 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 03:05:45,157 INFO L280 TraceCheckUtils]: 42: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:45,157 INFO L280 TraceCheckUtils]: 43: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(~n < 1); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:45,158 INFO L280 TraceCheckUtils]: 44: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(1 == ~n); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:45,159 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 03:05:45,160 INFO L280 TraceCheckUtils]: 46: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {10403#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:45,160 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 03:05:45,161 INFO L280 TraceCheckUtils]: 48: Hoare triple {10404#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {10368#false} is VALID [2020-07-29 03:05:45,161 INFO L263 TraceCheckUtils]: 49: Hoare triple {10368#false} call #t~ret0 := fibonacci(~n - 1); {10368#false} is VALID [2020-07-29 03:05:45,164 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 03:05:45,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262517052] [2020-07-29 03:05:45,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247027533] [2020-07-29 03:05:45,165 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 03:05:45,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 03:05:45,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:05:45,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 03:05:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:45,506 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 03:05:45,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {10367#true} assume !(main_~x~0 > 46); {10367#true} is VALID [2020-07-29 03:05:45,507 INFO L263 TraceCheckUtils]: 2: Hoare triple {10367#true} call main_#t~ret3 := fibonacci(main_~x~0); {10367#true} is VALID [2020-07-29 03:05:45,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,507 INFO L280 TraceCheckUtils]: 4: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,507 INFO L280 TraceCheckUtils]: 5: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 03:05:45,507 INFO L263 TraceCheckUtils]: 6: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 03:05:45,508 INFO L280 TraceCheckUtils]: 7: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,508 INFO L280 TraceCheckUtils]: 8: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {10367#true} assume !(1 == ~n); {10367#true} is VALID [2020-07-29 03:05:45,508 INFO L263 TraceCheckUtils]: 10: Hoare triple {10367#true} call #t~ret0 := fibonacci(~n - 1); {10367#true} is VALID [2020-07-29 03:05:45,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {10367#true} ~n := #in~n; {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:45,509 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 03:05:45,509 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 03:05:45,509 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 03:05:45,510 INFO L280 TraceCheckUtils]: 15: Hoare triple {10367#true} ~n := #in~n; {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:45,510 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 03:05:45,511 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 03:05:45,511 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 03:05:45,511 INFO L280 TraceCheckUtils]: 19: Hoare triple {10367#true} ~n := #in~n; {10474#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:45,512 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 03:05:45,512 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 03:05:45,512 INFO L280 TraceCheckUtils]: 22: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} assume true; {10402#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:45,514 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 03:05:45,514 INFO L263 TraceCheckUtils]: 24: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,514 INFO L280 TraceCheckUtils]: 25: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,514 INFO L280 TraceCheckUtils]: 26: Hoare triple {10367#true} assume ~n < 1;#res := 0; {10367#true} is VALID [2020-07-29 03:05:45,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,516 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 03:05:45,516 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 03:05:45,516 INFO L280 TraceCheckUtils]: 30: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} assume true; {10400#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:45,517 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 03:05:45,518 INFO L263 TraceCheckUtils]: 32: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {10367#true} is VALID [2020-07-29 03:05:45,518 INFO L280 TraceCheckUtils]: 33: Hoare triple {10367#true} ~n := #in~n; {10367#true} is VALID [2020-07-29 03:05:45,518 INFO L280 TraceCheckUtils]: 34: Hoare triple {10367#true} assume !(~n < 1); {10367#true} is VALID [2020-07-29 03:05:45,518 INFO L280 TraceCheckUtils]: 35: Hoare triple {10367#true} assume 1 == ~n;#res := 1; {10367#true} is VALID [2020-07-29 03:05:45,518 INFO L280 TraceCheckUtils]: 36: Hoare triple {10367#true} assume true; {10367#true} is VALID [2020-07-29 03:05:45,519 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 03:05:45,519 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 03:05:45,520 INFO L280 TraceCheckUtils]: 39: Hoare triple {10423#(<= |fibonacci_#in~n| 3)} assume true; {10423#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:45,521 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10423#(<= |fibonacci_#in~n| 3)} {10367#true} #33#return; {10399#(<= fibonacci_~n 4)} is VALID [2020-07-29 03:05:45,522 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 03:05:45,522 INFO L280 TraceCheckUtils]: 42: Hoare triple {10400#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:45,523 INFO L280 TraceCheckUtils]: 43: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(~n < 1); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:45,524 INFO L280 TraceCheckUtils]: 44: Hoare triple {10401#(<= fibonacci_~n 2)} assume !(1 == ~n); {10401#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:45,525 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 03:05:45,525 INFO L280 TraceCheckUtils]: 46: Hoare triple {10402#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {10403#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:45,526 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 03:05:45,527 INFO L280 TraceCheckUtils]: 48: Hoare triple {10404#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {10368#false} is VALID [2020-07-29 03:05:45,528 INFO L263 TraceCheckUtils]: 49: Hoare triple {10368#false} call #t~ret0 := fibonacci(~n - 1); {10368#false} is VALID [2020-07-29 03:05:45,531 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 03:05:45,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:05:45,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 03:05:45,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606692072] [2020-07-29 03:05:45,532 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:05:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash 927645, now seen corresponding path program 2 times [2020-07-29 03:05:45,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:45,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367892134] [2020-07-29 03:05:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:45,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:45,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:45,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:45,596 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:45,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:45,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:45,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:45,597 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:45,597 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:45,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:45,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration5_Loop [2020-07-29 03:05:45,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:45,598 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:45,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,726 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:45,726 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 03:05:45,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,730 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 03:05:45,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:45,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,827 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:45,829 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:45,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:45,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:45,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:45,829 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:45,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:45,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:45,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration5_Loop [2020-07-29 03:05:45,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:45,830 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:45,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,950 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:45,950 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 03:05:45,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:45,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:45,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:45,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:45,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:45,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:45,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:45,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:45,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:45,965 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:45,965 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 03:05:45,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:45,970 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:45,970 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:45,970 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2020-07-29 03:05:45,996 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:45,998 INFO L393 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret0 := fibonacci(~n - 1);"< [2020-07-29 03:05:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 03:05:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:46,140 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,150 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,153 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,166 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,176 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 03:05:46,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {10588#unseeded} assume !(main_~x~0 > 46); {10588#unseeded} is VALID [2020-07-29 03:05:46,177 INFO L263 TraceCheckUtils]: 2: Hoare triple {10588#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {10588#unseeded} is VALID [2020-07-29 03:05:46,178 INFO L280 TraceCheckUtils]: 3: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,180 INFO L263 TraceCheckUtils]: 6: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,182 INFO L280 TraceCheckUtils]: 9: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,183 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 03:05:46,184 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 03:05:46,184 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 03:05:46,185 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 03:05:46,186 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 03:05:46,187 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 03:05:46,187 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 03:05:46,188 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 03:05:46,189 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 03:05:46,190 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 03:05:46,190 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 03:05:46,191 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 03:05:46,191 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 03:05:46,193 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 03:05:46,194 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 03:05:46,194 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 03:05:46,195 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 03:05:46,195 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 03:05:46,197 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 03:05:46,198 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 03:05:46,198 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 03:05:46,199 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 03:05:46,200 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 03:05:46,200 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 03:05:46,201 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 03:05:46,202 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 03:05:46,202 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 03:05:46,204 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 03:05:46,204 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 03:05:46,205 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 03:05:46,206 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 03:05:46,207 INFO L263 TraceCheckUtils]: 41: Hoare triple {10588#unseeded} call #t~ret1 := fibonacci(~n - 2); {10588#unseeded} is VALID [2020-07-29 03:05:46,208 INFO L280 TraceCheckUtils]: 42: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,208 INFO L280 TraceCheckUtils]: 43: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,209 INFO L280 TraceCheckUtils]: 44: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,210 INFO L263 TraceCheckUtils]: 45: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,211 INFO L280 TraceCheckUtils]: 46: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,212 INFO L280 TraceCheckUtils]: 47: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,212 INFO L280 TraceCheckUtils]: 48: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,213 INFO L263 TraceCheckUtils]: 49: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:46,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {10591#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {10754#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 03:05:46,301 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 03:05:46,309 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 03:05:46,311 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 03:05:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:46,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:46,353 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 03:05:46,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,355 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 03:05:46,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-07-29 03:05:46,502 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 03:05:46,502 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 03:05:46,502 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:46,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 03:05:46,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:46,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:46,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:46,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:46,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:46,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:46,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 239 states and 322 transitions. [2020-07-29 03:05:46,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:46,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:46,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:46,508 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 03:05:46,520 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:05:46,520 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:46,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:46,521 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:46,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 239 states and 322 transitions. cyclomatic complexity: 87 [2020-07-29 03:05:46,531 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:05:46,531 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 03:05:46,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,532 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 03:05:46,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,533 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 03:05:46,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:46,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,533 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 03:05:46,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,534 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 03:05:46,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,534 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 03:05:46,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,535 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 03:05:46,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 239 letters. Loop has 239 letters. [2020-07-29 03:05:46,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,536 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 03:05:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,536 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 03:05:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 217 letters. Loop has 217 letters. [2020-07-29 03:05:46,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,537 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 03:05:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,537 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 03:05:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:46,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,538 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 03:05:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,538 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 03:05:46,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,539 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 03:05:46,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,540 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 03:05:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:05:46,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,541 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 03:05:46,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,541 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 03:05:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 03:05:46,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,542 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 03:05:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,543 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 03:05:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 03:05:46,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,544 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 03:05:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,544 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 03:05:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 03:05:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,545 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 03:05:46,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,545 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 03:05:46,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:05:46,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,546 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 03:05:46,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,547 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 03:05:46,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:05:46,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,548 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 03:05:46,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,549 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 03:05:46,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:05:46,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,550 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 03:05:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,550 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 03:05:46,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 03:05:46,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,551 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 03:05:46,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,551 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 03:05:46,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 03:05:46,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,552 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 03:05:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,553 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 03:05:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:05:46,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,554 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 03:05:46,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,555 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 03:05:46,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,556 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 03:05:46,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,556 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 03:05:46,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:05:46,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,558 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 03:05:46,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,558 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 03:05:46,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:46,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,560 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 03:05:46,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,560 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 03:05:46,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:46,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,561 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 03:05:46,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,562 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 03:05:46,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:46,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,563 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 03:05:46,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,563 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 03:05:46,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:46,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,563 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 03:05:46,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,564 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 03:05:46,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:46,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,564 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 03:05:46,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,565 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 03:05:46,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:46,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,565 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 03:05:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,566 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 03:05:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 03:05:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,567 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 03:05:46,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,567 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 03:05:46,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:05:46,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,568 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 03:05:46,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,568 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 03:05:46,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:05:46,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,569 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 03:05:46,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,570 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 03:05:46,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:05:46,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,570 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 03:05:46,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,571 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 03:05:46,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:05:46,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,572 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 03:05:46,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,573 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 03:05:46,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:05:46,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,574 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 03:05:46,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,574 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 03:05:46,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:05:46,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,576 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 03:05:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,576 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 03:05:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,577 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 03:05:46,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,577 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 03:05:46,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 03:05:46,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,579 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 03:05:46,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,580 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 03:05:46,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 03:05:46,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,580 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 03:05:46,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,581 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 03:05:46,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 03:05:46,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,582 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 03:05:46,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,582 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 03:05:46,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 03:05:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,583 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 03:05:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,583 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 03:05:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,584 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 03:05:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,585 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 03:05:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,586 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 03:05:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,586 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 03:05:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,588 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:05:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 03:05:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:46,782 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,789 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,794 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,801 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:46,815 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 03:05:46,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {10588#unseeded} assume !(main_~x~0 > 46); {10588#unseeded} is VALID [2020-07-29 03:05:46,816 INFO L263 TraceCheckUtils]: 2: Hoare triple {10588#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {10588#unseeded} is VALID [2020-07-29 03:05:46,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,819 INFO L263 TraceCheckUtils]: 6: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,821 INFO L280 TraceCheckUtils]: 9: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,822 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 03:05:46,823 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 03:05:46,823 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 03:05:46,824 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 03:05:46,825 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 03:05:46,826 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 03:05:46,827 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 03:05:46,828 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 03:05:46,829 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 03:05:46,830 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 03:05:46,831 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 03:05:46,832 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 03:05:46,833 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 03:05:46,835 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 03:05:46,836 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 03:05:46,837 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 03:05:46,838 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 03:05:46,838 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 03:05:46,840 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 03:05:46,841 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 03:05:46,842 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 03:05:46,844 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 03:05:46,845 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 03:05:46,846 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 03:05:46,847 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 03:05:46,847 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 03:05:46,848 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 03:05:46,850 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 03:05:46,851 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 03:05:46,852 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 03:05:46,853 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 03:05:46,854 INFO L263 TraceCheckUtils]: 41: Hoare triple {10588#unseeded} call #t~ret1 := fibonacci(~n - 2); {10588#unseeded} is VALID [2020-07-29 03:05:46,855 INFO L280 TraceCheckUtils]: 42: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,856 INFO L280 TraceCheckUtils]: 43: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,857 INFO L280 TraceCheckUtils]: 44: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,858 INFO L263 TraceCheckUtils]: 45: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,859 INFO L280 TraceCheckUtils]: 46: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:46,860 INFO L280 TraceCheckUtils]: 47: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,861 INFO L280 TraceCheckUtils]: 48: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:46,862 INFO L263 TraceCheckUtils]: 49: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:46,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {10591#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {11176#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 03:05:46,927 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 03:05:46,928 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 03:05:46,930 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 03:05:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:46,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:46,963 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 03:05:46,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:46,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,964 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 03:05:46,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-07-29 03:05:47,090 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 03:05:47,091 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 03:05:47,091 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:47,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 03:05:47,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:47,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:47,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 239 states and 322 transitions. [2020-07-29 03:05:47,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:47,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,099 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 03:05:47,099 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:05:47,100 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:47,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:47,101 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:47,101 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 239 states and 322 transitions. cyclomatic complexity: 87 [2020-07-29 03:05:47,111 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:05:47,111 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 03:05:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,113 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 03:05:47,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,113 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 03:05:47,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:47,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,114 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 03:05:47,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,114 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 03:05:47,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,115 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 03:05:47,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,116 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 03:05:47,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 239 letters. Loop has 239 letters. [2020-07-29 03:05:47,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,116 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 03:05:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,117 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 03:05:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 217 letters. Loop has 217 letters. [2020-07-29 03:05:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,118 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 03:05:47,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,118 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 03:05:47,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:47,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,119 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 03:05:47,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,119 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 03:05:47,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,120 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 03:05:47,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,121 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 03:05:47,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:05:47,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,122 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 03:05:47,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,122 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 03:05:47,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 03:05:47,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,123 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 03:05:47,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,124 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 03:05:47,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 03:05:47,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,124 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 03:05:47,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,125 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 03:05:47,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 03:05:47,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,126 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 03:05:47,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,126 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 03:05:47,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:05:47,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,127 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 03:05:47,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,127 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 03:05:47,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:05:47,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,128 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 03:05:47,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,129 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 03:05:47,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:05:47,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,130 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 03:05:47,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,130 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 03:05:47,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 03:05:47,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,131 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 03:05:47,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,131 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 03:05:47,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 03:05:47,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,132 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 03:05:47,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,133 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 03:05:47,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:05:47,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,134 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 03:05:47,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,134 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 03:05:47,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,135 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 03:05:47,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,136 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 03:05:47,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:05:47,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,137 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 03:05:47,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,137 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 03:05:47,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:47,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,138 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 03:05:47,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,139 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 03:05:47,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,140 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 03:05:47,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,140 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 03:05:47,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:47,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,141 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 03:05:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,142 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 03:05:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,142 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 03:05:47,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,143 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 03:05:47,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,144 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 03:05:47,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,144 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 03:05:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 123 letters. Loop has 39 letters. [2020-07-29 03:05:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,145 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 03:05:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,146 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 03:05:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:05:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,147 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 03:05:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,148 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 03:05:47,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:05:47,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,149 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 03:05:47,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,149 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 03:05:47,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:05:47,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,150 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 03:05:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,151 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 03:05:47,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 03:05:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,152 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 03:05:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,152 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 03:05:47,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 89 letters. Loop has 39 letters. [2020-07-29 03:05:47,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,153 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 03:05:47,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,154 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 03:05:47,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 90 letters. Loop has 39 letters. [2020-07-29 03:05:47,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,155 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 03:05:47,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,155 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 03:05:47,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 91 letters. Loop has 39 letters. [2020-07-29 03:05:47,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,156 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 03:05:47,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,157 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 03:05:47,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,157 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 03:05:47,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,158 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 03:05:47,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 92 letters. Loop has 39 letters. [2020-07-29 03:05:47,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,159 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 03:05:47,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,159 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 03:05:47,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 03:05:47,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,160 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 03:05:47,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,160 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 03:05:47,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 03:05:47,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,161 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 03:05:47,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,162 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 03:05:47,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 03:05:47,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,162 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 03:05:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,163 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 03:05:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 123 letters. Loop has 39 letters. [2020-07-29 03:05:47,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,164 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 03:05:47,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,164 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 03:05:47,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,165 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 03:05:47,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,166 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 03:05:47,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,167 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:05:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:47,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 03:05:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:47,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:47,287 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:47,293 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:47,303 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:47,313 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:47,322 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 03:05:47,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {10588#unseeded} assume !(main_~x~0 > 46); {10588#unseeded} is VALID [2020-07-29 03:05:47,324 INFO L263 TraceCheckUtils]: 2: Hoare triple {10588#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {10588#unseeded} is VALID [2020-07-29 03:05:47,324 INFO L280 TraceCheckUtils]: 3: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:47,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:47,326 INFO L263 TraceCheckUtils]: 6: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:47,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,328 INFO L280 TraceCheckUtils]: 9: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:47,329 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 03:05:47,330 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 03:05:47,331 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 03:05:47,332 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 03:05:47,333 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 03:05:47,333 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 03:05:47,334 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 03:05:47,335 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 03:05:47,336 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 03:05:47,336 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 03:05:47,337 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 03:05:47,338 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 03:05:47,338 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 03:05:47,340 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 03:05:47,341 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 03:05:47,342 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 03:05:47,342 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 03:05:47,343 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 03:05:47,344 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 03:05:47,345 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 03:05:47,345 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 03:05:47,347 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 03:05:47,349 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 03:05:47,349 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 03:05:47,350 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 03:05:47,350 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 03:05:47,351 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 03:05:47,353 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 03:05:47,354 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 03:05:47,354 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 03:05:47,355 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 03:05:47,356 INFO L263 TraceCheckUtils]: 41: Hoare triple {10588#unseeded} call #t~ret1 := fibonacci(~n - 2); {10588#unseeded} is VALID [2020-07-29 03:05:47,362 INFO L280 TraceCheckUtils]: 42: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:47,363 INFO L280 TraceCheckUtils]: 43: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,364 INFO L280 TraceCheckUtils]: 44: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:47,365 INFO L263 TraceCheckUtils]: 45: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,365 INFO L280 TraceCheckUtils]: 46: Hoare triple {10588#unseeded} ~n := #in~n; {10588#unseeded} is VALID [2020-07-29 03:05:47,366 INFO L280 TraceCheckUtils]: 47: Hoare triple {10588#unseeded} assume !(~n < 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,367 INFO L280 TraceCheckUtils]: 48: Hoare triple {10588#unseeded} assume !(1 == ~n); {10588#unseeded} is VALID [2020-07-29 03:05:47,367 INFO L263 TraceCheckUtils]: 49: Hoare triple {10588#unseeded} call #t~ret0 := fibonacci(~n - 1); {10588#unseeded} is VALID [2020-07-29 03:05:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:47,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:47,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:47,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {10591#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {11598#(<= fibonacci_~n oldRank0)} is VALID [2020-07-29 03:05:47,433 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 03:05:47,434 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 03:05:47,436 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 03:05:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:47,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:47,472 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 03:05:47,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,473 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 03:05:47,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 297 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-07-29 03:05:47,664 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 03:05:47,665 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 03:05:47,665 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:47,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 03:05:47,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:47,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:47,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 375 transitions. [2020-07-29 03:05:47,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:47,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 217 states and 297 transitions. cyclomatic complexity: 84 [2020-07-29 03:05:47,672 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:05:47,672 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:47,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:47,673 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:47,673 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 290 states and 375 transitions. cyclomatic complexity: 89 [2020-07-29 03:05:47,677 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:05:47,678 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 03:05:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,679 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 03:05:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,679 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 03:05:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,680 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 03:05:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,680 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 03:05:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 03:05:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,681 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 03:05:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,682 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 03:05:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 290 letters. Loop has 290 letters. [2020-07-29 03:05:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,682 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 03:05:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,683 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 03:05:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 217 letters. Loop has 217 letters. [2020-07-29 03:05:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,683 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 03:05:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,684 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 03:05:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,685 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 03:05:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,685 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 03:05:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,686 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 03:05:47,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,687 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 03:05:47,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 39 letters. [2020-07-29 03:05:47,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,688 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 03:05:47,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,689 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 03:05:47,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 39 letters. [2020-07-29 03:05:47,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,690 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 03:05:47,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,691 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 03:05:47,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 4 letters. [2020-07-29 03:05:47,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,691 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 03:05:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,692 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 03:05:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 4 letters. [2020-07-29 03:05:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,693 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 03:05:47,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,693 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 03:05:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:05:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,694 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 03:05:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,695 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 03:05:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:05:47,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,696 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 03:05:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,697 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 03:05:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:05:47,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,698 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 03:05:47,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,699 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 03:05:47,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 4 letters. [2020-07-29 03:05:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,700 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 03:05:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,700 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 03:05:47,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 03:05:47,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,701 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 03:05:47,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,702 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 03:05:47,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:05:47,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,704 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 03:05:47,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,704 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 03:05:47,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,705 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 03:05:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,705 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 03:05:47,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 83 letters. Loop has 39 letters. [2020-07-29 03:05:47,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,707 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 03:05:47,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,707 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 03:05:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,708 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 03:05:47,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,709 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 03:05:47,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,711 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 03:05:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,711 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 03:05:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 119 letters. Loop has 39 letters. [2020-07-29 03:05:47,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,712 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 03:05:47,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,713 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 03:05:47,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:47,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,714 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 03:05:47,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,714 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 03:05:47,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,716 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 03:05:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,716 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 03:05:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 85 letters. Loop has 39 letters. [2020-07-29 03:05:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,718 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 03:05:47,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,718 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 03:05:47,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 86 letters. Loop has 39 letters. [2020-07-29 03:05:47,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,719 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 03:05:47,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,720 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 03:05:47,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 87 letters. Loop has 39 letters. [2020-07-29 03:05:47,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,721 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 03:05:47,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,722 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 03:05:47,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 88 letters. Loop has 39 letters. [2020-07-29 03:05:47,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,723 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 03:05:47,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,724 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 03:05:47,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 89 letters. Loop has 39 letters. [2020-07-29 03:05:47,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 89 letters. Loop has 39 letters. [2020-07-29 03:05:47,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,726 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 03:05:47,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 123 letters. Loop has 39 letters. [2020-07-29 03:05:47,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 123 letters. Loop has 39 letters. [2020-07-29 03:05:47,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,728 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 03:05:47,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 84 letters. Loop has 43 letters. [2020-07-29 03:05:47,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,730 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 03:05:47,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,730 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 03:05:47,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 123 letters. Loop has 39 letters. [2020-07-29 03:05:47,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 290 states and 375 transitions. cyclomatic complexity: 89 Stem has 123 letters. Loop has 39 letters. [2020-07-29 03:05:47,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,733 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 03:05:47,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 50 letters. Loop has 4 letters. [2020-07-29 03:05:47,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 54 letters. Loop has 4 letters. [2020-07-29 03:05:47,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 50 letters. Loop has 8 letters. [2020-07-29 03:05:47,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 375 transitions. cyclomatic complexity: 89 [2020-07-29 03:05:47,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:47,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 235 states and 318 transitions. [2020-07-29 03:05:47,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2020-07-29 03:05:47,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2020-07-29 03:05:47,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 318 transitions. [2020-07-29 03:05:47,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:47,766 INFO L688 BuchiCegarLoop]: Abstraction has 235 states and 318 transitions. [2020-07-29 03:05:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 318 transitions. [2020-07-29 03:05:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2020-07-29 03:05:47,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:47,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states and 318 transitions. Second operand 229 states. [2020-07-29 03:05:47,774 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states and 318 transitions. Second operand 229 states. [2020-07-29 03:05:47,774 INFO L87 Difference]: Start difference. First operand 235 states and 318 transitions. Second operand 229 states. [2020-07-29 03:05:47,775 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:47,868 INFO L93 Difference]: Finished difference Result 875 states and 1203 transitions. [2020-07-29 03:05:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1203 transitions. [2020-07-29 03:05:47,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:47,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:47,876 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 235 states and 318 transitions. [2020-07-29 03:05:47,876 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 235 states and 318 transitions. [2020-07-29 03:05:47,876 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:47,964 INFO L93 Difference]: Finished difference Result 875 states and 1203 transitions. [2020-07-29 03:05:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1203 transitions. [2020-07-29 03:05:47,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:47,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:47,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:47,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-29 03:05:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 311 transitions. [2020-07-29 03:05:47,985 INFO L711 BuchiCegarLoop]: Abstraction has 229 states and 311 transitions. [2020-07-29 03:05:47,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 03:05:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:05:47,986 INFO L87 Difference]: Start difference. First operand 229 states and 311 transitions. Second operand 11 states. [2020-07-29 03:05:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:48,561 INFO L93 Difference]: Finished difference Result 414 states and 604 transitions. [2020-07-29 03:05:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:05:48,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 03:05:48,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:48,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 604 transitions. [2020-07-29 03:05:48,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:48,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 401 states and 586 transitions. [2020-07-29 03:05:48,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2020-07-29 03:05:48,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2020-07-29 03:05:48,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 586 transitions. [2020-07-29 03:05:48,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:48,699 INFO L688 BuchiCegarLoop]: Abstraction has 401 states and 586 transitions. [2020-07-29 03:05:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 586 transitions. [2020-07-29 03:05:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 291. [2020-07-29 03:05:48,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:48,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states and 586 transitions. Second operand 291 states. [2020-07-29 03:05:48,719 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states and 586 transitions. Second operand 291 states. [2020-07-29 03:05:48,719 INFO L87 Difference]: Start difference. First operand 401 states and 586 transitions. Second operand 291 states. [2020-07-29 03:05:48,720 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:48,974 INFO L93 Difference]: Finished difference Result 1537 states and 2212 transitions. [2020-07-29 03:05:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2212 transitions. [2020-07-29 03:05:48,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:48,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:48,988 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 401 states and 586 transitions. [2020-07-29 03:05:48,988 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 401 states and 586 transitions. [2020-07-29 03:05:48,989 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:49,229 INFO L93 Difference]: Finished difference Result 1599 states and 2243 transitions. [2020-07-29 03:05:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2243 transitions. [2020-07-29 03:05:49,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:49,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:49,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:49,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-07-29 03:05:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-07-29 03:05:49,258 INFO L711 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 03:05:49,258 INFO L591 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 03:05:49,258 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:05:49,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. [2020-07-29 03:05:49,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:49,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:49,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:49,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 9, 8, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2020-07-29 03:05:49,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:49,263 INFO L794 eck$LassoCheckResult]: Stem: 15621#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; 15622#L27 assume !(main_~x~0 > 46); 15623#L30 call main_#t~ret3 := fibonacci(main_~x~0);< 15636#fibonacciENTRY ~n := #in~n; 15668#L15 assume !(~n < 1); 15667#L17 assume !(1 == ~n); 15658#L20 call #t~ret0 := fibonacci(~n - 1);< 15666#fibonacciENTRY ~n := #in~n; 15740#L15 assume !(~n < 1); 15739#L17 assume !(1 == ~n); 15660#L20 call #t~ret0 := fibonacci(~n - 1);< 15662#fibonacciENTRY ~n := #in~n; 15741#L15 assume !(~n < 1); 15669#L17 assume !(1 == ~n); 15659#L20 call #t~ret0 := fibonacci(~n - 1);< 15662#fibonacciENTRY ~n := #in~n; 15741#L15 assume !(~n < 1); 15669#L17 assume !(1 == ~n); 15659#L20 call #t~ret0 := fibonacci(~n - 1);< 15662#fibonacciENTRY ~n := #in~n; 15742#L15 assume !(~n < 1); 15771#L17 assume 1 == ~n;#res := 1; 15770#fibonacciFINAL assume true; 15767#fibonacciEXIT >#33#return; 15764#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15765#fibonacciENTRY ~n := #in~n; 15773#L15 assume ~n < 1;#res := 0; 15772#fibonacciFINAL assume true; 15763#fibonacciEXIT >#35#return; 15759#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15756#fibonacciFINAL assume true; 15738#fibonacciEXIT >#33#return; 15703#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15706#fibonacciENTRY ~n := #in~n; 15743#L15 assume !(~n < 1); 15735#L17 assume 1 == ~n;#res := 1; 15646#fibonacciFINAL assume true; 15702#fibonacciEXIT >#35#return; 15692#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15690#fibonacciFINAL assume true; 15684#fibonacciEXIT >#33#return; 15681#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15686#fibonacciENTRY ~n := #in~n; 15737#L15 assume !(~n < 1); 15736#L17 assume !(1 == ~n); 15718#L20 call #t~ret0 := fibonacci(~n - 1);< 15719#fibonacciENTRY ~n := #in~n; 15821#L15 assume !(~n < 1); 15731#L17 assume 1 == ~n;#res := 1; 15729#fibonacciFINAL assume true; 15717#fibonacciEXIT >#33#return; 15697#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15701#fibonacciENTRY ~n := #in~n; 15734#L15 assume ~n < 1;#res := 0; 15733#fibonacciFINAL assume true; 15693#fibonacciEXIT >#35#return; 15700#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15688#fibonacciFINAL assume true; 15680#fibonacciEXIT >#35#return; 15661#L20-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 15664#fibonacciFINAL assume true; 15657#fibonacciEXIT >#33#return; 15645#L20-1 call #t~ret1 := fibonacci(~n - 2);< 15651#fibonacciENTRY ~n := #in~n; 15652#L15 assume !(~n < 1); 15643#L17 assume !(1 == ~n); 15606#L20 call #t~ret0 := fibonacci(~n - 1);< 15823#fibonacciENTRY ~n := #in~n; 15619#L15 assume !(~n < 1); 15620#L17 assume !(1 == ~n); 15604#L20 call #t~ret0 := fibonacci(~n - 1);< 15607#fibonacciENTRY ~n := #in~n; 15627#L15 assume !(~n < 1); 15858#L17 assume !(1 == ~n); 15625#L20 [2020-07-29 03:05:49,264 INFO L796 eck$LassoCheckResult]: Loop: 15625#L20 call #t~ret0 := fibonacci(~n - 1);< 15607#fibonacciENTRY ~n := #in~n; 15627#L15 assume !(~n < 1); 15858#L17 assume !(1 == ~n); 15625#L20 [2020-07-29 03:05:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2117965904, now seen corresponding path program 5 times [2020-07-29 03:05:49,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:49,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553256644] [2020-07-29 03:05:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 03:05:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,561 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 03:05:49,564 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 03:05:49,566 INFO L280 TraceCheckUtils]: 3: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:49,569 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 03:05:49,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:05:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,576 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 03:05:49,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,578 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 03:05:49,578 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 03:05:49,579 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 03:05:49,579 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,580 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 03:05:49,581 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 03:05:49,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:49,584 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 03:05:49,584 INFO L263 TraceCheckUtils]: 9: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,584 INFO L280 TraceCheckUtils]: 10: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,585 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,586 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 03:05:49,587 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 03:05:49,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:49,590 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 03:05:49,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-07-29 03:05:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,598 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,600 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 03:05:49,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,601 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 03:05:49,602 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 03:05:49,603 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 03:05:49,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,604 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 03:05:49,605 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 03:05:49,605 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 03:05:49,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,607 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 03:05:49,607 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 03:05:49,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:49,610 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 03:05:49,610 INFO L263 TraceCheckUtils]: 13: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,611 INFO L280 TraceCheckUtils]: 14: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,612 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 03:05:49,613 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 03:05:49,614 INFO L280 TraceCheckUtils]: 19: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:49,616 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 03:05:49,616 INFO L263 TraceCheckUtils]: 21: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,616 INFO L280 TraceCheckUtils]: 22: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,616 INFO L280 TraceCheckUtils]: 23: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,617 INFO L280 TraceCheckUtils]: 24: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,617 INFO L280 TraceCheckUtils]: 25: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,618 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 03:05:49,619 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 03:05:49,620 INFO L280 TraceCheckUtils]: 28: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:49,622 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 03:05:49,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 03:05:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,646 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 03:05:49,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-29 03:05:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,652 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 03:05:49,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 03:05:49,654 INFO L263 TraceCheckUtils]: 3: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 03:05:49,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,654 INFO L280 TraceCheckUtils]: 5: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,654 INFO L280 TraceCheckUtils]: 6: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,655 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 03:05:49,655 INFO L263 TraceCheckUtils]: 9: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,656 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 03:05:49,656 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 03:05:49,656 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,657 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 03:05:49,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,659 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 03:05:49,659 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 03:05:49,660 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 03:05:49,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,664 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 03:05:49,665 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 03:05:49,665 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 03:05:49,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,666 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 03:05:49,667 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 03:05:49,667 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 03:05:49,667 INFO L280 TraceCheckUtils]: 12: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,668 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 03:05:49,669 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 03:05:49,670 INFO L280 TraceCheckUtils]: 15: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:49,672 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 03:05:49,672 INFO L263 TraceCheckUtils]: 17: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,672 INFO L280 TraceCheckUtils]: 18: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,672 INFO L280 TraceCheckUtils]: 19: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,673 INFO L280 TraceCheckUtils]: 20: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,674 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 03:05:49,674 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 03:05:49,675 INFO L280 TraceCheckUtils]: 23: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:49,676 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 03:05:49,677 INFO L263 TraceCheckUtils]: 25: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,677 INFO L280 TraceCheckUtils]: 26: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,677 INFO L280 TraceCheckUtils]: 27: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,677 INFO L280 TraceCheckUtils]: 28: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,677 INFO L280 TraceCheckUtils]: 29: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,678 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 03:05:49,679 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 03:05:49,679 INFO L280 TraceCheckUtils]: 32: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:49,681 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 03:05:49,681 INFO L263 TraceCheckUtils]: 34: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,681 INFO L280 TraceCheckUtils]: 35: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,681 INFO L280 TraceCheckUtils]: 36: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,682 INFO L280 TraceCheckUtils]: 37: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 03:05:49,682 INFO L263 TraceCheckUtils]: 38: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 03:05:49,682 INFO L280 TraceCheckUtils]: 39: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,682 INFO L280 TraceCheckUtils]: 40: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,682 INFO L280 TraceCheckUtils]: 41: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,683 INFO L280 TraceCheckUtils]: 42: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,683 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 03:05:49,683 INFO L263 TraceCheckUtils]: 44: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,683 INFO L280 TraceCheckUtils]: 45: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,683 INFO L280 TraceCheckUtils]: 46: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,684 INFO L280 TraceCheckUtils]: 47: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,684 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 03:05:49,684 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 03:05:49,684 INFO L280 TraceCheckUtils]: 50: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,685 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 03:05:49,686 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 03:05:49,686 INFO L280 TraceCheckUtils]: 53: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} assume true; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 03:05:49,688 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {21258#(<= |fibonacci_#in~n| 4)} {21162#true} #33#return; {21219#(<= fibonacci_~n 5)} is VALID [2020-07-29 03:05:49,690 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 03:05:49,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(main_~x~0 > 46); {21162#true} is VALID [2020-07-29 03:05:49,691 INFO L263 TraceCheckUtils]: 2: Hoare triple {21162#true} call main_#t~ret3 := fibonacci(main_~x~0); {21162#true} is VALID [2020-07-29 03:05:49,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 03:05:49,692 INFO L263 TraceCheckUtils]: 6: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 03:05:49,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,693 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 03:05:49,694 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 03:05:49,694 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 03:05:49,694 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,695 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 03:05:49,696 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 03:05:49,696 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 03:05:49,696 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,697 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 03:05:49,697 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 03:05:49,698 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 03:05:49,698 INFO L280 TraceCheckUtils]: 19: Hoare triple {21162#true} ~n := #in~n; {21227#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-29 03:05:49,699 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 03:05:49,699 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 03:05:49,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} assume true; {21224#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-29 03:05:49,701 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 03:05:49,701 INFO L263 TraceCheckUtils]: 24: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,702 INFO L280 TraceCheckUtils]: 25: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,702 INFO L280 TraceCheckUtils]: 26: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,702 INFO L280 TraceCheckUtils]: 27: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,703 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 03:05:49,704 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 03:05:49,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:49,706 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 03:05:49,706 INFO L263 TraceCheckUtils]: 32: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,706 INFO L280 TraceCheckUtils]: 33: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,706 INFO L280 TraceCheckUtils]: 34: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,706 INFO L280 TraceCheckUtils]: 35: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,706 INFO L280 TraceCheckUtils]: 36: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,707 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 03:05:49,708 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 03:05:49,708 INFO L280 TraceCheckUtils]: 39: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:49,710 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 03:05:49,710 INFO L263 TraceCheckUtils]: 41: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,710 INFO L280 TraceCheckUtils]: 42: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,711 INFO L280 TraceCheckUtils]: 43: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,711 INFO L280 TraceCheckUtils]: 44: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 03:05:49,711 INFO L263 TraceCheckUtils]: 45: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 03:05:49,711 INFO L280 TraceCheckUtils]: 46: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,711 INFO L280 TraceCheckUtils]: 47: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:49,712 INFO L280 TraceCheckUtils]: 48: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:49,712 INFO L280 TraceCheckUtils]: 49: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,712 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 03:05:49,712 INFO L263 TraceCheckUtils]: 51: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:49,712 INFO L280 TraceCheckUtils]: 52: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:49,712 INFO L280 TraceCheckUtils]: 53: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:49,713 INFO L280 TraceCheckUtils]: 54: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,713 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 03:05:49,713 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 03:05:49,713 INFO L280 TraceCheckUtils]: 57: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:49,714 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 03:05:49,715 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 03:05:49,716 INFO L280 TraceCheckUtils]: 60: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} assume true; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 03:05:49,717 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {21258#(<= |fibonacci_#in~n| 4)} {21162#true} #33#return; {21219#(<= fibonacci_~n 5)} is VALID [2020-07-29 03:05:49,718 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 03:05:49,719 INFO L280 TraceCheckUtils]: 63: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:49,720 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(~n < 1); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:49,720 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(1 == ~n); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:49,722 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 03:05:49,723 INFO L280 TraceCheckUtils]: 67: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:49,724 INFO L280 TraceCheckUtils]: 68: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(~n < 1); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:49,724 INFO L280 TraceCheckUtils]: 69: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(1 == ~n); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:49,726 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 03:05:49,727 INFO L280 TraceCheckUtils]: 71: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {21225#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:49,728 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 03:05:49,729 INFO L280 TraceCheckUtils]: 73: Hoare triple {21226#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {21163#false} is VALID [2020-07-29 03:05:49,736 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 03:05:49,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553256644] [2020-07-29 03:05:49,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626440608] [2020-07-29 03:05:49,737 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 03:05:49,786 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2020-07-29 03:05:49,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:05:49,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 03:05:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:50,268 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 03:05:50,269 INFO L280 TraceCheckUtils]: 1: Hoare triple {21162#true} assume !(main_~x~0 > 46); {21162#true} is VALID [2020-07-29 03:05:50,269 INFO L263 TraceCheckUtils]: 2: Hoare triple {21162#true} call main_#t~ret3 := fibonacci(main_~x~0); {21162#true} is VALID [2020-07-29 03:05:50,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:50,270 INFO L280 TraceCheckUtils]: 4: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:50,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 03:05:50,270 INFO L263 TraceCheckUtils]: 6: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 03:05:50,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:50,271 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 03:05:50,272 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 03:05:50,272 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 03:05:50,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:50,279 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 03:05:50,279 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 03:05:50,280 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 03:05:50,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:50,281 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 03:05:50,281 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 03:05:50,282 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 03:05:50,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:50,282 INFO L280 TraceCheckUtils]: 20: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:50,282 INFO L280 TraceCheckUtils]: 21: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:50,282 INFO L280 TraceCheckUtils]: 22: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:50,283 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 03:05:50,284 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 03:05:50,284 INFO L280 TraceCheckUtils]: 25: Hoare triple {21162#true} ~n := #in~n; {21340#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-29 03:05:50,285 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 03:05:50,286 INFO L280 TraceCheckUtils]: 27: Hoare triple {21398#(<= |fibonacci_#in~n| 0)} assume true; {21398#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-29 03:05:50,287 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 03:05:50,288 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 03:05:50,289 INFO L280 TraceCheckUtils]: 30: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} assume true; {21222#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-29 03:05:50,290 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 03:05:50,291 INFO L263 TraceCheckUtils]: 32: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:50,291 INFO L280 TraceCheckUtils]: 33: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:50,291 INFO L280 TraceCheckUtils]: 34: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:50,291 INFO L280 TraceCheckUtils]: 35: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:50,291 INFO L280 TraceCheckUtils]: 36: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:50,295 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 03:05:50,296 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 03:05:50,296 INFO L280 TraceCheckUtils]: 39: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} assume true; {21220#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-29 03:05:50,297 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 03:05:50,297 INFO L263 TraceCheckUtils]: 41: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:50,297 INFO L280 TraceCheckUtils]: 42: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:50,297 INFO L280 TraceCheckUtils]: 43: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L280 TraceCheckUtils]: 44: Hoare triple {21162#true} assume !(1 == ~n); {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L263 TraceCheckUtils]: 45: Hoare triple {21162#true} call #t~ret0 := fibonacci(~n - 1); {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L280 TraceCheckUtils]: 46: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L280 TraceCheckUtils]: 47: Hoare triple {21162#true} assume !(~n < 1); {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L280 TraceCheckUtils]: 48: Hoare triple {21162#true} assume 1 == ~n;#res := 1; {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L280 TraceCheckUtils]: 49: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:50,298 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {21162#true} {21162#true} #33#return; {21162#true} is VALID [2020-07-29 03:05:50,299 INFO L263 TraceCheckUtils]: 51: Hoare triple {21162#true} call #t~ret1 := fibonacci(~n - 2); {21162#true} is VALID [2020-07-29 03:05:50,299 INFO L280 TraceCheckUtils]: 52: Hoare triple {21162#true} ~n := #in~n; {21162#true} is VALID [2020-07-29 03:05:50,299 INFO L280 TraceCheckUtils]: 53: Hoare triple {21162#true} assume ~n < 1;#res := 0; {21162#true} is VALID [2020-07-29 03:05:50,299 INFO L280 TraceCheckUtils]: 54: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:50,299 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {21162#true} {21162#true} #35#return; {21162#true} is VALID [2020-07-29 03:05:50,299 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 03:05:50,300 INFO L280 TraceCheckUtils]: 57: Hoare triple {21162#true} assume true; {21162#true} is VALID [2020-07-29 03:05:50,301 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 03:05:50,301 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 03:05:50,302 INFO L280 TraceCheckUtils]: 60: Hoare triple {21258#(<= |fibonacci_#in~n| 4)} assume true; {21258#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-29 03:05:50,303 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {21258#(<= |fibonacci_#in~n| 4)} {21162#true} #33#return; {21219#(<= fibonacci_~n 5)} is VALID [2020-07-29 03:05:50,304 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 03:05:50,304 INFO L280 TraceCheckUtils]: 63: Hoare triple {21220#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:50,305 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(~n < 1); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:50,305 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#(<= fibonacci_~n 3)} assume !(1 == ~n); {21221#(<= fibonacci_~n 3)} is VALID [2020-07-29 03:05:50,306 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 03:05:50,307 INFO L280 TraceCheckUtils]: 67: Hoare triple {21222#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:50,307 INFO L280 TraceCheckUtils]: 68: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(~n < 1); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:50,308 INFO L280 TraceCheckUtils]: 69: Hoare triple {21223#(<= fibonacci_~n 2)} assume !(1 == ~n); {21223#(<= fibonacci_~n 2)} is VALID [2020-07-29 03:05:50,309 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 03:05:50,309 INFO L280 TraceCheckUtils]: 71: Hoare triple {21224#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {21225#(<= fibonacci_~n 1)} is VALID [2020-07-29 03:05:50,310 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 03:05:50,310 INFO L280 TraceCheckUtils]: 73: Hoare triple {21226#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {21163#false} is VALID [2020-07-29 03:05:50,314 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 03:05:50,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:05:50,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2020-07-29 03:05:50,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349367159] [2020-07-29 03:05:50,316 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:05:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1876965, now seen corresponding path program 3 times [2020-07-29 03:05:50,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:50,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744852539] [2020-07-29 03:05:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:50,389 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:50,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:50,389 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:50,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:50,389 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:50,390 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,390 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:50,390 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:50,390 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration6_Loop [2020-07-29 03:05:50,390 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:50,390 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:50,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 03:05:50,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:50,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:50,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:50,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:50,513 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 03:05:50,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:50,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:50,520 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:50,521 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 03:05:50,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:50,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:50,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:50,548 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:50,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:50,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:50,575 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 03:05:50,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:50,599 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 03:05:50,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:50,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:58,294 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:58,296 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:58,296 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:58,296 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:58,296 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:58,296 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:58,296 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:58,296 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:58,296 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:58,296 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci03.c_Iteration6_Loop [2020-07-29 03:05:58,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:58,297 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:58,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:58,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:58,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:58,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:58,401 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:58,401 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 03:05:58,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:58,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:58,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:58,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:58,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:58,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:58,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:58,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:58,413 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 03:05:58,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:58,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:58,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:58,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:58,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:58,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:58,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:58,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:58,438 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) [2020-07-29 03:05:58,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:58,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:58,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:58,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:58,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:58,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:58,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:58,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:58,466 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 03:05:58,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:58,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:58,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:58,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:58,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:58,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:58,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:58,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:58,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:58,510 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:58,511 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 03:05:58,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:58,529 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:58,529 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:58,529 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2020-07-29 03:05:58,550 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:58,552 INFO L393 LassoCheck]: Loop: "call #t~ret0 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2020-07-29 03:05:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:58,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 03:05:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:58,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:58,701 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,707 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,712 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,721 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,729 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,743 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,749 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,753 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:58,759 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 03:05:58,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {21539#unseeded} assume !(main_~x~0 > 46); {21539#unseeded} is VALID [2020-07-29 03:05:58,761 INFO L263 TraceCheckUtils]: 2: Hoare triple {21539#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {21539#unseeded} is VALID [2020-07-29 03:05:58,762 INFO L280 TraceCheckUtils]: 3: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:58,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:58,763 INFO L280 TraceCheckUtils]: 5: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:58,763 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 03:05:58,764 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 03:05:58,764 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 03:05:58,764 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 03:05:58,765 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 03:05:58,765 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 03:05:58,766 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 03:05:58,766 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 03:05:58,767 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 03:05:58,767 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 03:05:58,767 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 03:05:58,768 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 03:05:58,768 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 03:05:58,769 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 03:05:58,769 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 03:05:58,769 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 03:05:58,770 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 03:05:58,771 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 03:05:58,772 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 03:05:58,773 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 03:05:58,773 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 03:05:58,773 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 03:05:58,774 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 03:05:58,775 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 03:05:58,776 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 03:05:58,777 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 03:05:58,778 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 03:05:58,778 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 03:05:58,779 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 03:05:58,779 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 03:05:58,779 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 03:05:58,780 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 03:05:58,781 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 03:05:58,781 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 03:05:58,782 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 03:05:58,783 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 03:05:58,783 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 03:05:58,783 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 03:05:58,784 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 03:05:58,784 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 03:05:58,785 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 03:05:58,785 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 03:05:58,786 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 03:05:58,786 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 03:05:58,788 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 03:05:58,788 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 03:05:58,790 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 03:05:58,791 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 03:05:58,791 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 03:05:58,792 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 03:05:58,793 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 03:05:58,793 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 03:05:58,795 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 03:05:58,796 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 03:05:58,796 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 03:05:58,798 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 03:05:58,798 INFO L263 TraceCheckUtils]: 62: Hoare triple {21539#unseeded} call #t~ret1 := fibonacci(~n - 2); {21539#unseeded} is VALID [2020-07-29 03:05:58,799 INFO L280 TraceCheckUtils]: 63: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:58,800 INFO L280 TraceCheckUtils]: 64: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:58,800 INFO L280 TraceCheckUtils]: 65: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:58,801 INFO L263 TraceCheckUtils]: 66: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 03:05:58,802 INFO L280 TraceCheckUtils]: 67: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:58,802 INFO L280 TraceCheckUtils]: 68: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:58,802 INFO L280 TraceCheckUtils]: 69: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:58,803 INFO L263 TraceCheckUtils]: 70: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 03:05:58,803 INFO L280 TraceCheckUtils]: 71: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:58,804 INFO L280 TraceCheckUtils]: 72: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:58,804 INFO L280 TraceCheckUtils]: 73: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:58,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:58,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:58,946 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 03:05:58,947 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 03:05:58,948 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 03:05:58,949 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 03:05:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:58,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:05:58,986 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 03:05:58,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:58,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:58,987 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 03:05:58,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138 Second operand 6 states. [2020-07-29 03:05:59,109 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 03:05:59,110 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 03:05:59,110 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:59,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 03:05:59,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:59,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:59,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:05:59,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:59,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:59,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:59,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 435 transitions. [2020-07-29 03:05:59,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:59,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:59,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:59,116 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 03:05:59,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:05:59,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:05:59,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:59,123 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:59,123 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 300 states and 435 transitions. cyclomatic complexity: 139 [2020-07-29 03:05:59,129 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:05:59,130 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 03:05:59,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:59,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,131 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 03:05:59,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,131 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 03:05:59,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:59,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,132 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 03:05:59,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,132 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 03:05:59,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:59,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,133 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 03:05:59,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,133 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 03:05:59,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 300 letters. Loop has 300 letters. [2020-07-29 03:05:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,134 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 03:05:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,134 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 03:05:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 291 letters. Loop has 291 letters. [2020-07-29 03:05:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,135 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 03:05:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,135 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 03:05:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:05:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,136 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 03:05:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,136 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 03:05:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 03:05:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,137 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 03:05:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,138 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 03:05:59,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 03:05:59,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,139 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 03:05:59,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,140 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 03:05:59,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 03:05:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,141 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 03:05:59,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,142 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 03:05:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 03:05:59,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,143 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 03:05:59,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,143 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 03:05:59,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 03:05:59,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,144 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 03:05:59,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,145 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 03:05:59,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:05:59,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,146 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 03:05:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,147 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 03:05:59,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:05:59,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,148 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 03:05:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,149 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 03:05:59,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:05:59,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,150 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 03:05:59,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,151 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 03:05:59,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:05:59,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,152 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 03:05:59,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,152 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 03:05:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:05:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,153 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 03:05:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,153 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 03:05:59,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 03:05:59,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,154 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 03:05:59,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,155 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 03:05:59,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:05:59,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,156 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 03:05:59,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,157 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 03:05:59,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:05:59,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,158 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 03:05:59,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,159 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 03:05:59,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 03:05:59,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,160 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 03:05:59,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,160 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 03:05:59,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 03:05:59,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,161 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 03:05:59,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,162 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 03:05:59,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 03:05:59,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,163 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 03:05:59,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,164 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 03:05:59,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 03:05:59,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,165 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 03:05:59,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,165 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 03:05:59,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:05:59,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,167 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 03:05:59,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,167 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 03:05:59,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:05:59,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,168 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 03:05:59,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,169 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:05:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-29 03:05:59,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:59,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,171 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:05:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:59,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 03:05:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:59,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:59,318 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,324 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,328 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,335 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,339 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,350 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,355 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,359 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,370 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 03:05:59,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {21539#unseeded} assume !(main_~x~0 > 46); {21539#unseeded} is VALID [2020-07-29 03:05:59,372 INFO L263 TraceCheckUtils]: 2: Hoare triple {21539#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {21539#unseeded} is VALID [2020-07-29 03:05:59,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:59,373 INFO L280 TraceCheckUtils]: 4: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:59,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:59,375 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 03:05:59,375 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 03:05:59,376 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 03:05:59,376 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 03:05:59,377 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 03:05:59,377 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 03:05:59,378 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 03:05:59,378 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 03:05:59,379 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 03:05:59,380 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 03:05:59,380 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 03:05:59,381 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 03:05:59,382 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 03:05:59,382 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 03:05:59,383 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 03:05:59,383 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 03:05:59,384 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 03:05:59,385 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 03:05:59,387 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 03:05:59,387 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 03:05:59,388 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 03:05:59,388 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 03:05:59,390 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 03:05:59,391 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 03:05:59,391 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 03:05:59,393 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 03:05:59,394 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 03:05:59,394 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 03:05:59,395 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 03:05:59,395 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 03:05:59,396 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 03:05:59,398 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 03:05:59,399 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 03:05:59,400 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 03:05:59,401 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 03:05:59,402 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 03:05:59,403 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 03:05:59,404 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 03:05:59,404 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 03:05:59,405 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 03:05:59,406 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 03:05:59,407 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 03:05:59,407 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 03:05:59,408 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 03:05:59,410 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 03:05:59,411 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 03:05:59,412 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 03:05:59,412 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 03:05:59,413 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 03:05:59,417 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 03:05:59,418 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 03:05:59,418 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 03:05:59,420 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 03:05:59,421 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 03:05:59,421 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 03:05:59,422 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 03:05:59,423 INFO L263 TraceCheckUtils]: 62: Hoare triple {21539#unseeded} call #t~ret1 := fibonacci(~n - 2); {21539#unseeded} is VALID [2020-07-29 03:05:59,424 INFO L280 TraceCheckUtils]: 63: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:59,425 INFO L280 TraceCheckUtils]: 64: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:59,425 INFO L280 TraceCheckUtils]: 65: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:59,426 INFO L263 TraceCheckUtils]: 66: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 03:05:59,427 INFO L280 TraceCheckUtils]: 67: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:59,427 INFO L280 TraceCheckUtils]: 68: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:59,428 INFO L280 TraceCheckUtils]: 69: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:59,429 INFO L263 TraceCheckUtils]: 70: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 03:05:59,429 INFO L280 TraceCheckUtils]: 71: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:05:59,430 INFO L280 TraceCheckUtils]: 72: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:05:59,430 INFO L280 TraceCheckUtils]: 73: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:05:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:59,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:59,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:59,553 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 03:05:59,554 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 03:05:59,555 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 03:05:59,556 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 03:05:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:59,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:05:59,586 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 03:05:59,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:59,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,587 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 03:05:59,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138 Second operand 6 states. [2020-07-29 03:05:59,764 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 03:05:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:59,764 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:59,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 03:05:59,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:59,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:59,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:05:59,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:59,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:59,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:59,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 441 transitions. [2020-07-29 03:05:59,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:05:59,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:59,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:59,771 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 03:05:59,771 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:05:59,771 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:05:59,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:59,772 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:59,772 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 306 states and 441 transitions. cyclomatic complexity: 139 [2020-07-29 03:05:59,778 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:05:59,778 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 03:05:59,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:59,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,779 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 03:05:59,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,780 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 03:05:59,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:59,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,780 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 03:05:59,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,781 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 03:05:59,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 78 letters. Loop has 4 letters. [2020-07-29 03:05:59,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,782 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 03:05:59,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,782 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 03:05:59,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 306 letters. Loop has 306 letters. [2020-07-29 03:05:59,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,783 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 03:05:59,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,783 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 03:05:59,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 291 letters. Loop has 291 letters. [2020-07-29 03:05:59,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,784 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 03:05:59,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,784 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 03:05:59,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 03:05:59,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,785 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 03:05:59,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,785 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 03:05:59,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 03:05:59,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,787 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 03:05:59,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,787 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 03:05:59,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 03:05:59,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,788 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 03:05:59,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,789 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 03:05:59,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 03:05:59,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,790 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 03:05:59,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,791 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 03:05:59,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 03:05:59,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,792 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 03:05:59,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,792 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 03:05:59,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 03:05:59,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,794 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 03:05:59,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,794 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 03:05:59,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:05:59,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,795 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 03:05:59,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,796 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 03:05:59,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:05:59,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,797 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 03:05:59,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,798 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 03:05:59,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:05:59,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,799 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 03:05:59,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,799 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 03:05:59,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:05:59,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,800 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 03:05:59,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,801 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 03:05:59,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:59,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,802 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 03:05:59,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,802 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 03:05:59,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 03:05:59,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,803 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 03:05:59,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,804 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 03:05:59,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 03:05:59,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,805 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 03:05:59,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,806 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 03:05:59,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 132 letters. Loop has 64 letters. [2020-07-29 03:05:59,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 132 letters. Loop has 64 letters. [2020-07-29 03:05:59,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,807 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 03:05:59,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 133 letters. Loop has 64 letters. [2020-07-29 03:05:59,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 133 letters. Loop has 64 letters. [2020-07-29 03:05:59,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,809 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 03:05:59,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 64 letters. [2020-07-29 03:05:59,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 134 letters. Loop has 64 letters. [2020-07-29 03:05:59,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,811 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 03:05:59,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 135 letters. Loop has 64 letters. [2020-07-29 03:05:59,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,812 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 03:05:59,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,813 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 03:05:59,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 194 letters. Loop has 64 letters. [2020-07-29 03:05:59,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 194 letters. Loop has 64 letters. [2020-07-29 03:05:59,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,815 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 03:05:59,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 194 letters. Loop has 64 letters. [2020-07-29 03:05:59,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 306 states and 441 transitions. cyclomatic complexity: 139 Stem has 194 letters. Loop has 64 letters. [2020-07-29 03:05:59,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,817 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 03:05:59,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 03:05:59,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,818 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 03:05:59,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,819 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:05:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-07-29 03:05:59,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:05:59,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:59,821 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:05:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:59,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 03:05:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:59,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:59,981 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,988 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:05:59,992 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:00,003 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:00,007 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:00,017 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:00,023 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:00,028 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:06:00,038 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 03:06:00,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {21539#unseeded} assume !(main_~x~0 > 46); {21539#unseeded} is VALID [2020-07-29 03:06:00,040 INFO L263 TraceCheckUtils]: 2: Hoare triple {21539#unseeded} call main_#t~ret3 := fibonacci(main_~x~0); {21539#unseeded} is VALID [2020-07-29 03:06:00,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:06:00,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:06:00,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:06:00,044 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 03:06:00,044 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 03:06:00,045 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 03:06:00,045 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 03:06:00,046 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 03:06:00,047 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 03:06:00,048 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 03:06:00,048 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 03:06:00,049 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 03:06:00,050 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 03:06:00,050 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 03:06:00,051 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 03:06:00,052 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 03:06:00,052 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 03:06:00,053 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 03:06:00,054 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 03:06:00,054 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 03:06:00,056 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 03:06:00,057 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 03:06:00,058 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 03:06:00,058 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 03:06:00,059 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 03:06:00,061 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 03:06:00,061 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 03:06:00,062 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 03:06:00,064 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 03:06:00,066 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 03:06:00,066 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 03:06:00,067 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 03:06:00,068 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 03:06:00,068 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 03:06:00,070 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 03:06:00,071 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 03:06:00,072 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 03:06:00,074 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 03:06:00,075 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 03:06:00,076 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 03:06:00,076 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 03:06:00,077 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 03:06:00,078 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 03:06:00,079 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 03:06:00,079 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 03:06:00,080 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 03:06:00,080 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 03:06:00,082 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 03:06:00,084 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 03:06:00,084 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 03:06:00,085 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 03:06:00,085 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 03:06:00,087 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 03:06:00,088 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 03:06:00,088 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 03:06:00,090 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 03:06:00,090 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 03:06:00,091 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 03:06:00,092 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 03:06:00,093 INFO L263 TraceCheckUtils]: 62: Hoare triple {21539#unseeded} call #t~ret1 := fibonacci(~n - 2); {21539#unseeded} is VALID [2020-07-29 03:06:00,094 INFO L280 TraceCheckUtils]: 63: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:06:00,094 INFO L280 TraceCheckUtils]: 64: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:06:00,094 INFO L280 TraceCheckUtils]: 65: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:06:00,095 INFO L263 TraceCheckUtils]: 66: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 03:06:00,096 INFO L280 TraceCheckUtils]: 67: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:06:00,096 INFO L280 TraceCheckUtils]: 68: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:06:00,097 INFO L280 TraceCheckUtils]: 69: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:06:00,097 INFO L263 TraceCheckUtils]: 70: Hoare triple {21539#unseeded} call #t~ret0 := fibonacci(~n - 1); {21539#unseeded} is VALID [2020-07-29 03:06:00,098 INFO L280 TraceCheckUtils]: 71: Hoare triple {21539#unseeded} ~n := #in~n; {21539#unseeded} is VALID [2020-07-29 03:06:00,098 INFO L280 TraceCheckUtils]: 72: Hoare triple {21539#unseeded} assume !(~n < 1); {21539#unseeded} is VALID [2020-07-29 03:06:00,099 INFO L280 TraceCheckUtils]: 73: Hoare triple {21539#unseeded} assume !(1 == ~n); {21539#unseeded} is VALID [2020-07-29 03:06:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:00,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:06:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:06:00,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:06:00,247 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 03:06:00,247 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 03:06:00,248 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 03:06:00,249 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 03:06:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:06:00,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:06:00,287 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 03:06:00,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:06:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,288 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 03:06:00,288 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 425 transitions. cyclomatic complexity: 138 Second operand 6 states. [2020-07-29 03:06:00,453 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 03:06:00,454 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 03:06:00,454 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:00,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 03:06:00,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:00,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:00,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:06:00,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:06:00,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:00,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:00,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 353 states and 503 transitions. [2020-07-29 03:06:00,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:06:00,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:06:00,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:06:00,462 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 291 states and 425 transitions. cyclomatic complexity: 138 [2020-07-29 03:06:00,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:06:00,462 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:06:00,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:06:00,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:06:00,464 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 353 states and 503 transitions. cyclomatic complexity: 154 [2020-07-29 03:06:00,471 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:06:00,471 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 03:06:00,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:06:00,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,472 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 03:06:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,473 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 03:06:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:06:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,474 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 03:06:00,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,474 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 03:06:00,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 78 letters. Loop has 4 letters. [2020-07-29 03:06:00,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,475 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 03:06:00,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,476 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 03:06:00,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 353 letters. Loop has 353 letters. [2020-07-29 03:06:00,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,476 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 03:06:00,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,477 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 03:06:00,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 291 letters. Loop has 291 letters. [2020-07-29 03:06:00,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,478 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 03:06:00,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,478 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 03:06:00,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:06:00,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,479 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 03:06:00,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,479 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 03:06:00,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 131 letters. Loop has 64 letters. [2020-07-29 03:06:00,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,481 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 03:06:00,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,482 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 03:06:00,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 129 letters. Loop has 64 letters. [2020-07-29 03:06:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,484 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 03:06:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,485 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 03:06:00,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 64 letters. [2020-07-29 03:06:00,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,486 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 03:06:00,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,487 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 03:06:00,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 128 letters. Loop has 64 letters. [2020-07-29 03:06:00,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,489 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 03:06:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,490 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 03:06:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 127 letters. Loop has 64 letters. [2020-07-29 03:06:00,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,492 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 03:06:00,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,493 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 03:06:00,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:06:00,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,495 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 03:06:00,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,496 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 03:06:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:06:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,498 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 03:06:00,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,499 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 03:06:00,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 130 letters. Loop has 68 letters. [2020-07-29 03:06:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,501 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 03:06:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,502 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 03:06:00,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 190 letters. Loop has 64 letters. [2020-07-29 03:06:00,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,504 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 03:06:00,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,505 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 03:06:00,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:06:00,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,505 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 03:06:00,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,506 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 03:06:00,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 03:06:00,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,508 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 03:06:00,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,509 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 03:06:00,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 135 letters. Loop has 64 letters. [2020-07-29 03:06:00,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 135 letters. Loop has 64 letters. [2020-07-29 03:06:00,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,512 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 03:06:00,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 136 letters. Loop has 64 letters. [2020-07-29 03:06:00,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 136 letters. Loop has 64 letters. [2020-07-29 03:06:00,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,515 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 03:06:00,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 137 letters. Loop has 64 letters. [2020-07-29 03:06:00,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 137 letters. Loop has 64 letters. [2020-07-29 03:06:00,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,518 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 03:06:00,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 138 letters. Loop has 64 letters. [2020-07-29 03:06:00,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 138 letters. Loop has 64 letters. [2020-07-29 03:06:00,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,521 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 03:06:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 198 letters. Loop has 64 letters. [2020-07-29 03:06:00,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 198 letters. Loop has 64 letters. [2020-07-29 03:06:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,524 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 03:06:00,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 134 letters. Loop has 68 letters. [2020-07-29 03:06:00,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,527 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 03:06:00,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,527 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 03:06:00,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 198 letters. Loop has 64 letters. [2020-07-29 03:06:00,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 353 states and 503 transitions. cyclomatic complexity: 154 Stem has 198 letters. Loop has 64 letters. [2020-07-29 03:06:00,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,531 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:06:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:06:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-29 03:06:00,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 74 letters. Loop has 4 letters. [2020-07-29 03:06:00,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 78 letters. Loop has 4 letters. [2020-07-29 03:06:00,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 74 letters. Loop has 8 letters. [2020-07-29 03:06:00,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:06:00,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 503 transitions. cyclomatic complexity: 154 [2020-07-29 03:06:00,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:06:00,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 291 states and 425 transitions. [2020-07-29 03:06:00,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2020-07-29 03:06:00,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2020-07-29 03:06:00,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 425 transitions. [2020-07-29 03:06:00,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:06:00,618 INFO L688 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 03:06:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 425 transitions. [2020-07-29 03:06:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-07-29 03:06:00,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:06:00,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states and 425 transitions. Second operand 291 states. [2020-07-29 03:06:00,634 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states and 425 transitions. Second operand 291 states. [2020-07-29 03:06:00,634 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 291 states. [2020-07-29 03:06:00,635 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:00,760 INFO L93 Difference]: Finished difference Result 1272 states and 1776 transitions. [2020-07-29 03:06:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1776 transitions. [2020-07-29 03:06:00,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:00,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:00,770 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 291 states and 425 transitions. [2020-07-29 03:06:00,771 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 291 states and 425 transitions. [2020-07-29 03:06:00,771 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:06:00,976 INFO L93 Difference]: Finished difference Result 1272 states and 1776 transitions. [2020-07-29 03:06:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1776 transitions. [2020-07-29 03:06:00,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:06:00,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:06:00,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:06:00,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:06:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-07-29 03:06:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-07-29 03:06:01,009 INFO L711 BuchiCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-07-29 03:06:01,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:06:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:06:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:06:01,018 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 14 states. [2020-07-29 03:06:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:06:02,016 INFO L93 Difference]: Finished difference Result 416 states and 612 transitions. [2020-07-29 03:06:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-29 03:06:02,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:06:02,097 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 03:06:02,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 612 transitions. [2020-07-29 03:06:02,122 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:02,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 0 states and 0 transitions. [2020-07-29 03:06:02,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:06:02,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:06:02,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:06:02,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:06:02,124 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:02,124 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:02,124 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:06:02,124 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:06:02,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:06:02,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:06:02,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:06:02,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:06:02 BoogieIcfgContainer [2020-07-29 03:06:02,132 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:06:02,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:06:02,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:06:02,133 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:06:02,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:26" (3/4) ... [2020-07-29 03:06:02,137 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:06:02,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:06:02,141 INFO L168 Benchmark]: Toolchain (without parser) took 36205.69 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 444.1 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -263.7 MB). Peak memory consumption was 180.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:02,141 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:06:02,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.87 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:02,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.53 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:06:02,145 INFO L168 Benchmark]: Boogie Preprocessor took 107.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:02,145 INFO L168 Benchmark]: RCFGBuilder took 399.81 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:02,146 INFO L168 Benchmark]: BuchiAutomizer took 35347.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.4 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:06:02,146 INFO L168 Benchmark]: Witness Printer took 5.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:06:02,150 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.53 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.87 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.53 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.81 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35347.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.4 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 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 35.2s and 7 iterations. TraceHistogramMax:13. Analysis of lassos took 18.7s. Construction of modules took 2.6s. Büchi inclusion checks took 11.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 1.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 248 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s 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.6s 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: 23ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...