./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14cfbc3a2ba2bfe3a03d4d1ebff24b0baf1851f06dbbd2468b59e09322e4ce16 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:31,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:31,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:31,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:31,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:31,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:31,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:31,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:31,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:31,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:31,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:31,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:31,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:31,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:31,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:31,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:31,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:31,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:31,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:31,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:31,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:31,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:31,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:31,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:31,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:31,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:31,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:31,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:31,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:31,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:31,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:31,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:31,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:31,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:31,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:31,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:31,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:31,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:31,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:31,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:31,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:31,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:25:31,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:31,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:31,509 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:31,509 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:31,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:31,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:31,510 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:31,510 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:31,510 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:31,510 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:31,511 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:31,511 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:31,511 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:31,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:31,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:31,513 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:31,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:31,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:31,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:31,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:31,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:31,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:31,515 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:31,515 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14cfbc3a2ba2bfe3a03d4d1ebff24b0baf1851f06dbbd2468b59e09322e4ce16 [2022-02-21 03:25:31,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:31,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:31,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:31,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:31,731 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:31,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2022-02-21 03:25:31,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099895396/ae53b56f7fcf4e80814464cb89c43722/FLAG9fdd6a914 [2022-02-21 03:25:32,141 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:32,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2022-02-21 03:25:32,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099895396/ae53b56f7fcf4e80814464cb89c43722/FLAG9fdd6a914 [2022-02-21 03:25:32,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099895396/ae53b56f7fcf4e80814464cb89c43722 [2022-02-21 03:25:32,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:32,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:32,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:32,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:32,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:32,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc7c6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32, skipping insertion in model container [2022-02-21 03:25:32,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:32,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:32,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c[761,774] [2022-02-21 03:25:32,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:32,746 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:32,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c[761,774] [2022-02-21 03:25:32,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:32,766 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:32,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32 WrapperNode [2022-02-21 03:25:32,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:32,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:32,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:32,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:32,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,797 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-02-21 03:25:32,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:32,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:32,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:32,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:32,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:32,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:32,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:32,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:32,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (1/1) ... [2022-02-21 03:25:32,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:32,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:32,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:25:32,879 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-02-21 03:25:32,879 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-02-21 03:25:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:25:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:32,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:25:32,922 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:32,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:33,052 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:33,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:33,059 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:25:33,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:33 BoogieIcfgContainer [2022-02-21 03:25:33,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:33,061 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:33,061 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:33,063 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:33,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:33,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:32" (1/3) ... [2022-02-21 03:25:33,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d64f571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:33, skipping insertion in model container [2022-02-21 03:25:33,065 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:33,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:32" (2/3) ... [2022-02-21 03:25:33,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d64f571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:33, skipping insertion in model container [2022-02-21 03:25:33,066 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:33,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:33" (3/3) ... [2022-02-21 03:25:33,067 INFO L388 chiAutomizerObserver]: Analyzing ICFG Fibonacci01-2.c [2022-02-21 03:25:33,126 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:33,126 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:33,126 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:33,126 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:33,126 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:33,126 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:33,127 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:33,127 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:33,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:33,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:33,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:33,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:33,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:25:33,169 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:33,169 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:33,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:33,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:33,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:33,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:33,176 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:25:33,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:33,181 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 10#L29true assume !(main_~x~0#1 < 1); 12#L31true call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 5#fibonacciENTRYtrue [2022-02-21 03:25:33,181 INFO L793 eck$LassoCheckResult]: Loop: 5#fibonacciENTRYtrue ~n := #in~n; 6#L17true assume !(~n < 1); 18#L19true assume !(1 == ~n); 16#L22true call #t~ret4 := fibonacci(~n - 1);< 5#fibonacciENTRYtrue [2022-02-21 03:25:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1325876, now seen corresponding path program 1 times [2022-02-21 03:25:33,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:33,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134975051] [2022-02-21 03:25:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,269 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,302 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 927646, now seen corresponding path program 1 times [2022-02-21 03:25:33,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:33,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466748091] [2022-02-21 03:25:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,333 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash 408654161, now seen corresponding path program 1 times [2022-02-21 03:25:33,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:33,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915304492] [2022-02-21 03:25:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:33,366 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:33,545 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:33,546 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:33,546 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:33,546 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:33,546 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:33,547 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,547 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:33,547 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:33,547 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2022-02-21 03:25:33,548 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:33,548 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:33,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,684 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:33,685 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:33,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:33,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:33,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:25:33,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:33,734 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:33,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:25:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:33,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:25:33,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:33,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:33,786 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:33,787 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:33,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:25:33,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:33,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:25:33,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:33,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:33,843 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:33,844 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:33,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:33,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:33,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:25:33,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:33,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:33,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:33,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:33,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:25:33,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:33,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:33,979 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:33,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:33,983 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:33,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:33,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:33,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:33,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:33,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:33,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:33,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:33,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2022-02-21 03:25:33,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:33,983 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:33,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:33,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:34,089 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:34,092 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:34,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:34,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:34,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:25:34,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:34,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:34,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:34,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:34,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:34,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:34,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:34,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:34,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:34,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:34,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:34,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:34,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:34,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:25:34,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:34,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:34,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:34,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:34,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:34,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:34,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:34,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:34,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:34,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:34,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:34,168 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:34,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:25:34,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:34,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:34,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:34,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:34,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:34,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:34,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:34,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:34,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:34,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:25:34,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:34,197 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:34,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:25:34,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:34,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:34,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:34,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:34,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:34,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:34,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:34,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:34,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:34,219 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:34,219 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:34,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:34,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:34,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:34,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:25:34,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:34,227 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:34,227 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:34,227 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2022-02-21 03:25:34,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:34,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:34,255 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< [2022-02-21 03:25:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:34,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {28#unseeded} is VALID [2022-02-21 03:25:34,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {28#unseeded} is VALID [2022-02-21 03:25:34,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~x~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:25:34,320 INFO L272 TraceCheckUtils]: 3: Hoare triple {28#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {28#unseeded} is VALID [2022-02-21 03:25:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:25:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:34,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {55#(<= fibonacci_~n oldRank0)} is VALID [2022-02-21 03:25:34,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {59#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:34,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {59#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} assume !(1 == ~n); {59#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:34,391 INFO L272 TraceCheckUtils]: 3: Hoare triple {59#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} call #t~ret4 := fibonacci(~n - 1); {41#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)))} is VALID [2022-02-21 03:25:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:34,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:34,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:34,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,424 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 [2022-02-21 03:25:34,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:34,591 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 63 transitions. Complement of second has 12 states. [2022-02-21 03:25:34,592 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 [2022-02-21 03:25:34,592 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:34,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:34,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:34,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:34,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:34,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:34,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:34,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:34,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:34,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2022-02-21 03:25:34,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:34,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:34,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:34,611 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:25:34,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:34,621 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:34,621 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:34,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:34,622 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:34,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 63 transitions. cyclomatic complexity: 14 [2022-02-21 03:25:34,624 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:34,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:34,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:34,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:34,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:25:34,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:25:34,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:25:34,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:25:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:25:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:25:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:34,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:34,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:34,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:25:34,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:25:34,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:25:34,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:34,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:34,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:25:34,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:25:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:34,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:34,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:34,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:34,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:34,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:34,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:34,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:34,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:34,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:34,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:25:34,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:25:34,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,672 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:34,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 03:25:34,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:34,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:25:34,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2022-02-21 03:25:34,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:34,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. cyclomatic complexity: 14 [2022-02-21 03:25:34,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:34,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 26 states and 35 transitions. [2022-02-21 03:25:34,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:25:34,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:25:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2022-02-21 03:25:34,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:34,690 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-21 03:25:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2022-02-21 03:25:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-02-21 03:25:34,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:34,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 35 transitions. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:25:34,712 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 35 transitions. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:25:34,713 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:25:34,715 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:34,729 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-02-21 03:25:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2022-02-21 03:25:34,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:34,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:34,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Second operand 26 states and 35 transitions. [2022-02-21 03:25:34,733 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Second operand 26 states and 35 transitions. [2022-02-21 03:25:34,734 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:34,742 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-02-21 03:25:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-02-21 03:25:34,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:34,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:34,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:34,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:25:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-21 03:25:34,748 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:25:34,748 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:25:34,749 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:34,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:25:34,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:34,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:34,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:34,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:34,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:34,751 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 149#L29 assume !(main_~x~0#1 < 1); 137#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 145#fibonacciENTRY ~n := #in~n; 142#L17 assume !(~n < 1); 143#L19 assume !(1 == ~n); 135#L22 call #t~ret4 := fibonacci(~n - 1);< 144#fibonacciENTRY ~n := #in~n; 139#L17 assume ~n < 1;#res := 0; 140#fibonacciFINAL assume true; 148#fibonacciEXIT >#34#return; 134#L22-1 [2022-02-21 03:25:34,752 INFO L793 eck$LassoCheckResult]: Loop: 134#L22-1 call #t~ret5 := fibonacci(~n - 2);< 138#fibonacciENTRY ~n := #in~n; 154#L17 assume !(~n < 1); 153#L19 assume !(1 == ~n); 136#L22 call #t~ret4 := fibonacci(~n - 1);< 138#fibonacciENTRY ~n := #in~n; 154#L17 assume ~n < 1;#res := 0; 151#fibonacciFINAL assume true; 152#fibonacciEXIT >#34#return; 134#L22-1 [2022-02-21 03:25:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1923124650, now seen corresponding path program 1 times [2022-02-21 03:25:34,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:34,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169195608] [2022-02-21 03:25:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:25:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#true} ~n := #in~n; {376#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:34,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {377#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= |fibonacci_#in~n| 0)} assume true; {377#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= |fibonacci_#in~n| 0)} {371#(not (<= fibonacci_~n 1))} #34#return; {369#false} is VALID [2022-02-21 03:25:34,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-02-21 03:25:34,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {368#true} is VALID [2022-02-21 03:25:34,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume !(main_~x~0#1 < 1); {368#true} is VALID [2022-02-21 03:25:34,835 INFO L272 TraceCheckUtils]: 3: Hoare triple {368#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {368#true} is VALID [2022-02-21 03:25:34,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {368#true} ~n := #in~n; {368#true} is VALID [2022-02-21 03:25:34,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} assume !(~n < 1); {370#(< 0 fibonacci_~n)} is VALID [2022-02-21 03:25:34,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#(< 0 fibonacci_~n)} assume !(1 == ~n); {371#(not (<= fibonacci_~n 1))} is VALID [2022-02-21 03:25:34,836 INFO L272 TraceCheckUtils]: 7: Hoare triple {371#(not (<= fibonacci_~n 1))} call #t~ret4 := fibonacci(~n - 1); {368#true} is VALID [2022-02-21 03:25:34,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~n := #in~n; {376#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:34,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {377#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {377#(<= |fibonacci_#in~n| 0)} assume true; {377#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,838 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {377#(<= |fibonacci_#in~n| 0)} {371#(not (<= fibonacci_~n 1))} #34#return; {369#false} is VALID [2022-02-21 03:25:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:25:34,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:34,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169195608] [2022-02-21 03:25:34,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169195608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:34,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:34,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:25:34,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860873535] [2022-02-21 03:25:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:34,842 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 481649848, now seen corresponding path program 1 times [2022-02-21 03:25:34,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:34,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414507599] [2022-02-21 03:25:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 03:25:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:34,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} ~n := #in~n; {386#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:34,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {387#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {387#(<= |fibonacci_#in~n| 0)} assume true; {387#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {387#(<= |fibonacci_#in~n| 0)} {381#(not (<= fibonacci_~n 1))} #34#return; {379#false} is VALID [2022-02-21 03:25:34,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call #t~ret5 := fibonacci(~n - 2); {378#true} is VALID [2022-02-21 03:25:34,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} ~n := #in~n; {378#true} is VALID [2022-02-21 03:25:34,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume !(~n < 1); {380#(< 0 fibonacci_~n)} is VALID [2022-02-21 03:25:34,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {380#(< 0 fibonacci_~n)} assume !(1 == ~n); {381#(not (<= fibonacci_~n 1))} is VALID [2022-02-21 03:25:34,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {381#(not (<= fibonacci_~n 1))} call #t~ret4 := fibonacci(~n - 1); {378#true} is VALID [2022-02-21 03:25:34,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} ~n := #in~n; {386#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:34,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {387#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(<= |fibonacci_#in~n| 0)} assume true; {387#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:34,889 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {387#(<= |fibonacci_#in~n| 0)} {381#(not (<= fibonacci_~n 1))} #34#return; {379#false} is VALID [2022-02-21 03:25:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:25:34,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:34,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414507599] [2022-02-21 03:25:34,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414507599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:34,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:34,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:25:34,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748616388] [2022-02-21 03:25:34,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:34,890 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:34,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:34,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:25:34,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:25:34,893 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:25:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:35,005 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-21 03:25:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:25:35,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:25:35,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:35,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2022-02-21 03:25:35,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:35,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 31 transitions. [2022-02-21 03:25:35,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 03:25:35,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 03:25:35,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2022-02-21 03:25:35,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:35,016 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 03:25:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2022-02-21 03:25:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 03:25:35,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:35,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 31 transitions. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:25:35,018 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 31 transitions. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:25:35,018 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:25:35,018 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:35,021 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2022-02-21 03:25:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-02-21 03:25:35,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:35,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:35,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Second operand 25 states and 31 transitions. [2022-02-21 03:25:35,023 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Second operand 25 states and 31 transitions. [2022-02-21 03:25:35,023 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:35,026 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2022-02-21 03:25:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-02-21 03:25:35,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:35,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:35,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:35,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:25:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-21 03:25:35,028 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 03:25:35,028 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 03:25:35,028 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:35,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-02-21 03:25:35,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:35,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:35,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:35,029 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:35,029 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:35,029 INFO L791 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 437#L29 assume !(main_~x~0#1 < 1); 423#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 439#fibonacciENTRY ~n := #in~n; 429#L17 assume !(~n < 1); 432#L19 assume !(1 == ~n); 424#L22 call #t~ret4 := fibonacci(~n - 1);< 427#fibonacciENTRY ~n := #in~n; 428#L17 assume !(~n < 1); 445#L19 assume 1 == ~n;#res := 1; 444#fibonacciFINAL assume true; 443#fibonacciEXIT >#34#return; 421#L22-1 [2022-02-21 03:25:35,029 INFO L793 eck$LassoCheckResult]: Loop: 421#L22-1 call #t~ret5 := fibonacci(~n - 2);< 425#fibonacciENTRY ~n := #in~n; 426#L17 assume !(~n < 1); 431#L19 assume !(1 == ~n); 422#L22 call #t~ret4 := fibonacci(~n - 1);< 425#fibonacciENTRY ~n := #in~n; 426#L17 assume !(~n < 1); 431#L19 assume 1 == ~n;#res := 1; 440#fibonacciFINAL assume true; 441#fibonacciEXIT >#34#return; 421#L22-1 [2022-02-21 03:25:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -512653656, now seen corresponding path program 1 times [2022-02-21 03:25:35,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:35,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255675548] [2022-02-21 03:25:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:35,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:35,043 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2046267738, now seen corresponding path program 1 times [2022-02-21 03:25:35,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:35,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464510356] [2022-02-21 03:25:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:35,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:35,052 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:35,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -655740095, now seen corresponding path program 1 times [2022-02-21 03:25:35,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:35,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897199312] [2022-02-21 03:25:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:25:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#true} ~n := #in~n; {678#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:35,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {678#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:35,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {679#(<= |fibonacci_#in~n| 1)} assume true; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,115 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {679#(<= |fibonacci_#in~n| 1)} {663#true} #34#return; {670#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-21 03:25:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#true} ~n := #in~n; {663#true} is VALID [2022-02-21 03:25:35,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume !(~n < 1); {663#true} is VALID [2022-02-21 03:25:35,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume 1 == ~n;#res := 1; {663#true} is VALID [2022-02-21 03:25:35,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {663#true} assume true; {663#true} is VALID [2022-02-21 03:25:35,122 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {663#true} {664#false} #34#return; {664#false} is VALID [2022-02-21 03:25:35,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-02-21 03:25:35,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {663#true} is VALID [2022-02-21 03:25:35,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume !(main_~x~0#1 < 1); {663#true} is VALID [2022-02-21 03:25:35,123 INFO L272 TraceCheckUtils]: 3: Hoare triple {663#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {663#true} is VALID [2022-02-21 03:25:35,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {663#true} ~n := #in~n; {663#true} is VALID [2022-02-21 03:25:35,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} assume !(~n < 1); {663#true} is VALID [2022-02-21 03:25:35,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !(1 == ~n); {663#true} is VALID [2022-02-21 03:25:35,139 INFO L272 TraceCheckUtils]: 7: Hoare triple {663#true} call #t~ret4 := fibonacci(~n - 1); {663#true} is VALID [2022-02-21 03:25:35,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#true} ~n := #in~n; {678#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:35,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {678#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:35,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(<= |fibonacci_#in~n| 1)} assume true; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,142 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {679#(<= |fibonacci_#in~n| 1)} {663#true} #34#return; {670#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:35,143 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#(<= fibonacci_~n 2)} call #t~ret5 := fibonacci(~n - 2); {671#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:35,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {671#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {672#(<= fibonacci_~n 0)} is VALID [2022-02-21 03:25:35,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {672#(<= fibonacci_~n 0)} assume !(~n < 1); {664#false} is VALID [2022-02-21 03:25:35,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#false} assume !(1 == ~n); {664#false} is VALID [2022-02-21 03:25:35,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {664#false} call #t~ret4 := fibonacci(~n - 1); {663#true} is VALID [2022-02-21 03:25:35,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {663#true} ~n := #in~n; {663#true} is VALID [2022-02-21 03:25:35,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {663#true} assume !(~n < 1); {663#true} is VALID [2022-02-21 03:25:35,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#true} assume 1 == ~n;#res := 1; {663#true} is VALID [2022-02-21 03:25:35,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#true} assume true; {663#true} is VALID [2022-02-21 03:25:35,144 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {663#true} {664#false} #34#return; {664#false} is VALID [2022-02-21 03:25:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:25:35,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:35,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897199312] [2022-02-21 03:25:35,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897199312] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:35,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079631143] [2022-02-21 03:25:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:35,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:35,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:25:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:35,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:35,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-02-21 03:25:35,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {663#true} is VALID [2022-02-21 03:25:35,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume !(main_~x~0#1 < 1); {663#true} is VALID [2022-02-21 03:25:35,287 INFO L272 TraceCheckUtils]: 3: Hoare triple {663#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {663#true} is VALID [2022-02-21 03:25:35,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {663#true} ~n := #in~n; {663#true} is VALID [2022-02-21 03:25:35,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} assume !(~n < 1); {663#true} is VALID [2022-02-21 03:25:35,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !(1 == ~n); {663#true} is VALID [2022-02-21 03:25:35,288 INFO L272 TraceCheckUtils]: 7: Hoare triple {663#true} call #t~ret4 := fibonacci(~n - 1); {663#true} is VALID [2022-02-21 03:25:35,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#true} ~n := #in~n; {707#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:35,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {707#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:35,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(<= |fibonacci_#in~n| 1)} assume true; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,290 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {679#(<= |fibonacci_#in~n| 1)} {663#true} #34#return; {670#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:35,291 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#(<= fibonacci_~n 2)} call #t~ret5 := fibonacci(~n - 2); {671#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:35,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {671#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {672#(<= fibonacci_~n 0)} is VALID [2022-02-21 03:25:35,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {672#(<= fibonacci_~n 0)} assume !(~n < 1); {664#false} is VALID [2022-02-21 03:25:35,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#false} assume !(1 == ~n); {664#false} is VALID [2022-02-21 03:25:35,292 INFO L272 TraceCheckUtils]: 17: Hoare triple {664#false} call #t~ret4 := fibonacci(~n - 1); {664#false} is VALID [2022-02-21 03:25:35,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#false} ~n := #in~n; {664#false} is VALID [2022-02-21 03:25:35,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#false} assume !(~n < 1); {664#false} is VALID [2022-02-21 03:25:35,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#false} assume 1 == ~n;#res := 1; {664#false} is VALID [2022-02-21 03:25:35,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#false} assume true; {664#false} is VALID [2022-02-21 03:25:35,293 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {664#false} {664#false} #34#return; {664#false} is VALID [2022-02-21 03:25:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:25:35,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:35,467 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {663#true} {664#false} #34#return; {664#false} is VALID [2022-02-21 03:25:35,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#true} assume true; {663#true} is VALID [2022-02-21 03:25:35,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#true} assume 1 == ~n;#res := 1; {663#true} is VALID [2022-02-21 03:25:35,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {663#true} assume !(~n < 1); {663#true} is VALID [2022-02-21 03:25:35,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {663#true} ~n := #in~n; {663#true} is VALID [2022-02-21 03:25:35,467 INFO L272 TraceCheckUtils]: 17: Hoare triple {664#false} call #t~ret4 := fibonacci(~n - 1); {663#true} is VALID [2022-02-21 03:25:35,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#false} assume !(1 == ~n); {664#false} is VALID [2022-02-21 03:25:35,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {672#(<= fibonacci_~n 0)} assume !(~n < 1); {664#false} is VALID [2022-02-21 03:25:35,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {671#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {672#(<= fibonacci_~n 0)} is VALID [2022-02-21 03:25:35,469 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#(<= fibonacci_~n 2)} call #t~ret5 := fibonacci(~n - 2); {671#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:35,471 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {679#(<= |fibonacci_#in~n| 1)} {663#true} #34#return; {670#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:35,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(<= |fibonacci_#in~n| 1)} assume true; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {789#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {679#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:35,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {789#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#true} ~n := #in~n; {789#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:35,474 INFO L272 TraceCheckUtils]: 7: Hoare triple {663#true} call #t~ret4 := fibonacci(~n - 1); {663#true} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {663#true} assume !(1 == ~n); {663#true} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} assume !(~n < 1); {663#true} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {663#true} ~n := #in~n; {663#true} is VALID [2022-02-21 03:25:35,474 INFO L272 TraceCheckUtils]: 3: Hoare triple {663#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {663#true} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} assume !(main_~x~0#1 < 1); {663#true} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {663#true} is VALID [2022-02-21 03:25:35,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {663#true} is VALID [2022-02-21 03:25:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:25:35,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079631143] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:35,475 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:35,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-02-21 03:25:35,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667352715] [2022-02-21 03:25:35,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:35,606 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:35,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:35,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:35,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:35,607 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:35,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:35,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:35,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2022-02-21 03:25:35,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:35,607 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:35,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:35,683 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:35,683 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:35,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,684 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:25:35,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:35,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:35,708 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:35,708 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:35,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:25:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,727 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:25:35,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:35,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:35,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:35,764 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret4=1} Honda state: {fibonacci_#t~ret4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:35,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:35,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,782 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:25:35,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:35,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:35,805 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:35,805 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:35,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:35,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,855 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:35,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:35,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:25:35,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:35,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:35,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:35,897 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:35,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:25:35,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:35,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:36,262 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:36,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:36,268 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:36,268 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:36,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:36,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:36,268 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:36,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:36,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:36,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:36,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2022-02-21 03:25:36,268 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:36,268 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:36,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:36,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:36,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:36,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:36,349 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:36,350 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:36,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:36,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:36,351 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:36,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:36,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:25:36,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:36,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:36,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:36,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:36,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:36,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:36,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:36,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:36,409 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:25:36,409 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:36,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:36,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:36,411 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:36,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:25:36,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:36,413 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:36,413 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:36,413 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-02-21 03:25:36,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:36,435 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:36,439 INFO L390 LassoCheck]: Loop: "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#34#return;" [2022-02-21 03:25:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:36,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {814#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {814#unseeded} is VALID [2022-02-21 03:25:36,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {814#unseeded} is VALID [2022-02-21 03:25:36,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {814#unseeded} assume !(main_~x~0#1 < 1); {814#unseeded} is VALID [2022-02-21 03:25:36,585 INFO L272 TraceCheckUtils]: 3: Hoare triple {814#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {814#unseeded} is VALID [2022-02-21 03:25:36,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {814#unseeded} ~n := #in~n; {814#unseeded} is VALID [2022-02-21 03:25:36,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#unseeded} assume !(~n < 1); {814#unseeded} is VALID [2022-02-21 03:25:36,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {814#unseeded} assume !(1 == ~n); {814#unseeded} is VALID [2022-02-21 03:25:36,587 INFO L272 TraceCheckUtils]: 7: Hoare triple {814#unseeded} call #t~ret4 := fibonacci(~n - 1); {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:36,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:36,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:36,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:36,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:36,589 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {853#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {814#unseeded} #34#return; {814#unseeded} is VALID [2022-02-21 03:25:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:25:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:36,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:36,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:36,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {817#(>= oldRank0 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {869#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} is VALID [2022-02-21 03:25:36,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {869#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} ~n := #in~n; {873#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:36,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(~n < 1); {873#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:36,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {873#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(1 == ~n); {873#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:36,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= (+ 2 fibonacci_~n) oldRank0)} call #t~ret4 := fibonacci(~n - 1); {883#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:36,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {887#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:36,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {887#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {891#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:36,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {891#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {891#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:36,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {891#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {891#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:36,826 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {891#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {873#(<= (+ 2 fibonacci_~n) oldRank0)} #34#return; {827#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:36,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:25:36,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:36,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:36,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:36,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 03:25:36,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8 Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:25:37,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 136 states and 184 transitions. Complement of second has 36 states. [2022-02-21 03:25:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:37,199 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:37,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:37,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:25:37,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:37,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 184 transitions. [2022-02-21 03:25:37,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 03:25:37,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,210 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:37,211 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:25:37,212 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:25:37,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:37,213 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:37,213 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 184 transitions. cyclomatic complexity: 53 [2022-02-21 03:25:37,219 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:25:37,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:37,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:37,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:37,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:37,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:37,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:37,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 136 letters. Loop has 136 letters. [2022-02-21 03:25:37,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 136 letters. Loop has 136 letters. [2022-02-21 03:25:37,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 136 letters. Loop has 136 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:37,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:37,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:25:37,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:37,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:37,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:25:37,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:37,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:37,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:25:37,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:37,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:37,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:25:37,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 22 letters. [2022-02-21 03:25:37,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 22 letters. [2022-02-21 03:25:37,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 13 letters. Loop has 22 letters. [2022-02-21 03:25:37,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:37,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:37,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:37,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 35 letters. [2022-02-21 03:25:37,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 35 letters. [2022-02-21 03:25:37,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 26 letters. Loop has 35 letters. [2022-02-21 03:25:37,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:37,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:37,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:37,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:37,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:37,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:37,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:37,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:37,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:37,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:25:37,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:25:37,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:25:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 10 letters. [2022-02-21 03:25:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 10 letters. [2022-02-21 03:25:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 26 letters. Loop has 10 letters. [2022-02-21 03:25:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 72 letters. [2022-02-21 03:25:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 72 letters. [2022-02-21 03:25:37,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 26 letters. Loop has 72 letters. [2022-02-21 03:25:37,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:37,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:37,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 24 letters. Loop has 4 letters. [2022-02-21 03:25:37,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:37,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:37,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 22 letters. Loop has 4 letters. [2022-02-21 03:25:37,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:37,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:37,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 23 letters. Loop has 4 letters. [2022-02-21 03:25:37,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:37,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:37,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 25 letters. Loop has 4 letters. [2022-02-21 03:25:37,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 10 letters. [2022-02-21 03:25:37,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 10 letters. [2022-02-21 03:25:37,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 31 letters. Loop has 10 letters. [2022-02-21 03:25:37,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 10 letters. [2022-02-21 03:25:37,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 10 letters. [2022-02-21 03:25:37,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 31 letters. Loop has 10 letters. [2022-02-21 03:25:37,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 22 letters. [2022-02-21 03:25:37,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 22 letters. [2022-02-21 03:25:37,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 184 transitions. cyclomatic complexity: 53 Stem has 31 letters. Loop has 22 letters. [2022-02-21 03:25:37,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,244 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:25:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-02-21 03:25:37,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:25:37,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:25:37,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 13 letters. Loop has 20 letters. [2022-02-21 03:25:37,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:37,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 184 transitions. cyclomatic complexity: 53 [2022-02-21 03:25:37,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 03:25:37,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 109 states and 153 transitions. [2022-02-21 03:25:37,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-02-21 03:25:37,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2022-02-21 03:25:37,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 153 transitions. [2022-02-21 03:25:37,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:37,258 INFO L681 BuchiCegarLoop]: Abstraction has 109 states and 153 transitions. [2022-02-21 03:25:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 153 transitions. [2022-02-21 03:25:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2022-02-21 03:25:37,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:37,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states and 153 transitions. Second operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 21 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) [2022-02-21 03:25:37,265 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states and 153 transitions. Second operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 21 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) [2022-02-21 03:25:37,265 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 21 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) [2022-02-21 03:25:37,265 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:37,280 INFO L93 Difference]: Finished difference Result 264 states and 361 transitions. [2022-02-21 03:25:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 361 transitions. [2022-02-21 03:25:37,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:37,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:37,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 21 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) Second operand 109 states and 153 transitions. [2022-02-21 03:25:37,284 INFO L87 Difference]: Start difference. First operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 21 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) Second operand 109 states and 153 transitions. [2022-02-21 03:25:37,284 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:37,299 INFO L93 Difference]: Finished difference Result 277 states and 381 transitions. [2022-02-21 03:25:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 381 transitions. [2022-02-21 03:25:37,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:37,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:37,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:37,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 21 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) [2022-02-21 03:25:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2022-02-21 03:25:37,304 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 127 transitions. [2022-02-21 03:25:37,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:37,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:25:37,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:25:37,305 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:37,443 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:25:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:25:37,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:37,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:37,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-02-21 03:25:37,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:37,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 42 states and 54 transitions. [2022-02-21 03:25:37,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 03:25:37,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-02-21 03:25:37,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2022-02-21 03:25:37,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:37,475 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2022-02-21 03:25:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2022-02-21 03:25:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-02-21 03:25:37,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:37,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 54 transitions. Second operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 03:25:37,477 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 54 transitions. Second operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 03:25:37,477 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 03:25:37,477 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:37,481 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-02-21 03:25:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-02-21 03:25:37,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:37,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:37,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Second operand 42 states and 54 transitions. [2022-02-21 03:25:37,482 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Second operand 42 states and 54 transitions. [2022-02-21 03:25:37,482 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:37,499 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2022-02-21 03:25:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2022-02-21 03:25:37,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:37,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:37,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:37,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 03:25:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-02-21 03:25:37,502 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-21 03:25:37,502 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-21 03:25:37,502 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:37,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:25:37,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:37,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:37,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:37,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:25:37,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:25:37,503 INFO L791 eck$LassoCheckResult]: Stem: 2167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2171#L29 assume !(main_~x~0#1 < 1); 2157#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 2159#fibonacciENTRY ~n := #in~n; 2160#L17 assume !(~n < 1); 2166#L19 assume !(1 == ~n); 2156#L22 call #t~ret4 := fibonacci(~n - 1);< 2158#fibonacciENTRY ~n := #in~n; 2163#L17 assume !(~n < 1); 2189#L19 assume !(1 == ~n); 2161#L22 call #t~ret4 := fibonacci(~n - 1);< 2158#fibonacciENTRY ~n := #in~n; 2162#L17 assume !(~n < 1); 2173#L19 assume 1 == ~n;#res := 1; 2174#fibonacciFINAL assume true; 2188#fibonacciEXIT >#34#return; 2183#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2184#fibonacciENTRY ~n := #in~n; 2187#L17 assume ~n < 1;#res := 0; 2185#fibonacciFINAL assume true; 2182#fibonacciEXIT >#36#return; 2181#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2180#fibonacciFINAL assume true; 2179#fibonacciEXIT >#34#return; 2153#L22-1 [2022-02-21 03:25:37,503 INFO L793 eck$LassoCheckResult]: Loop: 2153#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2155#fibonacciENTRY ~n := #in~n; 2178#L17 assume !(~n < 1); 2176#L19 assume !(1 == ~n); 2152#L22 call #t~ret4 := fibonacci(~n - 1);< 2155#fibonacciENTRY ~n := #in~n; 2178#L17 assume !(~n < 1); 2176#L19 assume !(1 == ~n); 2152#L22 call #t~ret4 := fibonacci(~n - 1);< 2155#fibonacciENTRY ~n := #in~n; 2178#L17 assume !(~n < 1); 2176#L19 assume 1 == ~n;#res := 1; 2177#fibonacciFINAL assume true; 2186#fibonacciEXIT >#34#return; 2151#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2154#fibonacciENTRY ~n := #in~n; 2164#L17 assume ~n < 1;#res := 0; 2165#fibonacciFINAL assume true; 2169#fibonacciEXIT >#36#return; 2170#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2172#fibonacciFINAL assume true; 2175#fibonacciEXIT >#34#return; 2153#L22-1 [2022-02-21 03:25:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 506180814, now seen corresponding path program 1 times [2022-02-21 03:25:37,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:37,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567344537] [2022-02-21 03:25:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:37,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:37,538 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 319636608, now seen corresponding path program 1 times [2022-02-21 03:25:37,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:37,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093756614] [2022-02-21 03:25:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:37,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:37,555 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1200508531, now seen corresponding path program 2 times [2022-02-21 03:25:37,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:37,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756340668] [2022-02-21 03:25:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:25:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} ~n := #in~n; {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} assume true; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,673 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2588#(<= |fibonacci_#in~n| 1)} {2608#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2568#true} {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} ~n := #in~n; {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,690 INFO L272 TraceCheckUtils]: 3: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {2568#true} ~n := #in~n; {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} assume true; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,693 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2588#(<= |fibonacci_#in~n| 1)} {2608#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:37,693 INFO L272 TraceCheckUtils]: 9: Hoare triple {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:37,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,694 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2568#true} {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} assume true; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,695 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2619#(<= |fibonacci_#in~n| 2)} {2568#true} #34#return; {2587#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:37,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:25:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume 1 == ~n;#res := 1; {2568#true} is VALID [2022-02-21 03:25:37,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,707 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2568#true} {2568#true} #34#return; {2568#true} is VALID [2022-02-21 03:25:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2568#true} {2568#true} #36#return; {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume !(1 == ~n); {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L272 TraceCheckUtils]: 3: Hoare triple {2568#true} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2568#true} assume 1 == ~n;#res := 1; {2568#true} is VALID [2022-02-21 03:25:37,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,713 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2568#true} {2568#true} #34#return; {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L272 TraceCheckUtils]: 9: Hoare triple {2568#true} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2568#true} {2568#true} #36#return; {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {2568#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2568#true} is VALID [2022-02-21 03:25:37,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2568#true} {2569#false} #34#return; {2569#false} is VALID [2022-02-21 03:25:37,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume !(main_~x~0#1 < 1); {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L272 TraceCheckUtils]: 3: Hoare triple {2568#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {2568#true} assume !(1 == ~n); {2568#true} is VALID [2022-02-21 03:25:37,715 INFO L272 TraceCheckUtils]: 7: Hoare triple {2568#true} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {2568#true} ~n := #in~n; {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {2568#true} ~n := #in~n; {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2608#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {2608#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} assume true; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,719 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2588#(<= |fibonacci_#in~n| 1)} {2608#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:37,719 INFO L272 TraceCheckUtils]: 17: Hoare triple {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:37,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,720 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2568#true} {2614#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} assume true; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,721 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2619#(<= |fibonacci_#in~n| 2)} {2568#true} #34#return; {2587#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:37,721 INFO L272 TraceCheckUtils]: 25: Hoare triple {2587#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:37,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {2589#(<= fibonacci_~n 1)} assume !(~n < 1); {2590#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:37,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {2569#false} is VALID [2022-02-21 03:25:37,722 INFO L272 TraceCheckUtils]: 29: Hoare triple {2569#false} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#true} assume !(1 == ~n); {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L272 TraceCheckUtils]: 33: Hoare triple {2568#true} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {2568#true} assume 1 == ~n;#res := 1; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2568#true} {2568#true} #34#return; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L272 TraceCheckUtils]: 39: Hoare triple {2568#true} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,724 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2568#true} {2568#true} #36#return; {2568#true} is VALID [2022-02-21 03:25:37,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {2568#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2568#true} is VALID [2022-02-21 03:25:37,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,724 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2568#true} {2569#false} #34#return; {2569#false} is VALID [2022-02-21 03:25:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-02-21 03:25:37,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:37,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756340668] [2022-02-21 03:25:37,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756340668] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:37,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327600485] [2022-02-21 03:25:37,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:25:37,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:37,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:37,726 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:37,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:25:37,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:25:37,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:37,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:37,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:37,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2568#true} is VALID [2022-02-21 03:25:37,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2568#true} is VALID [2022-02-21 03:25:37,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume !(main_~x~0#1 < 1); {2568#true} is VALID [2022-02-21 03:25:37,963 INFO L272 TraceCheckUtils]: 3: Hoare triple {2568#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2568#true} is VALID [2022-02-21 03:25:37,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {2568#true} assume !(1 == ~n); {2568#true} is VALID [2022-02-21 03:25:37,963 INFO L272 TraceCheckUtils]: 7: Hoare triple {2568#true} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {2568#true} ~n := #in~n; {2656#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:37,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {2656#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {2656#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:37,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {2656#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {2656#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:37,971 INFO L272 TraceCheckUtils]: 11: Hoare triple {2656#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {2568#true} ~n := #in~n; {2656#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:37,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {2656#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {2656#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:37,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {2656#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} assume true; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,974 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2588#(<= |fibonacci_#in~n| 1)} {2656#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,976 INFO L272 TraceCheckUtils]: 17: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:37,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,978 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2568#true} {2619#(<= |fibonacci_#in~n| 2)} #36#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} assume true; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:37,979 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2619#(<= |fibonacci_#in~n| 2)} {2568#true} #34#return; {2587#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:37,980 INFO L272 TraceCheckUtils]: 25: Hoare triple {2587#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:37,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:37,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {2589#(<= fibonacci_~n 1)} assume !(~n < 1); {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:37,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {2589#(<= fibonacci_~n 1)} assume !(1 == ~n); {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:37,981 INFO L272 TraceCheckUtils]: 29: Hoare triple {2589#(<= fibonacci_~n 1)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {2568#true} ~n := #in~n; {2723#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {2723#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,982 INFO L272 TraceCheckUtils]: 33: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:37,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:37,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {2568#true} assume 1 == ~n;#res := 1; {2568#true} is VALID [2022-02-21 03:25:37,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,983 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2568#true} {2727#(<= 1 |fibonacci_#in~n|)} #34#return; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,984 INFO L272 TraceCheckUtils]: 39: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:37,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:37,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:37,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:37,985 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2568#true} {2727#(<= 1 |fibonacci_#in~n|)} #36#return; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} assume true; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:37,987 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2727#(<= 1 |fibonacci_#in~n|)} {2589#(<= fibonacci_~n 1)} #34#return; {2569#false} is VALID [2022-02-21 03:25:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 25 proven. 50 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-21 03:25:37,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:38,609 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2727#(<= 1 |fibonacci_#in~n|)} {2589#(<= fibonacci_~n 1)} #34#return; {2569#false} is VALID [2022-02-21 03:25:38,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} assume true; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:38,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:38,611 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2568#true} {2727#(<= 1 |fibonacci_#in~n|)} #36#return; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:38,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:38,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:38,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:38,611 INFO L272 TraceCheckUtils]: 39: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:38,612 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2568#true} {2727#(<= 1 |fibonacci_#in~n|)} #34#return; {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:38,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:38,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {2568#true} assume 1 == ~n;#res := 1; {2568#true} is VALID [2022-02-21 03:25:38,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:38,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:38,612 INFO L272 TraceCheckUtils]: 33: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:38,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {2727#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:38,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {2821#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {2727#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:38,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {2568#true} ~n := #in~n; {2821#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:25:38,613 INFO L272 TraceCheckUtils]: 29: Hoare triple {2589#(<= fibonacci_~n 1)} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:38,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {2589#(<= fibonacci_~n 1)} assume !(1 == ~n); {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:38,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {2589#(<= fibonacci_~n 1)} assume !(~n < 1); {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:38,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {2589#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:38,615 INFO L272 TraceCheckUtils]: 25: Hoare triple {2587#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:38,616 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2619#(<= |fibonacci_#in~n| 2)} {2568#true} #34#return; {2587#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:38,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} assume true; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:38,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:38,617 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2568#true} {2619#(<= |fibonacci_#in~n| 2)} #36#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:38,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {2568#true} assume true; {2568#true} is VALID [2022-02-21 03:25:38,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {2568#true} assume ~n < 1;#res := 0; {2568#true} is VALID [2022-02-21 03:25:38,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:38,618 INFO L272 TraceCheckUtils]: 17: Hoare triple {2619#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {2568#true} is VALID [2022-02-21 03:25:38,619 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2588#(<= |fibonacci_#in~n| 1)} {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #34#return; {2619#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:38,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {2588#(<= |fibonacci_#in~n| 1)} assume true; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:38,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {2877#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {2588#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:38,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {2877#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {2877#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:38,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {2568#true} ~n := #in~n; {2877#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:38,620 INFO L272 TraceCheckUtils]: 11: Hoare triple {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:38,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:38,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:38,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {2568#true} ~n := #in~n; {2867#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:38,621 INFO L272 TraceCheckUtils]: 7: Hoare triple {2568#true} call #t~ret4 := fibonacci(~n - 1); {2568#true} is VALID [2022-02-21 03:25:38,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2568#true} assume !(1 == ~n); {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2568#true} assume !(~n < 1); {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {2568#true} ~n := #in~n; {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L272 TraceCheckUtils]: 3: Hoare triple {2568#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2568#true} assume !(main_~x~0#1 < 1); {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2568#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {2568#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2568#true} is VALID [2022-02-21 03:25:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 25 proven. 52 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-21 03:25:38,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327600485] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:38,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:38,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2022-02-21 03:25:38,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476097908] [2022-02-21 03:25:38,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:38,975 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:38,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:38,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:38,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:38,976 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:38,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:38,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:38,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:38,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2022-02-21 03:25:38,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:38,976 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:38,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:38,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:38,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:38,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:39,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:39,040 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:39,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,042 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:25:39,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:39,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:39,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,079 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:25:39,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:39,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:39,720 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:39,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,725 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:39,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:39,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:39,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:39,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:39,725 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,725 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:39,725 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:39,725 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2022-02-21 03:25:39,725 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:39,725 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:39,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:39,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:39,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:39,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:39,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:39,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:39,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,795 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:25:39,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:39,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:39,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:39,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:39,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:39,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:39,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:39,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:39,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:39,817 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:25:39,817 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:39,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:39,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:39,818 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:39,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:25:39,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:39,820 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:39,820 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:39,820 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-02-21 03:25:39,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,841 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:39,844 INFO L390 LassoCheck]: Loop: "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#34#return;" "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#34#return;" [2022-02-21 03:25:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:39,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:40,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {2911#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2911#unseeded} is VALID [2022-02-21 03:25:40,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2911#unseeded} is VALID [2022-02-21 03:25:40,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {2911#unseeded} assume !(main_~x~0#1 < 1); {2911#unseeded} is VALID [2022-02-21 03:25:40,147 INFO L272 TraceCheckUtils]: 3: Hoare triple {2911#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2911#unseeded} is VALID [2022-02-21 03:25:40,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {2911#unseeded} ~n := #in~n; {2911#unseeded} is VALID [2022-02-21 03:25:40,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {2911#unseeded} assume !(~n < 1); {2911#unseeded} is VALID [2022-02-21 03:25:40,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {2911#unseeded} assume !(1 == ~n); {2911#unseeded} is VALID [2022-02-21 03:25:40,148 INFO L272 TraceCheckUtils]: 7: Hoare triple {2911#unseeded} call #t~ret4 := fibonacci(~n - 1); {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,152 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,153 INFO L272 TraceCheckUtils]: 17: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,155 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,156 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2950#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2911#unseeded} #34#return; {2911#unseeded} is VALID [2022-02-21 03:25:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:25:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:40,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {2914#(>= oldRank0 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {3002#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} is VALID [2022-02-21 03:25:40,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {3002#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} ~n := #in~n; {3006#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:40,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {3006#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(~n < 1); {3006#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:40,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {3006#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(1 == ~n); {3006#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:40,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {3006#(<= (+ 2 fibonacci_~n) oldRank0)} call #t~ret4 := fibonacci(~n - 1); {3016#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:40,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {3016#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,478 INFO L272 TraceCheckUtils]: 8: Hoare triple {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {3016#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:40,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {3016#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {3036#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {3036#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3036#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,481 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3036#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3020#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,482 INFO L272 TraceCheckUtils]: 14: Hoare triple {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {3016#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:40,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {3016#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3016#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:40,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3016#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:40,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {3016#(<= |old(oldRank0)| oldRank0)} assume true; {3016#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:40,492 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3016#(<= |old(oldRank0)| oldRank0)} {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:40,494 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3046#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3006#(<= (+ 2 fibonacci_~n) oldRank0)} #34#return; {2924#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:25:40,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:40,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:40,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,542 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 [2022-02-21 03:25:40,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:40,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 46 states and 55 transitions. Complement of second has 11 states. [2022-02-21 03:25:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:40,670 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:40,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:40,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:40,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:40,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:40,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:40,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:40,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2022-02-21 03:25:40,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:40,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:40,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:40,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 48 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:40,708 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:40,709 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:40,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:40,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 18 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:40,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:40,710 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:40,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 55 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:40,715 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:40,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:25:40,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:25:40,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:25:40,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:40,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:40,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:40,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:40,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:40,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:40,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:40,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:40,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:40,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:40,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:40,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:40,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:40,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:40,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:40,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:40,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:40,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:40,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:40,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:40,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:40,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:40,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:40,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:40,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:40,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:40,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:40,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,738 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-02-21 03:25:40,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:40,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:40,741 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:40,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {2911#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2911#unseeded} is VALID [2022-02-21 03:25:40,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2911#unseeded} is VALID [2022-02-21 03:25:40,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2911#unseeded} assume !(main_~x~0#1 < 1); {2911#unseeded} is VALID [2022-02-21 03:25:40,952 INFO L272 TraceCheckUtils]: 3: Hoare triple {2911#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2911#unseeded} is VALID [2022-02-21 03:25:40,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {2911#unseeded} ~n := #in~n; {2911#unseeded} is VALID [2022-02-21 03:25:40,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2911#unseeded} assume !(~n < 1); {2911#unseeded} is VALID [2022-02-21 03:25:40,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {2911#unseeded} assume !(1 == ~n); {2911#unseeded} is VALID [2022-02-21 03:25:40,953 INFO L272 TraceCheckUtils]: 7: Hoare triple {2911#unseeded} call #t~ret4 := fibonacci(~n - 1); {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,955 INFO L272 TraceCheckUtils]: 11: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,957 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,959 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:40,960 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3161#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2911#unseeded} #34#return; {2911#unseeded} is VALID [2022-02-21 03:25:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:25:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:40,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:41,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {2914#(>= oldRank0 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {3213#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} is VALID [2022-02-21 03:25:41,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {3213#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} ~n := #in~n; {3217#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:41,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {3217#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(~n < 1); {3217#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:41,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {3217#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(1 == ~n); {3217#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:41,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {3217#(<= (+ 2 fibonacci_~n) oldRank0)} call #t~ret4 := fibonacci(~n - 1); {3227#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:41,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {3227#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,322 INFO L272 TraceCheckUtils]: 8: Hoare triple {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {3227#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:41,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {3227#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {3247#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {3247#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {3247#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {3247#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3247#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,324 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3247#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3231#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,325 INFO L272 TraceCheckUtils]: 14: Hoare triple {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {3227#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:41,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {3227#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3227#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:41,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3227#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:41,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= |old(oldRank0)| oldRank0)} assume true; {3227#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:41,326 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3227#(<= |old(oldRank0)| oldRank0)} {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:41,328 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3257#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3217#(<= (+ 2 fibonacci_~n) oldRank0)} #34#return; {2924#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:25:41,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:41,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:41,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,362 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 [2022-02-21 03:25:41,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:41,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 46 states and 55 transitions. Complement of second has 11 states. [2022-02-21 03:25:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:41,499 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:41,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:41,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:41,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:41,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:41,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:41,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:41,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2022-02-21 03:25:41,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:25:41,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:41,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:41,501 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 48 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:41,501 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:41,501 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:41,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:41,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 18 transitions. cyclomatic complexity: 16 [2022-02-21 03:25:41,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:41,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:41,502 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 55 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:41,503 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:25:41,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:25:41,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:25:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:41,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:41,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:41,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:41,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:41,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:41,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:41,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:41,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:41,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:41,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:41,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:41,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:41,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:41,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 55 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,516 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-02-21 03:25:41,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:41,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:41,517 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:41,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {2911#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2911#unseeded} is VALID [2022-02-21 03:25:41,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2911#unseeded} is VALID [2022-02-21 03:25:41,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {2911#unseeded} assume !(main_~x~0#1 < 1); {2911#unseeded} is VALID [2022-02-21 03:25:41,746 INFO L272 TraceCheckUtils]: 3: Hoare triple {2911#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2911#unseeded} is VALID [2022-02-21 03:25:41,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {2911#unseeded} ~n := #in~n; {2911#unseeded} is VALID [2022-02-21 03:25:41,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {2911#unseeded} assume !(~n < 1); {2911#unseeded} is VALID [2022-02-21 03:25:41,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {2911#unseeded} assume !(1 == ~n); {2911#unseeded} is VALID [2022-02-21 03:25:41,747 INFO L272 TraceCheckUtils]: 7: Hoare triple {2911#unseeded} call #t~ret4 := fibonacci(~n - 1); {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,748 INFO L272 TraceCheckUtils]: 11: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,751 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,751 INFO L272 TraceCheckUtils]: 17: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,753 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:41,754 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3372#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2911#unseeded} #34#return; {2911#unseeded} is VALID [2022-02-21 03:25:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:25:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:41,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:42,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {2914#(>= oldRank0 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {3424#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} is VALID [2022-02-21 03:25:42,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#(<= (+ 2 |fibonacci_#in~n|) oldRank0)} ~n := #in~n; {3428#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:42,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {3428#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(~n < 1); {3428#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:42,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {3428#(<= (+ 2 fibonacci_~n) oldRank0)} assume !(1 == ~n); {3428#(<= (+ 2 fibonacci_~n) oldRank0)} is VALID [2022-02-21 03:25:42,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {3428#(<= (+ 2 fibonacci_~n) oldRank0)} call #t~ret4 := fibonacci(~n - 1); {3438#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:42,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {3438#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,084 INFO L272 TraceCheckUtils]: 8: Hoare triple {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {3438#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:42,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {3438#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {3458#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {3458#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {3458#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3458#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,086 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3458#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3442#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,086 INFO L272 TraceCheckUtils]: 14: Hoare triple {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {3438#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:42,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {3438#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {3438#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:42,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {3438#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {3438#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:42,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {3438#(<= |old(oldRank0)| oldRank0)} assume true; {3438#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:42,088 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3438#(<= |old(oldRank0)| oldRank0)} {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:42,089 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3468#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {3428#(<= (+ 2 fibonacci_~n) oldRank0)} #34#return; {2924#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:25:42,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:42,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:42,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,121 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 [2022-02-21 03:25:42,121 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:42,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 345 states and 444 transitions. Complement of second has 125 states. [2022-02-21 03:25:42,621 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 [2022-02-21 03:25:42,621 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:42,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:42,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:42,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:42,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:42,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:42,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:42,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:42,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 345 states and 444 transitions. [2022-02-21 03:25:42,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:42,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:42,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:42,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 48 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:42,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:25:42,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:42,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:42,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:42,626 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 345 states and 444 transitions. cyclomatic complexity: 103 [2022-02-21 03:25:42,631 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:25:42,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:42,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:25:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:25:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:25:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 345 letters. Loop has 345 letters. [2022-02-21 03:25:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 345 letters. Loop has 345 letters. [2022-02-21 03:25:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 345 letters. Loop has 345 letters. [2022-02-21 03:25:42,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:42,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:25:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:25:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:42,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:42,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:25:42,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:25:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:42,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:42,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 25 letters. Loop has 34 letters. [2022-02-21 03:25:42,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:42,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:42,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:25:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:25:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:25:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 63 letters. Loop has 26 letters. [2022-02-21 03:25:42,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 63 letters. Loop has 26 letters. [2022-02-21 03:25:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 63 letters. Loop has 26 letters. [2022-02-21 03:25:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 61 letters. Loop has 26 letters. [2022-02-21 03:25:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 61 letters. Loop has 26 letters. [2022-02-21 03:25:42,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 61 letters. Loop has 26 letters. [2022-02-21 03:25:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:25:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:25:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 35 letters. Loop has 4 letters. [2022-02-21 03:25:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 55 letters. Loop has 30 letters. [2022-02-21 03:25:42,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 30 letters. [2022-02-21 03:25:42,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 55 letters. Loop has 30 letters. [2022-02-21 03:25:42,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 81 letters. Loop has 26 letters. [2022-02-21 03:25:42,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 81 letters. Loop has 26 letters. [2022-02-21 03:25:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 81 letters. Loop has 26 letters. [2022-02-21 03:25:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 62 letters. Loop has 26 letters. [2022-02-21 03:25:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 62 letters. Loop has 26 letters. [2022-02-21 03:25:42,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 62 letters. Loop has 26 letters. [2022-02-21 03:25:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 60 letters. Loop has 26 letters. [2022-02-21 03:25:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 60 letters. Loop has 26 letters. [2022-02-21 03:25:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 60 letters. Loop has 26 letters. [2022-02-21 03:25:42,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:25:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:25:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:25:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:25:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:25:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 34 letters. Loop has 4 letters. [2022-02-21 03:25:42,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 81 letters. Loop has 39 letters. [2022-02-21 03:25:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 81 letters. Loop has 39 letters. [2022-02-21 03:25:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 81 letters. Loop has 39 letters. [2022-02-21 03:25:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 81 letters. Loop has 26 letters. [2022-02-21 03:25:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 81 letters. Loop has 26 letters. [2022-02-21 03:25:42,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 81 letters. Loop has 26 letters. [2022-02-21 03:25:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 55 letters. Loop has 43 letters. [2022-02-21 03:25:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 43 letters. [2022-02-21 03:25:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 55 letters. Loop has 43 letters. [2022-02-21 03:25:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 48 transitions. cyclomatic complexity: 11 Stem has 55 letters. Loop has 30 letters. [2022-02-21 03:25:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Stem has 55 letters. Loop has 30 letters. [2022-02-21 03:25:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 345 states and 444 transitions. cyclomatic complexity: 103 Stem has 55 letters. Loop has 30 letters. [2022-02-21 03:25:42,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,650 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:25:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-02-21 03:25:42,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:25:42,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 47 letters. Loop has 22 letters. [2022-02-21 03:25:42,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 25 letters. Loop has 44 letters. [2022-02-21 03:25:42,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:42,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 444 transitions. cyclomatic complexity: 103 [2022-02-21 03:25:42,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:42,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 220 states and 297 transitions. [2022-02-21 03:25:42,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2022-02-21 03:25:42,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-02-21 03:25:42,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 297 transitions. [2022-02-21 03:25:42,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:42,673 INFO L681 BuchiCegarLoop]: Abstraction has 220 states and 297 transitions. [2022-02-21 03:25:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 297 transitions. [2022-02-21 03:25:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2022-02-21 03:25:42,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:42,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states and 297 transitions. Second operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) [2022-02-21 03:25:42,682 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states and 297 transitions. Second operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) [2022-02-21 03:25:42,683 INFO L87 Difference]: Start difference. First operand 220 states and 297 transitions. Second operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) [2022-02-21 03:25:42,686 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:42,727 INFO L93 Difference]: Finished difference Result 687 states and 958 transitions. [2022-02-21 03:25:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 958 transitions. [2022-02-21 03:25:42,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:42,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:42,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) Second operand 220 states and 297 transitions. [2022-02-21 03:25:42,731 INFO L87 Difference]: Start difference. First operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) Second operand 220 states and 297 transitions. [2022-02-21 03:25:42,731 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:42,764 INFO L93 Difference]: Finished difference Result 747 states and 1046 transitions. [2022-02-21 03:25:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1046 transitions. [2022-02-21 03:25:42,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:42,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:42,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:42,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) [2022-02-21 03:25:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2022-02-21 03:25:42,771 INFO L704 BuchiCegarLoop]: Abstraction has 172 states and 223 transitions. [2022-02-21 03:25:42,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:25:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:25:42,772 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:25:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:43,057 INFO L93 Difference]: Finished difference Result 279 states and 383 transitions. [2022-02-21 03:25:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:25:43,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-21 03:25:43,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:43,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 383 transitions. [2022-02-21 03:25:43,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:43,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 278 states and 381 transitions. [2022-02-21 03:25:43,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2022-02-21 03:25:43,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2022-02-21 03:25:43,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 381 transitions. [2022-02-21 03:25:43,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:43,121 INFO L681 BuchiCegarLoop]: Abstraction has 278 states and 381 transitions. [2022-02-21 03:25:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 381 transitions. [2022-02-21 03:25:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 221. [2022-02-21 03:25:43,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:43,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states and 381 transitions. Second operand has 221 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 142 states have internal predecessors, (153), 47 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (94), 50 states have call predecessors, (94), 45 states have call successors, (94) [2022-02-21 03:25:43,131 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states and 381 transitions. Second operand has 221 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 142 states have internal predecessors, (153), 47 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (94), 50 states have call predecessors, (94), 45 states have call successors, (94) [2022-02-21 03:25:43,135 INFO L87 Difference]: Start difference. First operand 278 states and 381 transitions. Second operand has 221 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 142 states have internal predecessors, (153), 47 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (94), 50 states have call predecessors, (94), 45 states have call successors, (94) [2022-02-21 03:25:43,144 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:43,185 INFO L93 Difference]: Finished difference Result 938 states and 1309 transitions. [2022-02-21 03:25:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1309 transitions. [2022-02-21 03:25:43,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:43,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:43,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 142 states have internal predecessors, (153), 47 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (94), 50 states have call predecessors, (94), 45 states have call successors, (94) Second operand 278 states and 381 transitions. [2022-02-21 03:25:43,205 INFO L87 Difference]: Start difference. First operand has 221 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 142 states have internal predecessors, (153), 47 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (94), 50 states have call predecessors, (94), 45 states have call successors, (94) Second operand 278 states and 381 transitions. [2022-02-21 03:25:43,205 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:43,247 INFO L93 Difference]: Finished difference Result 952 states and 1317 transitions. [2022-02-21 03:25:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1317 transitions. [2022-02-21 03:25:43,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:43,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:43,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:43,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 142 states have internal predecessors, (153), 47 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (94), 50 states have call predecessors, (94), 45 states have call successors, (94) [2022-02-21 03:25:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 302 transitions. [2022-02-21 03:25:43,256 INFO L704 BuchiCegarLoop]: Abstraction has 221 states and 302 transitions. [2022-02-21 03:25:43,256 INFO L587 BuchiCegarLoop]: Abstraction has 221 states and 302 transitions. [2022-02-21 03:25:43,256 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:43,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 302 transitions. [2022-02-21 03:25:43,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:43,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:43,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:43,258 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:25:43,258 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:43,258 INFO L791 eck$LassoCheckResult]: Stem: 6905#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6906#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 6911#L29 assume !(main_~x~0#1 < 1); 6912#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 6918#fibonacciENTRY ~n := #in~n; 6963#L17 assume !(~n < 1); 6948#L19 assume !(1 == ~n); 6944#L22 call #t~ret4 := fibonacci(~n - 1);< 6946#fibonacciENTRY ~n := #in~n; 6954#L17 assume !(~n < 1); 6955#L19 assume !(1 == ~n); 6945#L22 call #t~ret4 := fibonacci(~n - 1);< 6946#fibonacciENTRY ~n := #in~n; 6954#L17 assume !(~n < 1); 6955#L19 assume !(1 == ~n); 6945#L22 call #t~ret4 := fibonacci(~n - 1);< 6946#fibonacciENTRY ~n := #in~n; 6964#L17 assume !(~n < 1); 7018#L19 assume 1 == ~n;#res := 1; 7016#fibonacciFINAL assume true; 7002#fibonacciEXIT >#34#return; 6998#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6999#fibonacciENTRY ~n := #in~n; 7012#L17 assume ~n < 1;#res := 0; 7001#fibonacciFINAL assume true; 6997#fibonacciEXIT >#36#return; 6995#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6991#fibonacciFINAL assume true; 6987#fibonacciEXIT >#34#return; 6976#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6971#fibonacciENTRY ~n := #in~n; 6994#L17 assume ~n < 1;#res := 0; 6993#fibonacciFINAL assume true; 6985#fibonacciEXIT >#36#return; 6984#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6983#fibonacciFINAL assume true; 6943#fibonacciEXIT >#34#return; 6932#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6939#fibonacciENTRY ~n := #in~n; 6936#L17 assume !(~n < 1); 6930#L19 assume !(1 == ~n); 6935#L22 call #t~ret4 := fibonacci(~n - 1);< 6901#fibonacciENTRY ~n := #in~n; 7085#L17 assume !(~n < 1); 7086#L19 assume !(1 == ~n); 7068#L22 call #t~ret4 := fibonacci(~n - 1);< 7070#fibonacciENTRY [2022-02-21 03:25:43,258 INFO L793 eck$LassoCheckResult]: Loop: 7070#fibonacciENTRY ~n := #in~n; 7084#L17 assume !(~n < 1); 7083#L19 assume !(1 == ~n); 7069#L22 call #t~ret4 := fibonacci(~n - 1);< 7070#fibonacciENTRY [2022-02-21 03:25:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1072629993, now seen corresponding path program 3 times [2022-02-21 03:25:43,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:43,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393590884] [2022-02-21 03:25:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:25:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {10312#true} assume 1 == ~n;#res := 1; {10312#true} is VALID [2022-02-21 03:25:43,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,349 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {10312#true} assume ~n < 1;#res := 0; {10312#true} is VALID [2022-02-21 03:25:43,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} ~n := #in~n; {10365#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {10365#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10366#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {10366#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,359 INFO L272 TraceCheckUtils]: 3: Hoare triple {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {10312#true} assume 1 == ~n;#res := 1; {10312#true} is VALID [2022-02-21 03:25:43,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,360 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,360 INFO L272 TraceCheckUtils]: 9: Hoare triple {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {10312#true} assume ~n < 1;#res := 0; {10312#true} is VALID [2022-02-21 03:25:43,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,361 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {10377#(<= 2 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {10377#(<= 2 |fibonacci_#in~n|)} assume true; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,362 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10377#(<= 2 |fibonacci_#in~n|)} {10312#true} #34#return; {10360#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:25:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 03:25:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} ~n := #in~n; {10365#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {10365#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} assume true; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10378#(<= |fibonacci_#in~n| 0)} {10360#(<= 3 fibonacci_~n)} #36#return; {10313#false} is VALID [2022-02-21 03:25:43,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:43,378 INFO L272 TraceCheckUtils]: 3: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {10312#true} ~n := #in~n; {10365#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {10365#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10366#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {10366#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,379 INFO L272 TraceCheckUtils]: 7: Hoare triple {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {10312#true} assume 1 == ~n;#res := 1; {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,380 INFO L272 TraceCheckUtils]: 13: Hoare triple {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {10312#true} assume ~n < 1;#res := 0; {10312#true} is VALID [2022-02-21 03:25:43,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,381 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {10377#(<= 2 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {10377#(<= 2 |fibonacci_#in~n|)} assume true; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,382 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10377#(<= 2 |fibonacci_#in~n|)} {10312#true} #34#return; {10360#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:25:43,382 INFO L272 TraceCheckUtils]: 21: Hoare triple {10360#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {10312#true} ~n := #in~n; {10365#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {10365#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} assume true; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,383 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10378#(<= |fibonacci_#in~n| 0)} {10360#(<= 3 fibonacci_~n)} #36#return; {10313#false} is VALID [2022-02-21 03:25:43,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {10313#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10313#false} is VALID [2022-02-21 03:25:43,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {10313#false} assume true; {10313#false} is VALID [2022-02-21 03:25:43,384 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10313#false} {10312#true} #34#return; {10313#false} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {10312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {10312#true} assume !(main_~x~0#1 < 1); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L272 TraceCheckUtils]: 3: Hoare triple {10312#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L272 TraceCheckUtils]: 7: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:43,384 INFO L272 TraceCheckUtils]: 11: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {10312#true} ~n := #in~n; {10365#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {10365#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10366#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {10366#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,386 INFO L272 TraceCheckUtils]: 15: Hoare triple {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {10312#true} assume 1 == ~n;#res := 1; {10312#true} is VALID [2022-02-21 03:25:43,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,386 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:43,387 INFO L272 TraceCheckUtils]: 21: Hoare triple {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {10312#true} assume ~n < 1;#res := 0; {10312#true} is VALID [2022-02-21 03:25:43,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,387 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10312#true} {10367#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {10377#(<= 2 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {10377#(<= 2 |fibonacci_#in~n|)} assume true; {10377#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,388 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10377#(<= 2 |fibonacci_#in~n|)} {10312#true} #34#return; {10360#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:25:43,388 INFO L272 TraceCheckUtils]: 29: Hoare triple {10360#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {10312#true} ~n := #in~n; {10365#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:43,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {10365#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} assume true; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,390 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10378#(<= |fibonacci_#in~n| 0)} {10360#(<= 3 fibonacci_~n)} #36#return; {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {10313#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {10313#false} assume true; {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10313#false} {10312#true} #34#return; {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L272 TraceCheckUtils]: 37: Hoare triple {10313#false} call #t~ret5 := fibonacci(~n - 2); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {10313#false} ~n := #in~n; {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {10313#false} assume !(~n < 1); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {10313#false} assume !(1 == ~n); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L272 TraceCheckUtils]: 41: Hoare triple {10313#false} call #t~ret4 := fibonacci(~n - 1); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {10313#false} ~n := #in~n; {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {10313#false} assume !(~n < 1); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {10313#false} assume !(1 == ~n); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L272 TraceCheckUtils]: 45: Hoare triple {10313#false} call #t~ret4 := fibonacci(~n - 1); {10313#false} is VALID [2022-02-21 03:25:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-21 03:25:43,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:43,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393590884] [2022-02-21 03:25:43,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393590884] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:43,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935646467] [2022-02-21 03:25:43,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:25:43,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:43,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:43,392 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:43,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-21 03:25:43,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-21 03:25:43,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:43,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:25:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:43,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:43,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {10312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {10312#true} assume !(main_~x~0#1 < 1); {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L272 TraceCheckUtils]: 3: Hoare triple {10312#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:43,645 INFO L272 TraceCheckUtils]: 7: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {10312#true} ~n := #in~n; {10406#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:43,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {10406#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10406#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:43,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {10406#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {10406#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:43,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {10406#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L272 TraceCheckUtils]: 15: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {10312#true} assume 1 == ~n;#res := 1; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10312#true} {10312#true} #34#return; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L272 TraceCheckUtils]: 21: Hoare triple {10312#true} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {10312#true} assume ~n < 1;#res := 0; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10312#true} {10312#true} #36#return; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {10312#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10312#true} is VALID [2022-02-21 03:25:43,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:43,648 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10312#true} {10406#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {10406#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:43,648 INFO L272 TraceCheckUtils]: 29: Hoare triple {10406#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:43,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {10312#true} ~n := #in~n; {10406#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:43,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {10406#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} assume true; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,650 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10378#(<= |fibonacci_#in~n| 0)} {10406#(<= |fibonacci_#in~n| fibonacci_~n)} #36#return; {10482#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:43,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {10482#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10482#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:43,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {10482#(<= |fibonacci_#in~n| 2)} assume true; {10482#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:43,651 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10482#(<= |fibonacci_#in~n| 2)} {10312#true} #34#return; {10492#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:43,651 INFO L272 TraceCheckUtils]: 37: Hoare triple {10492#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {10496#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:43,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {10496#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {10500#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:43,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {10500#(<= fibonacci_~n 1)} assume !(~n < 1); {10500#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:43,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {10500#(<= fibonacci_~n 1)} assume !(1 == ~n); {10500#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:43,653 INFO L272 TraceCheckUtils]: 41: Hoare triple {10500#(<= fibonacci_~n 1)} call #t~ret4 := fibonacci(~n - 1); {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:43,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {10513#(<= fibonacci_~n 0)} is VALID [2022-02-21 03:25:43,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {10513#(<= fibonacci_~n 0)} assume !(~n < 1); {10313#false} is VALID [2022-02-21 03:25:43,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {10313#false} assume !(1 == ~n); {10313#false} is VALID [2022-02-21 03:25:43,654 INFO L272 TraceCheckUtils]: 45: Hoare triple {10313#false} call #t~ret4 := fibonacci(~n - 1); {10313#false} is VALID [2022-02-21 03:25:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-21 03:25:43,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:44,147 INFO L272 TraceCheckUtils]: 45: Hoare triple {10313#false} call #t~ret4 := fibonacci(~n - 1); {10313#false} is VALID [2022-02-21 03:25:44,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {10313#false} assume !(1 == ~n); {10313#false} is VALID [2022-02-21 03:25:44,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {10513#(<= fibonacci_~n 0)} assume !(~n < 1); {10313#false} is VALID [2022-02-21 03:25:44,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} ~n := #in~n; {10513#(<= fibonacci_~n 0)} is VALID [2022-02-21 03:25:44,149 INFO L272 TraceCheckUtils]: 41: Hoare triple {10500#(<= fibonacci_~n 1)} call #t~ret4 := fibonacci(~n - 1); {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:44,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {10500#(<= fibonacci_~n 1)} assume !(1 == ~n); {10500#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:44,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {10500#(<= fibonacci_~n 1)} assume !(~n < 1); {10500#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:44,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {10496#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {10500#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:44,150 INFO L272 TraceCheckUtils]: 37: Hoare triple {10492#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {10496#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:44,150 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10482#(<= |fibonacci_#in~n| 2)} {10312#true} #34#return; {10492#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:44,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {10482#(<= |fibonacci_#in~n| 2)} assume true; {10482#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:44,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {10482#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10482#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:44,152 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10378#(<= |fibonacci_#in~n| 0)} {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #36#return; {10482#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:44,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {10378#(<= |fibonacci_#in~n| 0)} assume true; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:44,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {10572#(or (<= |fibonacci_#in~n| 0) (not (< fibonacci_~n 1)))} assume ~n < 1;#res := 0; {10378#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:44,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {10312#true} ~n := #in~n; {10572#(or (<= |fibonacci_#in~n| 0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:44,153 INFO L272 TraceCheckUtils]: 29: Hoare triple {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:44,153 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10312#true} {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #34#return; {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:44,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:44,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {10312#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10312#true} {10312#true} #36#return; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {10312#true} assume ~n < 1;#res := 0; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L272 TraceCheckUtils]: 21: Hoare triple {10312#true} call #t~ret5 := fibonacci(~n - 2); {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10312#true} {10312#true} #34#return; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {10312#true} assume true; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {10312#true} assume 1 == ~n;#res := 1; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L272 TraceCheckUtils]: 15: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:44,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:44,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:44,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:44,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:44,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {10312#true} ~n := #in~n; {10562#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:44,158 INFO L272 TraceCheckUtils]: 7: Hoare triple {10312#true} call #t~ret4 := fibonacci(~n - 1); {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {10312#true} assume !(1 == ~n); {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {10312#true} assume !(~n < 1); {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {10312#true} ~n := #in~n; {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L272 TraceCheckUtils]: 3: Hoare triple {10312#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {10312#true} assume !(main_~x~0#1 < 1); {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {10312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10312#true} is VALID [2022-02-21 03:25:44,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {10312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10312#true} is VALID [2022-02-21 03:25:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-21 03:25:44,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935646467] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:44,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:44,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 16 [2022-02-21 03:25:44,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66845406] [2022-02-21 03:25:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:44,160 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 927646, now seen corresponding path program 2 times [2022-02-21 03:25:44,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:44,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406553534] [2022-02-21 03:25:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:44,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:44,177 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:44,222 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:44,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:44,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:44,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:44,223 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:44,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:44,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:44,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2022-02-21 03:25:44,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:44,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:44,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:44,269 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:44,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,270 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:44,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:25:44,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:44,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:44,304 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:44,304 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:44,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,327 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:44,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:25:44,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:44,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:44,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:25:44,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,373 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:44,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:25:44,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:44,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:44,432 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:44,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:25:44,435 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:44,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:44,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:44,435 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:44,435 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:44,435 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:44,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:44,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2022-02-21 03:25:44,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:44,436 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:44,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:44,489 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:44,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:44,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,492 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:44,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:25:44,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:44,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:44,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:44,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,520 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:44,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:25:44,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:44,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:44,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:44,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:44,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:44,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:44,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:44,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:44,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:44,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:44,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:44,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:44,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:44,547 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:44,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:25:44,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:44,548 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:44,548 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:44,548 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2022-02-21 03:25:44,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:25:44,568 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:44,574 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< [2022-02-21 03:25:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:25:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:44,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:44,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {10659#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10659#unseeded} is VALID [2022-02-21 03:25:44,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {10659#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10659#unseeded} is VALID [2022-02-21 03:25:44,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {10659#unseeded} assume !(main_~x~0#1 < 1); {10659#unseeded} is VALID [2022-02-21 03:25:44,982 INFO L272 TraceCheckUtils]: 3: Hoare triple {10659#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10659#unseeded} is VALID [2022-02-21 03:25:44,982 INFO L290 TraceCheckUtils]: 4: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:44,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:44,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:44,983 INFO L272 TraceCheckUtils]: 7: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,985 INFO L272 TraceCheckUtils]: 11: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,986 INFO L272 TraceCheckUtils]: 15: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,988 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,989 INFO L272 TraceCheckUtils]: 21: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,990 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,992 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,992 INFO L272 TraceCheckUtils]: 29: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,994 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:44,995 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10698#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10659#unseeded} #34#return; {10659#unseeded} is VALID [2022-02-21 03:25:44,995 INFO L272 TraceCheckUtils]: 37: Hoare triple {10659#unseeded} call #t~ret5 := fibonacci(~n - 2); {10659#unseeded} is VALID [2022-02-21 03:25:44,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:44,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:44,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:44,996 INFO L272 TraceCheckUtils]: 41: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10659#unseeded} is VALID [2022-02-21 03:25:44,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:44,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:44,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:44,998 INFO L272 TraceCheckUtils]: 45: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {10662#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {10813#(<= fibonacci_~n oldRank0)} is VALID [2022-02-21 03:25:45,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {10813#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {10817#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:45,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {10817#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} assume !(1 == ~n); {10817#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:45,040 INFO L272 TraceCheckUtils]: 3: Hoare triple {10817#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} call #t~ret4 := fibonacci(~n - 1); {10672#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)))} is VALID [2022-02-21 03:25:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:45,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:45,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,058 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 [2022-02-21 03:25:45,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 221 states and 302 transitions. cyclomatic complexity: 85 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 221 states and 302 transitions. cyclomatic complexity: 85. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 243 states and 328 transitions. Complement of second has 13 states. [2022-02-21 03:25:45,150 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 [2022-02-21 03:25:45,150 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 302 transitions. cyclomatic complexity: 85 [2022-02-21 03:25:45,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:45,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 328 transitions. [2022-02-21 03:25:45,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:45,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 221 states and 302 transitions. cyclomatic complexity: 85 [2022-02-21 03:25:45,156 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:25:45,156 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:45,157 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:45,157 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 243 states and 328 transitions. cyclomatic complexity: 89 [2022-02-21 03:25:45,160 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:25:45,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 243 letters. Loop has 243 letters. [2022-02-21 03:25:45,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 243 letters. Loop has 243 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 243 letters. Loop has 243 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:45,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:45,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,190 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-21 03:25:45,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,191 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {10659#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10659#unseeded} is VALID [2022-02-21 03:25:45,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {10659#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10659#unseeded} is VALID [2022-02-21 03:25:45,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {10659#unseeded} assume !(main_~x~0#1 < 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,525 INFO L272 TraceCheckUtils]: 3: Hoare triple {10659#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10659#unseeded} is VALID [2022-02-21 03:25:45,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:45,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:45,527 INFO L272 TraceCheckUtils]: 7: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,528 INFO L272 TraceCheckUtils]: 11: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,530 INFO L272 TraceCheckUtils]: 15: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,532 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,533 INFO L272 TraceCheckUtils]: 21: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,535 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,536 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,537 INFO L272 TraceCheckUtils]: 29: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,539 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:45,540 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11112#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10659#unseeded} #34#return; {10659#unseeded} is VALID [2022-02-21 03:25:45,540 INFO L272 TraceCheckUtils]: 37: Hoare triple {10659#unseeded} call #t~ret5 := fibonacci(~n - 2); {10659#unseeded} is VALID [2022-02-21 03:25:45,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:45,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:45,541 INFO L272 TraceCheckUtils]: 41: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:45,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:45,543 INFO L272 TraceCheckUtils]: 45: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10659#unseeded} is VALID [2022-02-21 03:25:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:45,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {10662#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {11227#(<= fibonacci_~n oldRank0)} is VALID [2022-02-21 03:25:45,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {11227#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {11231#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:45,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {11231#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} assume !(1 == ~n); {11231#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:45,589 INFO L272 TraceCheckUtils]: 3: Hoare triple {11231#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} call #t~ret4 := fibonacci(~n - 1); {10672#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)))} is VALID [2022-02-21 03:25:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:45,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:45,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,610 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 [2022-02-21 03:25:45,611 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 221 states and 302 transitions. cyclomatic complexity: 85 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,684 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 221 states and 302 transitions. cyclomatic complexity: 85. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 243 states and 328 transitions. Complement of second has 13 states. [2022-02-21 03:25:45,684 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 [2022-02-21 03:25:45,684 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 302 transitions. cyclomatic complexity: 85 [2022-02-21 03:25:45,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:45,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 328 transitions. [2022-02-21 03:25:45,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:45,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:45,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:45,687 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 221 states and 302 transitions. cyclomatic complexity: 85 [2022-02-21 03:25:45,687 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:25:45,687 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:45,687 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:45,687 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 243 states and 328 transitions. cyclomatic complexity: 89 [2022-02-21 03:25:45,691 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:25:45,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 243 letters. Loop has 243 letters. [2022-02-21 03:25:45,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 243 letters. Loop has 243 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 243 letters. Loop has 243 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:45,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:45,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:45,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:45,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 121 letters. Loop has 38 letters. [2022-02-21 03:25:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 121 letters. Loop has 38 letters. [2022-02-21 03:25:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 121 letters. Loop has 38 letters. [2022-02-21 03:25:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 42 letters. [2022-02-21 03:25:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 83 letters. Loop has 42 letters. [2022-02-21 03:25:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 42 letters. [2022-02-21 03:25:45,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 84 letters. Loop has 38 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 84 letters. Loop has 38 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 84 letters. Loop has 38 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 85 letters. Loop has 38 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 85 letters. Loop has 38 letters. [2022-02-21 03:25:45,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 85 letters. Loop has 38 letters. [2022-02-21 03:25:45,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 86 letters. Loop has 38 letters. [2022-02-21 03:25:45,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 86 letters. Loop has 38 letters. [2022-02-21 03:25:45,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 86 letters. Loop has 38 letters. [2022-02-21 03:25:45,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 51 letters. Loop has 4 letters. [2022-02-21 03:25:45,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 51 letters. Loop has 4 letters. [2022-02-21 03:25:45,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 51 letters. Loop has 4 letters. [2022-02-21 03:25:45,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 87 letters. Loop has 38 letters. [2022-02-21 03:25:45,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 87 letters. Loop has 38 letters. [2022-02-21 03:25:45,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 87 letters. Loop has 38 letters. [2022-02-21 03:25:45,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 88 letters. Loop has 38 letters. [2022-02-21 03:25:45,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 88 letters. Loop has 38 letters. [2022-02-21 03:25:45,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 88 letters. Loop has 38 letters. [2022-02-21 03:25:45,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 89 letters. Loop has 38 letters. [2022-02-21 03:25:45,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 89 letters. Loop has 38 letters. [2022-02-21 03:25:45,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 89 letters. Loop has 38 letters. [2022-02-21 03:25:45,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 52 letters. Loop has 4 letters. [2022-02-21 03:25:45,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 52 letters. Loop has 4 letters. [2022-02-21 03:25:45,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 52 letters. Loop has 4 letters. [2022-02-21 03:25:45,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 90 letters. Loop has 38 letters. [2022-02-21 03:25:45,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 90 letters. Loop has 38 letters. [2022-02-21 03:25:45,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 90 letters. Loop has 38 letters. [2022-02-21 03:25:45,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 91 letters. Loop has 38 letters. [2022-02-21 03:25:45,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 91 letters. Loop has 38 letters. [2022-02-21 03:25:45,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 91 letters. Loop has 38 letters. [2022-02-21 03:25:45,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 53 letters. Loop has 4 letters. [2022-02-21 03:25:45,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 53 letters. Loop has 4 letters. [2022-02-21 03:25:45,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 53 letters. Loop has 4 letters. [2022-02-21 03:25:45,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 121 letters. Loop has 38 letters. [2022-02-21 03:25:45,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 121 letters. Loop has 38 letters. [2022-02-21 03:25:45,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 121 letters. Loop has 38 letters. [2022-02-21 03:25:45,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 42 letters. [2022-02-21 03:25:45,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 83 letters. Loop has 42 letters. [2022-02-21 03:25:45,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 243 states and 328 transitions. cyclomatic complexity: 89 Stem has 83 letters. Loop has 42 letters. [2022-02-21 03:25:45,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,711 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-21 03:25:45,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:45,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:45,712 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:25:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:45,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:46,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {10659#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10659#unseeded} is VALID [2022-02-21 03:25:46,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {10659#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10659#unseeded} is VALID [2022-02-21 03:25:46,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {10659#unseeded} assume !(main_~x~0#1 < 1); {10659#unseeded} is VALID [2022-02-21 03:25:46,058 INFO L272 TraceCheckUtils]: 3: Hoare triple {10659#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10659#unseeded} is VALID [2022-02-21 03:25:46,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:46,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:46,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:46,059 INFO L272 TraceCheckUtils]: 7: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,061 INFO L272 TraceCheckUtils]: 11: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,063 INFO L272 TraceCheckUtils]: 15: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,065 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,065 INFO L272 TraceCheckUtils]: 21: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,067 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,068 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,069 INFO L272 TraceCheckUtils]: 29: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,070 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:46,072 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11526#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10659#unseeded} #34#return; {10659#unseeded} is VALID [2022-02-21 03:25:46,072 INFO L272 TraceCheckUtils]: 37: Hoare triple {10659#unseeded} call #t~ret5 := fibonacci(~n - 2); {10659#unseeded} is VALID [2022-02-21 03:25:46,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:46,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:46,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:46,073 INFO L272 TraceCheckUtils]: 41: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10659#unseeded} is VALID [2022-02-21 03:25:46,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {10659#unseeded} ~n := #in~n; {10659#unseeded} is VALID [2022-02-21 03:25:46,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {10659#unseeded} assume !(~n < 1); {10659#unseeded} is VALID [2022-02-21 03:25:46,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {10659#unseeded} assume !(1 == ~n); {10659#unseeded} is VALID [2022-02-21 03:25:46,074 INFO L272 TraceCheckUtils]: 45: Hoare triple {10659#unseeded} call #t~ret4 := fibonacci(~n - 1); {10659#unseeded} is VALID [2022-02-21 03:25:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:25:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:46,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {10662#(>= oldRank0 |fibonacci_#in~n|)} ~n := #in~n; {11641#(<= fibonacci_~n oldRank0)} is VALID [2022-02-21 03:25:46,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {11641#(<= fibonacci_~n oldRank0)} assume !(~n < 1); {11645#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:46,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {11645#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} assume !(1 == ~n); {11645#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:46,115 INFO L272 TraceCheckUtils]: 3: Hoare triple {11645#(and (<= fibonacci_~n oldRank0) (not (< fibonacci_~n 1)))} call #t~ret4 := fibonacci(~n - 1); {10672#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibonacci_#in~n|)))} is VALID [2022-02-21 03:25:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:46,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:46,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:46,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,137 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 [2022-02-21 03:25:46,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 221 states and 302 transitions. cyclomatic complexity: 85 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:46,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 221 states and 302 transitions. cyclomatic complexity: 85. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 294 states and 381 transitions. Complement of second has 14 states. [2022-02-21 03:25:46,255 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 [2022-02-21 03:25:46,255 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:46,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 302 transitions. cyclomatic complexity: 85 [2022-02-21 03:25:46,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:46,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:46,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:46,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:46,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:46,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:46,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 381 transitions. [2022-02-21 03:25:46,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:46,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:46,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:46,258 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 221 states and 302 transitions. cyclomatic complexity: 85 [2022-02-21 03:25:46,258 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:25:46,258 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:46,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:46,258 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:46,258 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 294 states and 381 transitions. cyclomatic complexity: 91 [2022-02-21 03:25:46,260 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:25:46,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:46,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 294 letters. Loop has 294 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 294 letters. Loop has 294 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 294 letters. Loop has 294 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 221 letters. Loop has 221 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:46,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:46,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:46,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:46,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:46,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:46,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 48 letters. Loop has 4 letters. [2022-02-21 03:25:46,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:46,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:46,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 47 letters. Loop has 4 letters. [2022-02-21 03:25:46,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:46,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:46,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:46,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:46,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:46,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 82 letters. Loop has 38 letters. [2022-02-21 03:25:46,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:46,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:46,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:46,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:46,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:46,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 83 letters. Loop has 38 letters. [2022-02-21 03:25:46,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:46,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:46,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:46,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:46,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:46,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:46,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:46,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 81 letters. Loop has 38 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 49 letters. Loop has 4 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:46,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:46,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:46,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:46,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:46,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 76 letters. Loop has 38 letters. [2022-02-21 03:25:46,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:46,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:46,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 77 letters. Loop has 38 letters. [2022-02-21 03:25:46,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:46,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:46,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 78 letters. Loop has 38 letters. [2022-02-21 03:25:46,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:46,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:46,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 38 letters. [2022-02-21 03:25:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 80 letters. Loop has 38 letters. [2022-02-21 03:25:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 113 letters. Loop has 38 letters. [2022-02-21 03:25:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 221 states and 302 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 294 states and 381 transitions. cyclomatic complexity: 91 Stem has 79 letters. Loop has 42 letters. [2022-02-21 03:25:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,278 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:25:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-21 03:25:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 46 letters. Loop has 4 letters. [2022-02-21 03:25:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2022-02-21 03:25:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 46 letters. Loop has 8 letters. [2022-02-21 03:25:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:46,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 381 transitions. cyclomatic complexity: 91 [2022-02-21 03:25:46,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:46,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 239 states and 324 transitions. [2022-02-21 03:25:46,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2022-02-21 03:25:46,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-02-21 03:25:46,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 239 states and 324 transitions. [2022-02-21 03:25:46,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:46,293 INFO L681 BuchiCegarLoop]: Abstraction has 239 states and 324 transitions. [2022-02-21 03:25:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states and 324 transitions. [2022-02-21 03:25:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-02-21 03:25:46,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:46,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states and 324 transitions. Second operand has 233 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 153 states have internal predecessors, (164), 48 states have call successors, (56), 29 states have call predecessors, (56), 37 states have return successors, (97), 50 states have call predecessors, (97), 46 states have call successors, (97) [2022-02-21 03:25:46,300 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states and 324 transitions. Second operand has 233 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 153 states have internal predecessors, (164), 48 states have call successors, (56), 29 states have call predecessors, (56), 37 states have return successors, (97), 50 states have call predecessors, (97), 46 states have call successors, (97) [2022-02-21 03:25:46,300 INFO L87 Difference]: Start difference. First operand 239 states and 324 transitions. Second operand has 233 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 153 states have internal predecessors, (164), 48 states have call successors, (56), 29 states have call predecessors, (56), 37 states have return successors, (97), 50 states have call predecessors, (97), 46 states have call successors, (97) [2022-02-21 03:25:46,300 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:46,334 INFO L93 Difference]: Finished difference Result 847 states and 1149 transitions. [2022-02-21 03:25:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1149 transitions. [2022-02-21 03:25:46,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:46,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:46,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 153 states have internal predecessors, (164), 48 states have call successors, (56), 29 states have call predecessors, (56), 37 states have return successors, (97), 50 states have call predecessors, (97), 46 states have call successors, (97) Second operand 239 states and 324 transitions. [2022-02-21 03:25:46,338 INFO L87 Difference]: Start difference. First operand has 233 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 153 states have internal predecessors, (164), 48 states have call successors, (56), 29 states have call predecessors, (56), 37 states have return successors, (97), 50 states have call predecessors, (97), 46 states have call successors, (97) Second operand 239 states and 324 transitions. [2022-02-21 03:25:46,338 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:46,386 INFO L93 Difference]: Finished difference Result 847 states and 1149 transitions. [2022-02-21 03:25:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1149 transitions. [2022-02-21 03:25:46,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:46,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:46,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:46,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 153 states have internal predecessors, (164), 48 states have call successors, (56), 29 states have call predecessors, (56), 37 states have return successors, (97), 50 states have call predecessors, (97), 46 states have call successors, (97) [2022-02-21 03:25:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2022-02-21 03:25:46,395 INFO L704 BuchiCegarLoop]: Abstraction has 233 states and 317 transitions. [2022-02-21 03:25:46,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:46,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:25:46,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:25:46,395 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 16 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 8 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:25:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:46,773 INFO L93 Difference]: Finished difference Result 284 states and 367 transitions. [2022-02-21 03:25:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:25:46,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 8 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:25:46,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:46,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 367 transitions. [2022-02-21 03:25:46,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:46,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 238 states and 299 transitions. [2022-02-21 03:25:46,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-02-21 03:25:46,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2022-02-21 03:25:46,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 299 transitions. [2022-02-21 03:25:46,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:46,833 INFO L681 BuchiCegarLoop]: Abstraction has 238 states and 299 transitions. [2022-02-21 03:25:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 299 transitions. [2022-02-21 03:25:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 216. [2022-02-21 03:25:46,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:46,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states and 299 transitions. Second operand has 216 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 145 states have internal predecessors, (155), 42 states have call successors, (42), 28 states have call predecessors, (42), 35 states have return successors, (67), 42 states have call predecessors, (67), 39 states have call successors, (67) [2022-02-21 03:25:46,837 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states and 299 transitions. Second operand has 216 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 145 states have internal predecessors, (155), 42 states have call successors, (42), 28 states have call predecessors, (42), 35 states have return successors, (67), 42 states have call predecessors, (67), 39 states have call successors, (67) [2022-02-21 03:25:46,838 INFO L87 Difference]: Start difference. First operand 238 states and 299 transitions. Second operand has 216 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 145 states have internal predecessors, (155), 42 states have call successors, (42), 28 states have call predecessors, (42), 35 states have return successors, (67), 42 states have call predecessors, (67), 39 states have call successors, (67) [2022-02-21 03:25:46,838 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:46,858 INFO L93 Difference]: Finished difference Result 617 states and 801 transitions. [2022-02-21 03:25:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 801 transitions. [2022-02-21 03:25:46,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:46,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:46,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 145 states have internal predecessors, (155), 42 states have call successors, (42), 28 states have call predecessors, (42), 35 states have return successors, (67), 42 states have call predecessors, (67), 39 states have call successors, (67) Second operand 238 states and 299 transitions. [2022-02-21 03:25:46,861 INFO L87 Difference]: Start difference. First operand has 216 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 145 states have internal predecessors, (155), 42 states have call successors, (42), 28 states have call predecessors, (42), 35 states have return successors, (67), 42 states have call predecessors, (67), 39 states have call successors, (67) Second operand 238 states and 299 transitions. [2022-02-21 03:25:46,861 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:46,882 INFO L93 Difference]: Finished difference Result 617 states and 801 transitions. [2022-02-21 03:25:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 801 transitions. [2022-02-21 03:25:46,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:46,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:46,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:46,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 145 states have internal predecessors, (155), 42 states have call successors, (42), 28 states have call predecessors, (42), 35 states have return successors, (67), 42 states have call predecessors, (67), 39 states have call successors, (67) [2022-02-21 03:25:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2022-02-21 03:25:46,889 INFO L704 BuchiCegarLoop]: Abstraction has 216 states and 264 transitions. [2022-02-21 03:25:46,889 INFO L587 BuchiCegarLoop]: Abstraction has 216 states and 264 transitions. [2022-02-21 03:25:46,889 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:25:46,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 264 transitions. [2022-02-21 03:25:46,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:46,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:46,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:46,890 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:25:46,890 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 5, 4, 4, 3, 3, 2, 2, 2, 1] [2022-02-21 03:25:46,890 INFO L791 eck$LassoCheckResult]: Stem: 15425#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 15426#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 15432#L29 assume !(main_~x~0#1 < 1); 15433#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 15438#fibonacciENTRY ~n := #in~n; 15472#L17 assume !(~n < 1); 15471#L19 assume !(1 == ~n); 15464#L22 call #t~ret4 := fibonacci(~n - 1);< 15470#fibonacciENTRY ~n := #in~n; 15515#L17 assume !(~n < 1); 15473#L19 assume !(1 == ~n); 15463#L22 call #t~ret4 := fibonacci(~n - 1);< 15467#fibonacciENTRY ~n := #in~n; 15512#L17 assume !(~n < 1); 15510#L19 assume !(1 == ~n); 15465#L22 call #t~ret4 := fibonacci(~n - 1);< 15467#fibonacciENTRY ~n := #in~n; 15513#L17 assume !(~n < 1); 15548#L19 assume 1 == ~n;#res := 1; 15514#fibonacciFINAL assume true; 15508#fibonacciEXIT >#34#return; 15506#L22-1 call #t~ret5 := fibonacci(~n - 2);< 15507#fibonacciENTRY ~n := #in~n; 15547#L17 assume ~n < 1;#res := 0; 15545#fibonacciFINAL assume true; 15505#fibonacciEXIT >#36#return; 15504#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 15503#fibonacciFINAL assume true; 15488#fibonacciEXIT >#34#return; 15482#L22-1 call #t~ret5 := fibonacci(~n - 2);< 15486#fibonacciENTRY ~n := #in~n; 15511#L17 assume !(~n < 1); 15489#L19 assume 1 == ~n;#res := 1; 15487#fibonacciFINAL assume true; 15481#fibonacciEXIT >#36#return; 15466#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 15469#fibonacciFINAL assume true; 15462#fibonacciEXIT >#34#return; 15454#L22-1 call #t~ret5 := fibonacci(~n - 2);< 15457#fibonacciENTRY ~n := #in~n; 15453#L17 assume !(~n < 1); 15456#L19 assume !(1 == ~n); 15423#L22 call #t~ret4 := fibonacci(~n - 1);< 15499#fibonacciENTRY ~n := #in~n; 15517#L17 assume !(~n < 1); 15611#L19 assume !(1 == ~n); 15421#L22 [2022-02-21 03:25:46,890 INFO L793 eck$LassoCheckResult]: Loop: 15421#L22 call #t~ret4 := fibonacci(~n - 1);< 15422#fibonacciENTRY ~n := #in~n; 15592#L17 assume !(~n < 1); 15590#L19 assume !(1 == ~n); 15428#L22 call #t~ret4 := fibonacci(~n - 1);< 15422#fibonacciENTRY ~n := #in~n; 15592#L17 assume !(~n < 1); 15590#L19 assume !(1 == ~n); 15428#L22 call #t~ret4 := fibonacci(~n - 1);< 15422#fibonacciENTRY ~n := #in~n; 15594#L17 assume !(~n < 1); 15596#L19 assume 1 == ~n;#res := 1; 15597#fibonacciFINAL assume true; 15606#fibonacciEXIT >#34#return; 15601#L22-1 call #t~ret5 := fibonacci(~n - 2);< 15602#fibonacciENTRY ~n := #in~n; 15605#L17 assume ~n < 1;#res := 0; 15604#fibonacciFINAL assume true; 15600#fibonacciEXIT >#36#return; 15598#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 15595#fibonacciFINAL assume true; 15588#fibonacciEXIT >#34#return; 15440#L22-1 call #t~ret5 := fibonacci(~n - 2);< 15603#fibonacciENTRY ~n := #in~n; 15599#L17 assume !(~n < 1); 15439#L19 assume 1 == ~n;#res := 1; 15441#fibonacciFINAL assume true; 15617#fibonacciEXIT >#36#return; 15434#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 15435#fibonacciFINAL assume true; 15427#fibonacciEXIT >#34#return; 15407#L22-1 call #t~ret5 := fibonacci(~n - 2);< 15452#fibonacciENTRY ~n := #in~n; 15451#L17 assume !(~n < 1); 15450#L19 assume !(1 == ~n); 15419#L22 call #t~ret4 := fibonacci(~n - 1);< 15420#fibonacciENTRY ~n := #in~n; 15517#L17 assume !(~n < 1); 15611#L19 assume !(1 == ~n); 15421#L22 [2022-02-21 03:25:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -988239140, now seen corresponding path program 4 times [2022-02-21 03:25:46,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:46,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949083850] [2022-02-21 03:25:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:25:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:47,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} assume true; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,023 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17799#(<= |fibonacci_#in~n| 1)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:47,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {17764#true} assume ~n < 1;#res := 0; {17764#true} is VALID [2022-02-21 03:25:47,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17764#true} {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,032 INFO L272 TraceCheckUtils]: 3: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} assume true; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,034 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {17799#(<= |fibonacci_#in~n| 1)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,034 INFO L272 TraceCheckUtils]: 9: Hoare triple {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {17764#true} assume ~n < 1;#res := 0; {17764#true} is VALID [2022-02-21 03:25:47,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,035 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17764#true} {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} assume true; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,037 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17797#(<= |fibonacci_#in~n| 2)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 03:25:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:47,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:47,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {17764#true} assume 1 == ~n;#res := 1; {17764#true} is VALID [2022-02-21 03:25:47,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,044 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17764#true} {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,045 INFO L272 TraceCheckUtils]: 3: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,047 INFO L272 TraceCheckUtils]: 7: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} assume true; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,049 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17799#(<= |fibonacci_#in~n| 1)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,049 INFO L272 TraceCheckUtils]: 13: Hoare triple {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {17764#true} assume ~n < 1;#res := 0; {17764#true} is VALID [2022-02-21 03:25:47,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,050 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17764#true} {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} assume true; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,051 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17797#(<= |fibonacci_#in~n| 2)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,051 INFO L272 TraceCheckUtils]: 21: Hoare triple {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:47,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {17764#true} assume 1 == ~n;#res := 1; {17764#true} is VALID [2022-02-21 03:25:47,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,052 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17764#true} {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} assume true; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,053 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {17826#(<= |fibonacci_#in~n| 3)} {17764#true} #34#return; {17796#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:47,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {17764#true} is VALID [2022-02-21 03:25:47,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {17764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {17764#true} is VALID [2022-02-21 03:25:47,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {17764#true} assume !(main_~x~0#1 < 1); {17764#true} is VALID [2022-02-21 03:25:47,053 INFO L272 TraceCheckUtils]: 3: Hoare triple {17764#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {17764#true} is VALID [2022-02-21 03:25:47,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:47,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {17764#true} assume !(1 == ~n); {17764#true} is VALID [2022-02-21 03:25:47,054 INFO L272 TraceCheckUtils]: 7: Hoare triple {17764#true} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,056 INFO L272 TraceCheckUtils]: 15: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {17764#true} ~n := #in~n; {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {17802#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:47,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {17802#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} assume true; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,058 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17799#(<= |fibonacci_#in~n| 1)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,058 INFO L272 TraceCheckUtils]: 21: Hoare triple {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {17764#true} assume ~n < 1;#res := 0; {17764#true} is VALID [2022-02-21 03:25:47,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,059 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17764#true} {17832#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} assume true; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,060 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17797#(<= |fibonacci_#in~n| 2)} {17802#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:47,060 INFO L272 TraceCheckUtils]: 29: Hoare triple {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:47,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {17764#true} assume 1 == ~n;#res := 1; {17764#true} is VALID [2022-02-21 03:25:47,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,061 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17764#true} {17820#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} assume true; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,062 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17826#(<= |fibonacci_#in~n| 3)} {17764#true} #34#return; {17796#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:47,063 INFO L272 TraceCheckUtils]: 38: Hoare triple {17796#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:47,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {17798#(<= fibonacci_~n 2)} assume !(~n < 1); {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:47,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {17798#(<= fibonacci_~n 2)} assume !(1 == ~n); {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:47,064 INFO L272 TraceCheckUtils]: 42: Hoare triple {17798#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {17800#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:47,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {17800#(<= fibonacci_~n 1)} assume !(~n < 1); {17801#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:47,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {17801#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {17765#false} is VALID [2022-02-21 03:25:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-21 03:25:47,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:47,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949083850] [2022-02-21 03:25:47,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949083850] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:47,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766580247] [2022-02-21 03:25:47,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:25:47,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:47,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:47,072 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:47,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-02-21 03:25:47,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:25:47,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:47,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:25:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:47,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:47,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {17764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {17764#true} assume !(main_~x~0#1 < 1); {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L272 TraceCheckUtils]: 3: Hoare triple {17764#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {17764#true} assume !(1 == ~n); {17764#true} is VALID [2022-02-21 03:25:47,286 INFO L272 TraceCheckUtils]: 7: Hoare triple {17764#true} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {17764#true} ~n := #in~n; {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,287 INFO L272 TraceCheckUtils]: 11: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#true} ~n := #in~n; {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,288 INFO L272 TraceCheckUtils]: 15: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:47,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {17764#true} ~n := #in~n; {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {17864#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:47,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {17864#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} assume true; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,300 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17799#(<= |fibonacci_#in~n| 1)} {17864#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,300 INFO L272 TraceCheckUtils]: 21: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {17764#true} assume ~n < 1;#res := 0; {17764#true} is VALID [2022-02-21 03:25:47,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,301 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17764#true} {17797#(<= |fibonacci_#in~n| 2)} #36#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} assume true; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,302 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17797#(<= |fibonacci_#in~n| 2)} {17864#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,302 INFO L272 TraceCheckUtils]: 29: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:47,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:47,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:47,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {17764#true} assume 1 == ~n;#res := 1; {17764#true} is VALID [2022-02-21 03:25:47,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:47,303 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17764#true} {17826#(<= |fibonacci_#in~n| 3)} #36#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} assume true; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:47,304 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17826#(<= |fibonacci_#in~n| 3)} {17764#true} #34#return; {17796#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:47,304 INFO L272 TraceCheckUtils]: 38: Hoare triple {17796#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:47,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:47,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {17798#(<= fibonacci_~n 2)} assume !(~n < 1); {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:47,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {17798#(<= fibonacci_~n 2)} assume !(1 == ~n); {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:47,306 INFO L272 TraceCheckUtils]: 42: Hoare triple {17798#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:47,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {17800#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:47,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {17800#(<= fibonacci_~n 1)} assume !(~n < 1); {17801#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:47,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {17801#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {17765#false} is VALID [2022-02-21 03:25:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-21 03:25:47,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:48,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {17801#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {17765#false} is VALID [2022-02-21 03:25:48,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {17800#(<= fibonacci_~n 1)} assume !(~n < 1); {17801#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:48,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {17800#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:48,079 INFO L272 TraceCheckUtils]: 42: Hoare triple {17798#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {17798#(<= fibonacci_~n 2)} assume !(1 == ~n); {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {17798#(<= fibonacci_~n 2)} assume !(~n < 1); {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {17798#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,080 INFO L272 TraceCheckUtils]: 38: Hoare triple {17796#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,081 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17826#(<= |fibonacci_#in~n| 3)} {17764#true} #34#return; {17796#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:48,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} assume true; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,082 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17764#true} {17826#(<= |fibonacci_#in~n| 3)} #36#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:48,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {17764#true} assume 1 == ~n;#res := 1; {17764#true} is VALID [2022-02-21 03:25:48,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:48,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:48,082 INFO L272 TraceCheckUtils]: 29: Hoare triple {17826#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:48,083 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17797#(<= |fibonacci_#in~n| 2)} {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #34#return; {17826#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} assume true; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,084 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17764#true} {17797#(<= |fibonacci_#in~n| 2)} #36#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {17764#true} assume true; {17764#true} is VALID [2022-02-21 03:25:48,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {17764#true} assume ~n < 1;#res := 0; {17764#true} is VALID [2022-02-21 03:25:48,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:48,084 INFO L272 TraceCheckUtils]: 21: Hoare triple {17797#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {17764#true} is VALID [2022-02-21 03:25:48,085 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17799#(<= |fibonacci_#in~n| 1)} {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #34#return; {17797#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {17799#(<= |fibonacci_#in~n| 1)} assume true; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {18068#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {17799#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {18068#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {18068#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:48,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {17764#true} ~n := #in~n; {18068#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:48,086 INFO L272 TraceCheckUtils]: 15: Hoare triple {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:48,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:48,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:48,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#true} ~n := #in~n; {18058#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:48,088 INFO L272 TraceCheckUtils]: 11: Hoare triple {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:48,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:25:48,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:25:48,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {17764#true} ~n := #in~n; {18030#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:25:48,089 INFO L272 TraceCheckUtils]: 7: Hoare triple {17764#true} call #t~ret4 := fibonacci(~n - 1); {17764#true} is VALID [2022-02-21 03:25:48,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {17764#true} assume !(1 == ~n); {17764#true} is VALID [2022-02-21 03:25:48,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {17764#true} assume !(~n < 1); {17764#true} is VALID [2022-02-21 03:25:48,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {17764#true} ~n := #in~n; {17764#true} is VALID [2022-02-21 03:25:48,089 INFO L272 TraceCheckUtils]: 3: Hoare triple {17764#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {17764#true} is VALID [2022-02-21 03:25:48,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {17764#true} assume !(main_~x~0#1 < 1); {17764#true} is VALID [2022-02-21 03:25:48,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {17764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {17764#true} is VALID [2022-02-21 03:25:48,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {17764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {17764#true} is VALID [2022-02-21 03:25:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-21 03:25:48,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766580247] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:48,090 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:48,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 15 [2022-02-21 03:25:48,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770620681] [2022-02-21 03:25:48,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:48,091 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:25:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -471765365, now seen corresponding path program 2 times [2022-02-21 03:25:48,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:48,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946040665] [2022-02-21 03:25:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-21 03:25:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} assume true; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,194 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18146#(<= |fibonacci_#in~n| 1)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {18111#true} assume ~n < 1;#res := 0; {18111#true} is VALID [2022-02-21 03:25:48,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18111#true} {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,210 INFO L272 TraceCheckUtils]: 3: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} assume true; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,212 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18146#(<= |fibonacci_#in~n| 1)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,212 INFO L272 TraceCheckUtils]: 9: Hoare triple {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {18111#true} assume ~n < 1;#res := 0; {18111#true} is VALID [2022-02-21 03:25:48,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,213 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18111#true} {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} assume true; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18144#(<= |fibonacci_#in~n| 2)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 03:25:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {18111#true} assume !(~n < 1); {18111#true} is VALID [2022-02-21 03:25:48,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {18111#true} assume 1 == ~n;#res := 1; {18111#true} is VALID [2022-02-21 03:25:48,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,220 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18111#true} {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,221 INFO L272 TraceCheckUtils]: 3: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,222 INFO L272 TraceCheckUtils]: 7: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} assume true; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,224 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18146#(<= |fibonacci_#in~n| 1)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,224 INFO L272 TraceCheckUtils]: 13: Hoare triple {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {18111#true} assume ~n < 1;#res := 0; {18111#true} is VALID [2022-02-21 03:25:48,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,225 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18111#true} {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} assume true; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,226 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {18144#(<= |fibonacci_#in~n| 2)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,226 INFO L272 TraceCheckUtils]: 21: Hoare triple {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {18111#true} assume !(~n < 1); {18111#true} is VALID [2022-02-21 03:25:48,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {18111#true} assume 1 == ~n;#res := 1; {18111#true} is VALID [2022-02-21 03:25:48,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,227 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18111#true} {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} assume true; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,228 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18173#(<= |fibonacci_#in~n| 3)} {18111#true} #34#return; {18143#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:48,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {18111#true} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,230 INFO L272 TraceCheckUtils]: 8: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {18111#true} ~n := #in~n; {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {18149#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:48,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {18149#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} assume true; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,232 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18146#(<= |fibonacci_#in~n| 1)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {18111#true} assume ~n < 1;#res := 0; {18111#true} is VALID [2022-02-21 03:25:48,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,233 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18111#true} {18179#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} assume true; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,234 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18144#(<= |fibonacci_#in~n| 2)} {18149#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:48,234 INFO L272 TraceCheckUtils]: 22: Hoare triple {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {18111#true} assume !(~n < 1); {18111#true} is VALID [2022-02-21 03:25:48,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {18111#true} assume 1 == ~n;#res := 1; {18111#true} is VALID [2022-02-21 03:25:48,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,235 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18111#true} {18167#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} assume true; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,236 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18173#(<= |fibonacci_#in~n| 3)} {18111#true} #34#return; {18143#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:48,237 INFO L272 TraceCheckUtils]: 31: Hoare triple {18143#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {18145#(<= fibonacci_~n 2)} assume !(~n < 1); {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {18145#(<= fibonacci_~n 2)} assume !(1 == ~n); {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,238 INFO L272 TraceCheckUtils]: 35: Hoare triple {18145#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {18147#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:48,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {18147#(<= fibonacci_~n 1)} assume !(~n < 1); {18148#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:48,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {18148#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {18112#false} is VALID [2022-02-21 03:25:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 39 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-21 03:25:48,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:48,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946040665] [2022-02-21 03:25:48,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946040665] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:48,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119871393] [2022-02-21 03:25:48,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:25:48,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:48,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:48,241 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:48,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-02-21 03:25:48,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:25:48,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:48,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:25:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:48,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:48,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {18111#true} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {18111#true} ~n := #in~n; {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {18111#true} ~n := #in~n; {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,498 INFO L272 TraceCheckUtils]: 8: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:48,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {18111#true} ~n := #in~n; {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {18190#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:48,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {18190#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} assume true; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,500 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18146#(<= |fibonacci_#in~n| 1)} {18190#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,500 INFO L272 TraceCheckUtils]: 14: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {18111#true} assume ~n < 1;#res := 0; {18111#true} is VALID [2022-02-21 03:25:48,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,501 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18111#true} {18144#(<= |fibonacci_#in~n| 2)} #36#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} assume true; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,502 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18144#(<= |fibonacci_#in~n| 2)} {18190#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,502 INFO L272 TraceCheckUtils]: 22: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:48,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:48,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {18111#true} assume !(~n < 1); {18111#true} is VALID [2022-02-21 03:25:48,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {18111#true} assume 1 == ~n;#res := 1; {18111#true} is VALID [2022-02-21 03:25:48,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:48,502 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18111#true} {18173#(<= |fibonacci_#in~n| 3)} #36#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} assume true; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:48,503 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18173#(<= |fibonacci_#in~n| 3)} {18111#true} #34#return; {18143#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:48,504 INFO L272 TraceCheckUtils]: 31: Hoare triple {18143#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:48,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {18145#(<= fibonacci_~n 2)} assume !(~n < 1); {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {18145#(<= fibonacci_~n 2)} assume !(1 == ~n); {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:48,505 INFO L272 TraceCheckUtils]: 35: Hoare triple {18145#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:48,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {18147#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:48,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {18147#(<= fibonacci_~n 1)} assume !(~n < 1); {18148#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:48,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {18148#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {18112#false} is VALID [2022-02-21 03:25:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 39 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-21 03:25:48,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:49,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {18148#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} assume !(1 == ~n); {18112#false} is VALID [2022-02-21 03:25:49,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {18147#(<= fibonacci_~n 1)} assume !(~n < 1); {18148#(and (<= fibonacci_~n 1) (< 0 fibonacci_~n))} is VALID [2022-02-21 03:25:49,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {18147#(<= fibonacci_~n 1)} is VALID [2022-02-21 03:25:49,319 INFO L272 TraceCheckUtils]: 35: Hoare triple {18145#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {18145#(<= fibonacci_~n 2)} assume !(1 == ~n); {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:49,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {18145#(<= fibonacci_~n 2)} assume !(~n < 1); {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:49,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {18145#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:49,320 INFO L272 TraceCheckUtils]: 31: Hoare triple {18143#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,320 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18173#(<= |fibonacci_#in~n| 3)} {18111#true} #34#return; {18143#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:49,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} assume true; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:49,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:49,321 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18111#true} {18173#(<= |fibonacci_#in~n| 3)} #36#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:49,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:49,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {18111#true} assume 1 == ~n;#res := 1; {18111#true} is VALID [2022-02-21 03:25:49,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {18111#true} assume !(~n < 1); {18111#true} is VALID [2022-02-21 03:25:49,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:49,324 INFO L272 TraceCheckUtils]: 22: Hoare triple {18173#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:49,325 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18144#(<= |fibonacci_#in~n| 2)} {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #34#return; {18173#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:49,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} assume true; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,325 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18111#true} {18144#(<= |fibonacci_#in~n| 2)} #36#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {18111#true} assume true; {18111#true} is VALID [2022-02-21 03:25:49,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {18111#true} assume ~n < 1;#res := 0; {18111#true} is VALID [2022-02-21 03:25:49,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {18111#true} ~n := #in~n; {18111#true} is VALID [2022-02-21 03:25:49,334 INFO L272 TraceCheckUtils]: 14: Hoare triple {18144#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {18111#true} is VALID [2022-02-21 03:25:49,336 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {18146#(<= |fibonacci_#in~n| 1)} {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #34#return; {18144#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {18146#(<= |fibonacci_#in~n| 1)} assume true; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {18394#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {18146#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {18394#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {18394#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:49,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {18111#true} ~n := #in~n; {18394#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:25:49,340 INFO L272 TraceCheckUtils]: 8: Hoare triple {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:49,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:49,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:49,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {18111#true} ~n := #in~n; {18384#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:49,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:49,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:25:49,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:25:49,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {18111#true} ~n := #in~n; {18356#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:25:49,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {18111#true} call #t~ret4 := fibonacci(~n - 1); {18111#true} is VALID [2022-02-21 03:25:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:25:49,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119871393] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:49,342 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:49,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 15 [2022-02-21 03:25:49,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164817173] [2022-02-21 03:25:49,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:49,343 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:49,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:49,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:25:49,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:25:49,344 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. cyclomatic complexity: 52 Second operand has 16 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-21 03:25:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:49,625 INFO L93 Difference]: Finished difference Result 300 states and 397 transitions. [2022-02-21 03:25:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:25:49,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-21 03:25:49,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:49,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 397 transitions. [2022-02-21 03:25:49,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:49,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 288 states and 379 transitions. [2022-02-21 03:25:49,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2022-02-21 03:25:49,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2022-02-21 03:25:49,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 379 transitions. [2022-02-21 03:25:49,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:49,700 INFO L681 BuchiCegarLoop]: Abstraction has 288 states and 379 transitions. [2022-02-21 03:25:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 379 transitions. [2022-02-21 03:25:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 260. [2022-02-21 03:25:49,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:49,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states and 379 transitions. Second operand has 260 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 169 states have internal predecessors, (189), 53 states have call successors, (53), 36 states have call predecessors, (53), 40 states have return successors, (95), 54 states have call predecessors, (95), 50 states have call successors, (95) [2022-02-21 03:25:49,706 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states and 379 transitions. Second operand has 260 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 169 states have internal predecessors, (189), 53 states have call successors, (53), 36 states have call predecessors, (53), 40 states have return successors, (95), 54 states have call predecessors, (95), 50 states have call successors, (95) [2022-02-21 03:25:49,706 INFO L87 Difference]: Start difference. First operand 288 states and 379 transitions. Second operand has 260 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 169 states have internal predecessors, (189), 53 states have call successors, (53), 36 states have call predecessors, (53), 40 states have return successors, (95), 54 states have call predecessors, (95), 50 states have call successors, (95) [2022-02-21 03:25:49,706 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:49,738 INFO L93 Difference]: Finished difference Result 800 states and 1056 transitions. [2022-02-21 03:25:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1056 transitions. [2022-02-21 03:25:49,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:49,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:49,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 169 states have internal predecessors, (189), 53 states have call successors, (53), 36 states have call predecessors, (53), 40 states have return successors, (95), 54 states have call predecessors, (95), 50 states have call successors, (95) Second operand 288 states and 379 transitions. [2022-02-21 03:25:49,742 INFO L87 Difference]: Start difference. First operand has 260 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 169 states have internal predecessors, (189), 53 states have call successors, (53), 36 states have call predecessors, (53), 40 states have return successors, (95), 54 states have call predecessors, (95), 50 states have call successors, (95) Second operand 288 states and 379 transitions. [2022-02-21 03:25:49,742 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:49,774 INFO L93 Difference]: Finished difference Result 802 states and 1057 transitions. [2022-02-21 03:25:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1057 transitions. [2022-02-21 03:25:49,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:49,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:49,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:49,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 169 states have internal predecessors, (189), 53 states have call successors, (53), 36 states have call predecessors, (53), 40 states have return successors, (95), 54 states have call predecessors, (95), 50 states have call successors, (95) [2022-02-21 03:25:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 337 transitions. [2022-02-21 03:25:49,784 INFO L704 BuchiCegarLoop]: Abstraction has 260 states and 337 transitions. [2022-02-21 03:25:49,784 INFO L587 BuchiCegarLoop]: Abstraction has 260 states and 337 transitions. [2022-02-21 03:25:49,784 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:25:49,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 337 transitions. [2022-02-21 03:25:49,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:49,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:49,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:49,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 9, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1] [2022-02-21 03:25:49,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 9, 9, 6, 6, 5, 5, 4, 4, 3, 2] [2022-02-21 03:25:49,787 INFO L791 eck$LassoCheckResult]: Stem: 18749#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 18750#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 18754#L29 assume !(main_~x~0#1 < 1); 18755#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 18762#fibonacciENTRY ~n := #in~n; 18796#L17 assume !(~n < 1); 18795#L19 assume !(1 == ~n); 18787#L22 call #t~ret4 := fibonacci(~n - 1);< 18794#fibonacciENTRY ~n := #in~n; 18835#L17 assume !(~n < 1); 18832#L19 assume !(1 == ~n); 18789#L22 call #t~ret4 := fibonacci(~n - 1);< 18791#fibonacciENTRY ~n := #in~n; 18834#L17 assume !(~n < 1); 18797#L19 assume !(1 == ~n); 18788#L22 call #t~ret4 := fibonacci(~n - 1);< 18791#fibonacciENTRY ~n := #in~n; 18834#L17 assume !(~n < 1); 18797#L19 assume !(1 == ~n); 18788#L22 call #t~ret4 := fibonacci(~n - 1);< 18791#fibonacciENTRY ~n := #in~n; 18839#L17 assume !(~n < 1); 18844#L19 assume 1 == ~n;#res := 1; 18843#fibonacciFINAL assume true; 18841#fibonacciEXIT >#34#return; 18837#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18838#fibonacciENTRY ~n := #in~n; 18842#L17 assume ~n < 1;#res := 0; 18840#fibonacciFINAL assume true; 18836#fibonacciEXIT >#36#return; 18833#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18831#fibonacciFINAL assume true; 18830#fibonacciEXIT >#34#return; 18823#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18825#fibonacciENTRY ~n := #in~n; 18900#L17 assume !(~n < 1); 18897#L19 assume 1 == ~n;#res := 1; 18775#fibonacciFINAL assume true; 18822#fibonacciEXIT >#36#return; 18813#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18810#fibonacciFINAL assume true; 18806#fibonacciEXIT >#34#return; 18805#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18808#fibonacciENTRY ~n := #in~n; 18899#L17 assume !(~n < 1); 18896#L19 assume !(1 == ~n); 18827#L22 call #t~ret4 := fibonacci(~n - 1);< 18916#fibonacciENTRY ~n := #in~n; 18902#L17 assume !(~n < 1); 18861#L19 assume 1 == ~n;#res := 1; 18855#fibonacciFINAL assume true; 18826#fibonacciEXIT >#34#return; 18816#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18819#fibonacciENTRY ~n := #in~n; 18887#L17 assume ~n < 1;#res := 0; 18886#fibonacciFINAL assume true; 18815#fibonacciEXIT >#36#return; 18812#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18809#fibonacciFINAL assume true; 18804#fibonacciEXIT >#36#return; 18790#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18793#fibonacciFINAL assume true; 18786#fibonacciEXIT >#34#return; 18774#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18780#fibonacciENTRY ~n := #in~n; 18781#L17 assume !(~n < 1); 18772#L19 assume !(1 == ~n); 18744#L22 call #t~ret4 := fibonacci(~n - 1);< 18829#fibonacciENTRY ~n := #in~n; 18951#L17 assume !(~n < 1); 18958#L19 assume !(1 == ~n); 18742#L22 [2022-02-21 03:25:49,787 INFO L793 eck$LassoCheckResult]: Loop: 18742#L22 call #t~ret4 := fibonacci(~n - 1);< 18745#fibonacciENTRY ~n := #in~n; 18948#L17 assume !(~n < 1); 18942#L19 assume !(1 == ~n); 18943#L22 call #t~ret4 := fibonacci(~n - 1);< 18745#fibonacciENTRY ~n := #in~n; 18948#L17 assume !(~n < 1); 18942#L19 assume !(1 == ~n); 18943#L22 call #t~ret4 := fibonacci(~n - 1);< 18745#fibonacciENTRY ~n := #in~n; 18948#L17 assume !(~n < 1); 18942#L19 assume !(1 == ~n); 18943#L22 call #t~ret4 := fibonacci(~n - 1);< 18745#fibonacciENTRY ~n := #in~n; 18953#L17 assume !(~n < 1); 18979#L19 assume 1 == ~n;#res := 1; 18977#fibonacciFINAL assume true; 18976#fibonacciEXIT >#34#return; 18974#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18975#fibonacciENTRY ~n := #in~n; 18980#L17 assume ~n < 1;#res := 0; 18978#fibonacciFINAL assume true; 18973#fibonacciEXIT >#36#return; 18972#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18967#fibonacciFINAL assume true; 18965#fibonacciEXIT >#34#return; 18962#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18963#fibonacciENTRY ~n := #in~n; 18968#L17 assume !(~n < 1); 18966#L19 assume 1 == ~n;#res := 1; 18771#fibonacciFINAL assume true; 18961#fibonacciEXIT >#36#return; 18960#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18959#fibonacciFINAL assume true; 18957#fibonacciEXIT >#34#return; 18729#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18956#fibonacciENTRY ~n := #in~n; 18955#L17 assume !(~n < 1); 18954#L19 assume !(1 == ~n); 18736#L22 call #t~ret4 := fibonacci(~n - 1);< 18741#fibonacciENTRY ~n := #in~n; 18735#L17 assume !(~n < 1); 18737#L19 assume 1 == ~n;#res := 1; 18763#fibonacciFINAL assume true; 18751#fibonacciEXIT >#34#return; 18726#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18730#fibonacciENTRY ~n := #in~n; 18981#L17 assume ~n < 1;#res := 0; 18767#fibonacciFINAL assume true; 18768#fibonacciEXIT >#36#return; 18756#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18757#fibonacciFINAL assume true; 18971#fibonacciEXIT >#36#return; 18970#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 18969#fibonacciFINAL assume true; 18964#fibonacciEXIT >#34#return; 18728#L22-1 call #t~ret5 := fibonacci(~n - 2);< 18914#fibonacciENTRY ~n := #in~n; 18901#L17 assume !(~n < 1); 18770#L19 assume !(1 == ~n); 18738#L22 call #t~ret4 := fibonacci(~n - 1);< 18952#fibonacciENTRY ~n := #in~n; 18951#L17 assume !(~n < 1); 18958#L19 assume !(1 == ~n); 18742#L22 [2022-02-21 03:25:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -48032558, now seen corresponding path program 5 times [2022-02-21 03:25:49,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:49,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593359465] [2022-02-21 03:25:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:49,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:49,809 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1564181507, now seen corresponding path program 3 times [2022-02-21 03:25:49,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:49,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684675925] [2022-02-21 03:25:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:49,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:49,825 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:49,826 INFO L85 PathProgramCache]: Analyzing trace with hash 823103700, now seen corresponding path program 6 times [2022-02-21 03:25:49,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:49,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868413926] [2022-02-21 03:25:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:25:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {22029#(<= |fibonacci_#in~n| 1)} assume true; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,982 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22029#(<= |fibonacci_#in~n| 1)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:49,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:49,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:49,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21829#true} {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,988 INFO L272 TraceCheckUtils]: 3: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:49,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {22029#(<= |fibonacci_#in~n| 1)} assume true; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:49,990 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22029#(<= |fibonacci_#in~n| 1)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:49,991 INFO L272 TraceCheckUtils]: 9: Hoare triple {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:49,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:49,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:49,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:49,992 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21829#true} {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} assume true; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:49,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21889#(<= |fibonacci_#in~n| 2)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 03:25:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:49,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:49,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:49,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:49,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:49,998 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21829#true} {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:49,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:49,999 INFO L272 TraceCheckUtils]: 3: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,000 INFO L272 TraceCheckUtils]: 7: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {22029#(<= |fibonacci_#in~n| 1)} assume true; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,003 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22029#(<= |fibonacci_#in~n| 1)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,003 INFO L272 TraceCheckUtils]: 13: Hoare triple {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,004 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21829#true} {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} assume true; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,005 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21889#(<= |fibonacci_#in~n| 2)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,005 INFO L272 TraceCheckUtils]: 21: Hoare triple {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,007 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21829#true} {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} assume true; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,008 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21887#(<= |fibonacci_#in~n| 3)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 03:25:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,017 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,021 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L272 TraceCheckUtils]: 9: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,023 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,024 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21829#true} {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,025 INFO L272 TraceCheckUtils]: 3: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,026 INFO L272 TraceCheckUtils]: 7: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,027 INFO L272 TraceCheckUtils]: 11: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {22029#(<= |fibonacci_#in~n| 1)} assume true; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,030 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22029#(<= |fibonacci_#in~n| 1)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,031 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21829#true} {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} assume true; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,032 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21889#(<= |fibonacci_#in~n| 2)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,032 INFO L272 TraceCheckUtils]: 25: Hoare triple {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,034 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21829#true} {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} assume true; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,035 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {21887#(<= |fibonacci_#in~n| 3)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,035 INFO L272 TraceCheckUtils]: 34: Hoare triple {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,035 INFO L272 TraceCheckUtils]: 38: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L272 TraceCheckUtils]: 44: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,037 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,038 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21829#true} {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} assume true; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,039 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21995#(<= |fibonacci_#in~n| 4)} {21829#true} #34#return; {21886#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:25:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-02-21 03:25:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,097 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L272 TraceCheckUtils]: 9: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,102 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,102 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 03:25:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L272 TraceCheckUtils]: 7: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L272 TraceCheckUtils]: 13: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,107 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L272 TraceCheckUtils]: 21: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,109 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21829#true} {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 03:25:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:25:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,117 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:25:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,120 INFO L272 TraceCheckUtils]: 9: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,121 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,122 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21829#true} {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {22039#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {22039#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,123 INFO L272 TraceCheckUtils]: 3: Hoare triple {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L272 TraceCheckUtils]: 7: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L272 TraceCheckUtils]: 11: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L272 TraceCheckUtils]: 17: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L272 TraceCheckUtils]: 25: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,127 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {21829#true} {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,127 INFO L272 TraceCheckUtils]: 34: Hoare triple {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L272 TraceCheckUtils]: 38: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L272 TraceCheckUtils]: 44: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,129 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,130 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21829#true} {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {22088#(<= 2 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {22088#(<= 2 |fibonacci_#in~n|)} assume true; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,131 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22088#(<= 2 |fibonacci_#in~n|)} {21890#(<= fibonacci_~n 2)} #34#return; {21830#false} is VALID [2022-02-21 03:25:50,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {21829#true} is VALID [2022-02-21 03:25:50,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {21829#true} is VALID [2022-02-21 03:25:50,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(main_~x~0#1 < 1); {21829#true} is VALID [2022-02-21 03:25:50,131 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {21829#true} is VALID [2022-02-21 03:25:50,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,132 INFO L272 TraceCheckUtils]: 7: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,133 INFO L272 TraceCheckUtils]: 11: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,134 INFO L272 TraceCheckUtils]: 15: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {22029#(<= |fibonacci_#in~n| 1)} assume true; {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,137 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22029#(<= |fibonacci_#in~n| 1)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,137 INFO L272 TraceCheckUtils]: 25: Hoare triple {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,138 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21829#true} {22024#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} assume true; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,139 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21889#(<= |fibonacci_#in~n| 2)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,139 INFO L272 TraceCheckUtils]: 33: Hoare triple {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,140 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21829#true} {22013#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} assume true; {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,141 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21887#(<= |fibonacci_#in~n| 3)} {21946#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,141 INFO L272 TraceCheckUtils]: 42: Hoare triple {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L272 TraceCheckUtils]: 46: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L272 TraceCheckUtils]: 52: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,143 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,144 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21829#true} {21977#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} assume true; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,145 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21995#(<= |fibonacci_#in~n| 4)} {21829#true} #34#return; {21886#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:25:50,145 INFO L272 TraceCheckUtils]: 63: Hoare triple {21886#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:50,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {21888#(<= fibonacci_~n 3)} assume !(~n < 1); {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:50,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {21888#(<= fibonacci_~n 3)} assume !(1 == ~n); {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:50,146 INFO L272 TraceCheckUtils]: 67: Hoare triple {21888#(<= fibonacci_~n 3)} call #t~ret4 := fibonacci(~n - 1); {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,147 INFO L290 TraceCheckUtils]: 69: Hoare triple {21890#(<= fibonacci_~n 2)} assume !(~n < 1); {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,147 INFO L290 TraceCheckUtils]: 70: Hoare triple {21890#(<= fibonacci_~n 2)} assume !(1 == ~n); {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,147 INFO L272 TraceCheckUtils]: 71: Hoare triple {21890#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,147 INFO L290 TraceCheckUtils]: 72: Hoare triple {21829#true} ~n := #in~n; {21946#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {21946#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {22039#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {22039#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,148 INFO L272 TraceCheckUtils]: 75: Hoare triple {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 76: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 77: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 78: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L272 TraceCheckUtils]: 79: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 80: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 81: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,148 INFO L290 TraceCheckUtils]: 82: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L272 TraceCheckUtils]: 83: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 85: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 87: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L272 TraceCheckUtils]: 89: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 90: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 91: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 92: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 95: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L272 TraceCheckUtils]: 97: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 98: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 99: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 100: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 103: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 104: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21829#true} {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:25:50,150 INFO L272 TraceCheckUtils]: 106: Hoare triple {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 107: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L272 TraceCheckUtils]: 110: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 111: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,150 INFO L290 TraceCheckUtils]: 112: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L272 TraceCheckUtils]: 116: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 117: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 118: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 119: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 121: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,151 INFO L290 TraceCheckUtils]: 122: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,152 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {21829#true} {22040#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,152 INFO L290 TraceCheckUtils]: 124: Hoare triple {22088#(<= 2 |fibonacci_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,152 INFO L290 TraceCheckUtils]: 125: Hoare triple {22088#(<= 2 |fibonacci_#in~n|)} assume true; {22088#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:25:50,153 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22088#(<= 2 |fibonacci_#in~n|)} {21890#(<= fibonacci_~n 2)} #34#return; {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L272 TraceCheckUtils]: 127: Hoare triple {21830#false} call #t~ret5 := fibonacci(~n - 2); {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L290 TraceCheckUtils]: 128: Hoare triple {21830#false} ~n := #in~n; {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L290 TraceCheckUtils]: 129: Hoare triple {21830#false} assume !(~n < 1); {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L290 TraceCheckUtils]: 130: Hoare triple {21830#false} assume !(1 == ~n); {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L272 TraceCheckUtils]: 131: Hoare triple {21830#false} call #t~ret4 := fibonacci(~n - 1); {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L290 TraceCheckUtils]: 132: Hoare triple {21830#false} ~n := #in~n; {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L290 TraceCheckUtils]: 133: Hoare triple {21830#false} assume !(~n < 1); {21830#false} is VALID [2022-02-21 03:25:50,153 INFO L290 TraceCheckUtils]: 134: Hoare triple {21830#false} assume !(1 == ~n); {21830#false} is VALID [2022-02-21 03:25:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 267 proven. 348 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2022-02-21 03:25:50,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:50,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868413926] [2022-02-21 03:25:50,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868413926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:50,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062233954] [2022-02-21 03:25:50,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:25:50,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:50,156 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:50,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-02-21 03:25:50,215 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-02-21 03:25:50,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:50,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:25:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:50,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(main_~x~0#1 < 1); {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,691 INFO L272 TraceCheckUtils]: 7: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,693 INFO L272 TraceCheckUtils]: 11: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L272 TraceCheckUtils]: 15: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,693 INFO L272 TraceCheckUtils]: 25: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L272 TraceCheckUtils]: 33: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,695 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21829#true} {22156#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,695 INFO L272 TraceCheckUtils]: 42: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {21829#true} ~n := #in~n; {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,696 INFO L272 TraceCheckUtils]: 46: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,697 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21829#true} {22156#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,697 INFO L272 TraceCheckUtils]: 52: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {21829#true} ~n := #in~n; {22156#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:25:50,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {22156#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {22295#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {22295#(< |fibonacci_#in~n| 1)} assume true; {22295#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,699 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22295#(< |fibonacci_#in~n| 1)} {22156#(<= |fibonacci_#in~n| fibonacci_~n)} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} assume true; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,700 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21889#(<= |fibonacci_#in~n| 2)} {22156#(<= |fibonacci_#in~n| fibonacci_~n)} #36#return; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} assume true; {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:50,701 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21995#(<= |fibonacci_#in~n| 4)} {21829#true} #34#return; {21886#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:25:50,702 INFO L272 TraceCheckUtils]: 63: Hoare triple {21886#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:50,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:50,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {21888#(<= fibonacci_~n 3)} assume !(~n < 1); {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:50,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {21888#(<= fibonacci_~n 3)} assume !(1 == ~n); {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:50,703 INFO L272 TraceCheckUtils]: 67: Hoare triple {21888#(<= fibonacci_~n 3)} call #t~ret4 := fibonacci(~n - 1); {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:50,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {21890#(<= fibonacci_~n 2)} assume !(~n < 1); {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {21890#(<= fibonacci_~n 2)} assume !(1 == ~n); {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,704 INFO L272 TraceCheckUtils]: 71: Hoare triple {21890#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L272 TraceCheckUtils]: 75: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L272 TraceCheckUtils]: 79: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 80: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 81: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,705 INFO L290 TraceCheckUtils]: 82: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L272 TraceCheckUtils]: 83: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L290 TraceCheckUtils]: 85: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L290 TraceCheckUtils]: 86: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L290 TraceCheckUtils]: 87: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L272 TraceCheckUtils]: 89: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L290 TraceCheckUtils]: 90: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,706 INFO L290 TraceCheckUtils]: 91: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L290 TraceCheckUtils]: 92: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L290 TraceCheckUtils]: 94: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L290 TraceCheckUtils]: 95: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L272 TraceCheckUtils]: 97: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L290 TraceCheckUtils]: 98: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L290 TraceCheckUtils]: 101: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L290 TraceCheckUtils]: 103: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L272 TraceCheckUtils]: 106: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L290 TraceCheckUtils]: 107: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L290 TraceCheckUtils]: 108: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,708 INFO L290 TraceCheckUtils]: 109: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L272 TraceCheckUtils]: 110: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L290 TraceCheckUtils]: 111: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L290 TraceCheckUtils]: 112: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L290 TraceCheckUtils]: 113: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L290 TraceCheckUtils]: 114: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L272 TraceCheckUtils]: 116: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L290 TraceCheckUtils]: 117: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:50,709 INFO L290 TraceCheckUtils]: 118: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L290 TraceCheckUtils]: 119: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L290 TraceCheckUtils]: 121: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L290 TraceCheckUtils]: 122: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L290 TraceCheckUtils]: 124: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:50,710 INFO L290 TraceCheckUtils]: 125: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:50,711 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {21829#true} {21890#(<= fibonacci_~n 2)} #34#return; {21890#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:25:50,711 INFO L272 TraceCheckUtils]: 127: Hoare triple {21890#(<= fibonacci_~n 2)} call #t~ret5 := fibonacci(~n - 2); {22295#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:50,712 INFO L290 TraceCheckUtils]: 128: Hoare triple {22295#(< |fibonacci_#in~n| 1)} ~n := #in~n; {22518#(< fibonacci_~n 1)} is VALID [2022-02-21 03:25:50,712 INFO L290 TraceCheckUtils]: 129: Hoare triple {22518#(< fibonacci_~n 1)} assume !(~n < 1); {22518#(< fibonacci_~n 1)} is VALID [2022-02-21 03:25:50,712 INFO L290 TraceCheckUtils]: 130: Hoare triple {22518#(< fibonacci_~n 1)} assume !(1 == ~n); {22518#(< fibonacci_~n 1)} is VALID [2022-02-21 03:25:50,713 INFO L272 TraceCheckUtils]: 131: Hoare triple {22518#(< fibonacci_~n 1)} call #t~ret4 := fibonacci(~n - 1); {22528#(< |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:25:50,713 INFO L290 TraceCheckUtils]: 132: Hoare triple {22528#(< |fibonacci_#in~n| 0)} ~n := #in~n; {22532#(< fibonacci_~n 0)} is VALID [2022-02-21 03:25:50,713 INFO L290 TraceCheckUtils]: 133: Hoare triple {22532#(< fibonacci_~n 0)} assume !(~n < 1); {21830#false} is VALID [2022-02-21 03:25:50,713 INFO L290 TraceCheckUtils]: 134: Hoare triple {21830#false} assume !(1 == ~n); {21830#false} is VALID [2022-02-21 03:25:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 255 proven. 231 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2022-02-21 03:25:50,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:51,979 INFO L290 TraceCheckUtils]: 134: Hoare triple {21830#false} assume !(1 == ~n); {21830#false} is VALID [2022-02-21 03:25:51,979 INFO L290 TraceCheckUtils]: 133: Hoare triple {22518#(< fibonacci_~n 1)} assume !(~n < 1); {21830#false} is VALID [2022-02-21 03:25:51,980 INFO L290 TraceCheckUtils]: 132: Hoare triple {22295#(< |fibonacci_#in~n| 1)} ~n := #in~n; {22518#(< fibonacci_~n 1)} is VALID [2022-02-21 03:25:51,980 INFO L272 TraceCheckUtils]: 131: Hoare triple {22548#(< fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {22295#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:51,980 INFO L290 TraceCheckUtils]: 130: Hoare triple {22548#(< fibonacci_~n 2)} assume !(1 == ~n); {22548#(< fibonacci_~n 2)} is VALID [2022-02-21 03:25:51,981 INFO L290 TraceCheckUtils]: 129: Hoare triple {22548#(< fibonacci_~n 2)} assume !(~n < 1); {22548#(< fibonacci_~n 2)} is VALID [2022-02-21 03:25:51,981 INFO L290 TraceCheckUtils]: 128: Hoare triple {22029#(<= |fibonacci_#in~n| 1)} ~n := #in~n; {22548#(< fibonacci_~n 2)} is VALID [2022-02-21 03:25:51,982 INFO L272 TraceCheckUtils]: 127: Hoare triple {21888#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {22029#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:51,982 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {21829#true} {21888#(<= fibonacci_~n 3)} #34#return; {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:51,982 INFO L290 TraceCheckUtils]: 125: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,982 INFO L290 TraceCheckUtils]: 124: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:51,982 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:51,982 INFO L290 TraceCheckUtils]: 122: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,982 INFO L290 TraceCheckUtils]: 121: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 119: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 118: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 117: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L272 TraceCheckUtils]: 116: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 114: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 113: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 112: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L272 TraceCheckUtils]: 110: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 109: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 108: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,983 INFO L290 TraceCheckUtils]: 107: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L272 TraceCheckUtils]: 106: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 104: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 103: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 101: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 100: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 99: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 98: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L272 TraceCheckUtils]: 97: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 95: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 94: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:51,984 INFO L290 TraceCheckUtils]: 92: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 91: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 90: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L272 TraceCheckUtils]: 89: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 87: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L272 TraceCheckUtils]: 83: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 80: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L272 TraceCheckUtils]: 79: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,985 INFO L290 TraceCheckUtils]: 78: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 77: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 76: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L272 TraceCheckUtils]: 75: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L272 TraceCheckUtils]: 71: Hoare triple {21888#(<= fibonacci_~n 3)} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {21888#(<= fibonacci_~n 3)} assume !(1 == ~n); {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:51,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {21888#(<= fibonacci_~n 3)} assume !(~n < 1); {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:51,987 INFO L290 TraceCheckUtils]: 68: Hoare triple {21887#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {21888#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:25:51,987 INFO L272 TraceCheckUtils]: 67: Hoare triple {22741#(<= fibonacci_~n 4)} call #t~ret4 := fibonacci(~n - 1); {21887#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:25:51,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {22741#(<= fibonacci_~n 4)} assume !(1 == ~n); {22741#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:51,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {22741#(<= fibonacci_~n 4)} assume !(~n < 1); {22741#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:51,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {21995#(<= |fibonacci_#in~n| 4)} ~n := #in~n; {22741#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:25:51,989 INFO L272 TraceCheckUtils]: 63: Hoare triple {22754#(<= fibonacci_~n 6)} call #t~ret5 := fibonacci(~n - 2); {21995#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:25:51,989 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22761#(<= |fibonacci_#in~n| 5)} {21829#true} #34#return; {22754#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:25:51,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {22761#(<= |fibonacci_#in~n| 5)} assume true; {22761#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:25:51,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {22761#(<= |fibonacci_#in~n| 5)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22761#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:25:51,991 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21889#(<= |fibonacci_#in~n| 2)} {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} #36#return; {22761#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:25:51,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} assume true; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:51,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {21889#(<= |fibonacci_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:51,992 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22295#(< |fibonacci_#in~n| 1)} {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #36#return; {21889#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:25:51,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {22295#(< |fibonacci_#in~n| 1)} assume true; {22295#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:51,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {22794#(or (< |fibonacci_#in~n| 1) (not (< fibonacci_~n 1)))} assume ~n < 1;#res := 0; {22295#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:25:51,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {21829#true} ~n := #in~n; {22794#(or (< |fibonacci_#in~n| 1) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:25:51,993 INFO L272 TraceCheckUtils]: 52: Hoare triple {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,993 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21829#true} {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #34#return; {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:51,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:51,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,994 INFO L272 TraceCheckUtils]: 46: Hoare triple {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:51,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:51,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {21829#true} ~n := #in~n; {22784#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:25:51,995 INFO L272 TraceCheckUtils]: 42: Hoare triple {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,995 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21829#true} {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} #34#return; {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:25:51,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L272 TraceCheckUtils]: 33: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {21829#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21829#true} {21829#true} #36#return; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {21829#true} assume ~n < 1;#res := 0; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L272 TraceCheckUtils]: 25: Hoare triple {21829#true} call #t~ret5 := fibonacci(~n - 2); {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21829#true} {21829#true} #34#return; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {21829#true} assume true; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {21829#true} assume 1 == ~n;#res := 1; {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L272 TraceCheckUtils]: 15: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L272 TraceCheckUtils]: 11: Hoare triple {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume !(1 == ~n); {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume !(~n < 1); {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {21829#true} ~n := #in~n; {22771#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:25:51,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {21829#true} call #t~ret4 := fibonacci(~n - 1); {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {21829#true} assume !(1 == ~n); {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} assume !(~n < 1); {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} ~n := #in~n; {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L272 TraceCheckUtils]: 3: Hoare triple {21829#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !(main_~x~0#1 < 1); {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {21829#true} is VALID [2022-02-21 03:25:51,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {21829#true} is VALID [2022-02-21 03:25:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 255 proven. 237 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2022-02-21 03:25:51,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062233954] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:51,999 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:51,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 28 [2022-02-21 03:25:51,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348616651] [2022-02-21 03:25:51,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:52,828 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:52,828 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:52,828 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:52,828 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:52,828 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:52,828 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,828 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:52,828 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:52,828 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration7_Loop [2022-02-21 03:25:52,828 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:52,829 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:52,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:52,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:52,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:52,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:52,891 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:52,891 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:52,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,892 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:52,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:25:52,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:52,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:52,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:52,921 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:52,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:25:52,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:52,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:52,989 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:52,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:25:52,992 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:52,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:52,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:52,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:52,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:52,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:52,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:52,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:52,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration7_Loop [2022-02-21 03:25:52,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:52,992 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:52,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:52,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:53,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:53,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:53,052 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:53,053 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:53,054 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:53,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:25:53,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:53,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:53,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:53,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:53,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:53,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:53,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:53,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:53,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:53,069 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:53,069 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:53,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:53,071 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:53,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:25:53,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:53,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:53,077 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:53,077 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-02-21 03:25:53,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:25:53,098 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:53,100 INFO L390 LassoCheck]: Loop: "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#34#return;" "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#34#return;" "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#36#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#34#return;" "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#34#return;" "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#36#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#34#return;" "call #t~ret5 := fibonacci(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibonacci(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2022-02-21 03:25:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:53,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:53,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:25:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:53,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:53,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:53,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {22945#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {22945#unseeded} is VALID [2022-02-21 03:25:53,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {22945#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {22945#unseeded} is VALID [2022-02-21 03:25:53,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {22945#unseeded} assume !(main_~x~0#1 < 1); {22945#unseeded} is VALID [2022-02-21 03:25:53,733 INFO L272 TraceCheckUtils]: 3: Hoare triple {22945#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {22945#unseeded} is VALID [2022-02-21 03:25:53,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:53,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:53,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:53,735 INFO L272 TraceCheckUtils]: 7: Hoare triple {22945#unseeded} call #t~ret4 := fibonacci(~n - 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,738 INFO L272 TraceCheckUtils]: 15: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,739 INFO L272 TraceCheckUtils]: 19: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,741 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,741 INFO L272 TraceCheckUtils]: 25: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,743 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,744 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,745 INFO L272 TraceCheckUtils]: 33: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,747 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,748 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,749 INFO L272 TraceCheckUtils]: 42: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,750 INFO L272 TraceCheckUtils]: 46: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,752 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,753 INFO L272 TraceCheckUtils]: 52: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,754 INFO L290 TraceCheckUtils]: 55: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,754 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,755 INFO L290 TraceCheckUtils]: 58: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,756 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,756 INFO L290 TraceCheckUtils]: 61: Hoare triple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:53,757 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22984#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22945#unseeded} #34#return; {22945#unseeded} is VALID [2022-02-21 03:25:53,757 INFO L272 TraceCheckUtils]: 63: Hoare triple {22945#unseeded} call #t~ret5 := fibonacci(~n - 2); {22945#unseeded} is VALID [2022-02-21 03:25:53,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:53,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:53,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:53,758 INFO L272 TraceCheckUtils]: 67: Hoare triple {22945#unseeded} call #t~ret4 := fibonacci(~n - 1); {22945#unseeded} is VALID [2022-02-21 03:25:53,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:53,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:53,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:53,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-21 03:25:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:53,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:54,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {22948#(>= oldRank0 fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,606 INFO L272 TraceCheckUtils]: 8: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,608 INFO L272 TraceCheckUtils]: 12: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {23218#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {23218#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {23218#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {23218#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {23218#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,620 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23218#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,620 INFO L272 TraceCheckUtils]: 18: Hoare triple {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume true; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,622 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23174#(<= |old(oldRank0)| oldRank0)} {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,623 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {23228#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,624 INFO L272 TraceCheckUtils]: 26: Hoare triple {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume true; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,625 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23174#(<= |old(oldRank0)| oldRank0)} {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,627 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23253#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {23178#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,627 INFO L272 TraceCheckUtils]: 35: Hoare triple {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume !(1 == ~n); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,628 INFO L272 TraceCheckUtils]: 39: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} call #t~ret4 := fibonacci(~n - 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume true; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,630 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23174#(<= |old(oldRank0)| oldRank0)} {23174#(<= |old(oldRank0)| oldRank0)} #34#return; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,630 INFO L272 TraceCheckUtils]: 45: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := fibonacci(~n - 2); {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume true; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,632 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {23174#(<= |old(oldRank0)| oldRank0)} {23174#(<= |old(oldRank0)| oldRank0)} #36#return; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {23174#(<= |old(oldRank0)| oldRank0)} assume true; {23174#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:54,633 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23174#(<= |old(oldRank0)| oldRank0)} {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:54,634 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23281#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {22948#(>= oldRank0 fibonacci_~n)} #34#return; {23345#(and (<= fibonacci_~n oldRank0) (<= 5 fibonacci_~n))} is VALID [2022-02-21 03:25:54,635 INFO L272 TraceCheckUtils]: 56: Hoare triple {23345#(and (<= fibonacci_~n oldRank0) (<= 5 fibonacci_~n))} call #t~ret5 := fibonacci(~n - 2); {23349#(and (<= (+ 2 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {23349#(and (<= (+ 2 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} ~n := #in~n; {23353#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {23353#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(~n < 1); {23353#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,636 INFO L290 TraceCheckUtils]: 59: Hoare triple {23353#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(1 == ~n); {23353#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,636 INFO L272 TraceCheckUtils]: 60: Hoare triple {23353#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} call #t~ret4 := fibonacci(~n - 1); {23363#(and (<= (+ 3 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {23363#(and (<= (+ 3 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} ~n := #in~n; {23367#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {23367#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(~n < 1); {23367#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:54,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {23367#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(1 == ~n); {22958#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 39 proven. 129 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-02-21 03:25:54,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:54,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:54,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:54,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 03:25:54,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 337 transitions. cyclomatic complexity: 81 Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:55,421 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 337 transitions. cyclomatic complexity: 81. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Result 777 states and 988 transitions. Complement of second has 67 states. [2022-02-21 03:25:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:55,422 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:55,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 337 transitions. cyclomatic complexity: 81 [2022-02-21 03:25:55,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:55,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:55,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:55,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:55,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:55,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 777 states and 988 transitions. [2022-02-21 03:25:55,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:55,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:55,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:55,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 337 transitions. cyclomatic complexity: 81 [2022-02-21 03:25:55,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:25:55,431 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:55,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:55,432 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:55,433 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 777 states and 988 transitions. cyclomatic complexity: 220 [2022-02-21 03:25:55,435 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:25:55,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:55,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:55,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:55,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 2 letters. Loop has 18 letters. [2022-02-21 03:25:55,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 2 letters. Loop has 18 letters. [2022-02-21 03:25:55,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 2 letters. Loop has 18 letters. [2022-02-21 03:25:55,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 75 letters. Loop has 4 letters. [2022-02-21 03:25:55,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 75 letters. Loop has 4 letters. [2022-02-21 03:25:55,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 75 letters. Loop has 4 letters. [2022-02-21 03:25:55,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 777 letters. Loop has 777 letters. [2022-02-21 03:25:55,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 777 letters. Loop has 777 letters. [2022-02-21 03:25:55,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 777 letters. Loop has 777 letters. [2022-02-21 03:25:55,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 260 letters. Loop has 260 letters. [2022-02-21 03:25:55,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 260 letters. Loop has 260 letters. [2022-02-21 03:25:55,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 260 letters. Loop has 260 letters. [2022-02-21 03:25:55,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:55,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:55,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:55,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:55,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:55,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:55,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:55,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:55,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:55,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:55,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:55,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:55,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:55,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:55,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:55,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:55,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:55,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:55,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:55,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:55,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:55,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:55,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:55,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:55,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 2 letters. Loop has 18 letters. [2022-02-21 03:25:55,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 2 letters. Loop has 18 letters. [2022-02-21 03:25:55,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 2 letters. Loop has 18 letters. [2022-02-21 03:25:55,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:55,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:55,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:55,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:55,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:55,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:55,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:55,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:55,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:55,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:55,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:55,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:55,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:55,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:55,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:55,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:55,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:55,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:55,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 777 states and 988 transitions. cyclomatic complexity: 220 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:55,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,466 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-02-21 03:25:55,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 52 transitions. Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:55,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:55,467 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:25:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:55,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:56,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {22945#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {22945#unseeded} is VALID [2022-02-21 03:25:56,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {22945#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {22945#unseeded} is VALID [2022-02-21 03:25:56,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {22945#unseeded} assume !(main_~x~0#1 < 1); {22945#unseeded} is VALID [2022-02-21 03:25:56,099 INFO L272 TraceCheckUtils]: 3: Hoare triple {22945#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {22945#unseeded} is VALID [2022-02-21 03:25:56,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:56,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:56,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:56,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {22945#unseeded} call #t~ret4 := fibonacci(~n - 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,115 INFO L272 TraceCheckUtils]: 15: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,116 INFO L272 TraceCheckUtils]: 19: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,122 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,133 INFO L272 TraceCheckUtils]: 25: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,135 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,137 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,137 INFO L272 TraceCheckUtils]: 33: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,140 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,141 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,142 INFO L272 TraceCheckUtils]: 42: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,144 INFO L272 TraceCheckUtils]: 46: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,146 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,147 INFO L272 TraceCheckUtils]: 52: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,149 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,150 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:56,152 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {24260#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22945#unseeded} #34#return; {22945#unseeded} is VALID [2022-02-21 03:25:56,152 INFO L272 TraceCheckUtils]: 63: Hoare triple {22945#unseeded} call #t~ret5 := fibonacci(~n - 2); {22945#unseeded} is VALID [2022-02-21 03:25:56,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:56,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:56,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:56,153 INFO L272 TraceCheckUtils]: 67: Hoare triple {22945#unseeded} call #t~ret4 := fibonacci(~n - 1); {22945#unseeded} is VALID [2022-02-21 03:25:56,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:56,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:56,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:56,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-21 03:25:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:56,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:56,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {22948#(>= oldRank0 fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,946 INFO L272 TraceCheckUtils]: 8: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,947 INFO L272 TraceCheckUtils]: 12: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {24494#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {24494#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {24494#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {24494#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {24494#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,949 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24494#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,950 INFO L272 TraceCheckUtils]: 18: Hoare triple {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume true; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,951 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24450#(<= |old(oldRank0)| oldRank0)} {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,952 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24504#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,953 INFO L272 TraceCheckUtils]: 26: Hoare triple {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume true; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,955 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24450#(<= |old(oldRank0)| oldRank0)} {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,956 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {24529#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {24454#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,956 INFO L272 TraceCheckUtils]: 35: Hoare triple {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume !(1 == ~n); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,957 INFO L272 TraceCheckUtils]: 39: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} call #t~ret4 := fibonacci(~n - 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume true; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,959 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {24450#(<= |old(oldRank0)| oldRank0)} {24450#(<= |old(oldRank0)| oldRank0)} #34#return; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,959 INFO L272 TraceCheckUtils]: 45: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := fibonacci(~n - 2); {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume true; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,961 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {24450#(<= |old(oldRank0)| oldRank0)} {24450#(<= |old(oldRank0)| oldRank0)} #36#return; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {24450#(<= |old(oldRank0)| oldRank0)} assume true; {24450#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:56,962 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {24450#(<= |old(oldRank0)| oldRank0)} {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:56,963 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24557#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {22948#(>= oldRank0 fibonacci_~n)} #34#return; {24621#(and (<= fibonacci_~n oldRank0) (<= 5 fibonacci_~n))} is VALID [2022-02-21 03:25:56,964 INFO L272 TraceCheckUtils]: 56: Hoare triple {24621#(and (<= fibonacci_~n oldRank0) (<= 5 fibonacci_~n))} call #t~ret5 := fibonacci(~n - 2); {24625#(and (<= (+ 2 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {24625#(and (<= (+ 2 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} ~n := #in~n; {24629#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {24629#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(~n < 1); {24629#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {24629#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(1 == ~n); {24629#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,966 INFO L272 TraceCheckUtils]: 60: Hoare triple {24629#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} call #t~ret4 := fibonacci(~n - 1); {24639#(and (<= (+ 3 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {24639#(and (<= (+ 3 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} ~n := #in~n; {24643#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {24643#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(~n < 1); {24643#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:56,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {24643#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(1 == ~n); {22958#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 39 proven. 129 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-02-21 03:25:56,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:57,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:57,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:57,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,039 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 03:25:57,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 337 transitions. cyclomatic complexity: 81 Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:57,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 337 transitions. cyclomatic complexity: 81. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Result 779 states and 990 transitions. Complement of second has 71 states. [2022-02-21 03:25:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:57,740 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:57,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 337 transitions. cyclomatic complexity: 81 [2022-02-21 03:25:57,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:57,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:57,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:57,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:57,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:57,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:57,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 779 states and 990 transitions. [2022-02-21 03:25:57,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:25:57,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:57,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:57,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 337 transitions. cyclomatic complexity: 81 [2022-02-21 03:25:57,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:25:57,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:57,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:57,747 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:57,747 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 779 states and 990 transitions. cyclomatic complexity: 220 [2022-02-21 03:25:57,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:25:57,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:57,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 2 letters. Loop has 19 letters. [2022-02-21 03:25:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 2 letters. Loop has 19 letters. [2022-02-21 03:25:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 2 letters. Loop has 19 letters. [2022-02-21 03:25:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 75 letters. Loop has 4 letters. [2022-02-21 03:25:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 75 letters. Loop has 4 letters. [2022-02-21 03:25:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 75 letters. Loop has 4 letters. [2022-02-21 03:25:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 779 letters. Loop has 779 letters. [2022-02-21 03:25:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 779 letters. Loop has 779 letters. [2022-02-21 03:25:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 779 letters. Loop has 779 letters. [2022-02-21 03:25:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 260 letters. Loop has 260 letters. [2022-02-21 03:25:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 260 letters. Loop has 260 letters. [2022-02-21 03:25:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 260 letters. Loop has 260 letters. [2022-02-21 03:25:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 64 letters. [2022-02-21 03:25:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 130 letters. Loop has 64 letters. [2022-02-21 03:25:57,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:57,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 128 letters. Loop has 64 letters. [2022-02-21 03:25:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:57,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 129 letters. Loop has 64 letters. [2022-02-21 03:25:57,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:57,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:57,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:57,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:57,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:57,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 132 letters. Loop has 64 letters. [2022-02-21 03:25:57,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:57,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:57,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 127 letters. Loop has 64 letters. [2022-02-21 03:25:57,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 2 letters. Loop has 19 letters. [2022-02-21 03:25:57,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 2 letters. Loop has 19 letters. [2022-02-21 03:25:57,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 2 letters. Loop has 19 letters. [2022-02-21 03:25:57,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:57,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:57,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 136 letters. Loop has 64 letters. [2022-02-21 03:25:57,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 136 letters. Loop has 64 letters. [2022-02-21 03:25:57,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 136 letters. Loop has 64 letters. [2022-02-21 03:25:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 137 letters. Loop has 64 letters. [2022-02-21 03:25:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 137 letters. Loop has 64 letters. [2022-02-21 03:25:57,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 137 letters. Loop has 64 letters. [2022-02-21 03:25:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 138 letters. Loop has 64 letters. [2022-02-21 03:25:57,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 138 letters. Loop has 64 letters. [2022-02-21 03:25:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 138 letters. Loop has 64 letters. [2022-02-21 03:25:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 139 letters. Loop has 64 letters. [2022-02-21 03:25:57,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 139 letters. Loop has 64 letters. [2022-02-21 03:25:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 139 letters. Loop has 64 letters. [2022-02-21 03:25:57,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 140 letters. Loop has 64 letters. [2022-02-21 03:25:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 140 letters. Loop has 64 letters. [2022-02-21 03:25:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 140 letters. Loop has 64 letters. [2022-02-21 03:25:57,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:57,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 135 letters. Loop has 64 letters. [2022-02-21 03:25:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 779 states and 990 transitions. cyclomatic complexity: 220 Stem has 131 letters. Loop has 68 letters. [2022-02-21 03:25:57,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,787 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2022-02-21 03:25:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 54 transitions. Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:57,789 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:25:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:57,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:58,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {22945#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {22945#unseeded} is VALID [2022-02-21 03:25:58,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {22945#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {22945#unseeded} is VALID [2022-02-21 03:25:58,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {22945#unseeded} assume !(main_~x~0#1 < 1); {22945#unseeded} is VALID [2022-02-21 03:25:58,444 INFO L272 TraceCheckUtils]: 3: Hoare triple {22945#unseeded} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {22945#unseeded} is VALID [2022-02-21 03:25:58,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:58,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:58,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:58,446 INFO L272 TraceCheckUtils]: 7: Hoare triple {22945#unseeded} call #t~ret4 := fibonacci(~n - 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,448 INFO L272 TraceCheckUtils]: 11: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,449 INFO L272 TraceCheckUtils]: 15: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,451 INFO L272 TraceCheckUtils]: 19: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,453 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,454 INFO L272 TraceCheckUtils]: 25: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,464 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,466 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,467 INFO L272 TraceCheckUtils]: 33: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,469 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,471 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,472 INFO L272 TraceCheckUtils]: 42: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,473 INFO L272 TraceCheckUtils]: 46: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibonacci(~n - 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,476 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #34#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,477 INFO L272 TraceCheckUtils]: 52: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibonacci(~n - 2); {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,479 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,481 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #36#return; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,481 INFO L290 TraceCheckUtils]: 60: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:25:58,482 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {25546#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {22945#unseeded} #34#return; {22945#unseeded} is VALID [2022-02-21 03:25:58,483 INFO L272 TraceCheckUtils]: 63: Hoare triple {22945#unseeded} call #t~ret5 := fibonacci(~n - 2); {22945#unseeded} is VALID [2022-02-21 03:25:58,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:58,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:58,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:58,484 INFO L272 TraceCheckUtils]: 67: Hoare triple {22945#unseeded} call #t~ret4 := fibonacci(~n - 1); {22945#unseeded} is VALID [2022-02-21 03:25:58,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {22945#unseeded} ~n := #in~n; {22945#unseeded} is VALID [2022-02-21 03:25:58,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {22945#unseeded} assume !(~n < 1); {22945#unseeded} is VALID [2022-02-21 03:25:58,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {22945#unseeded} assume !(1 == ~n); {22945#unseeded} is VALID [2022-02-21 03:25:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:58,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-21 03:25:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:58,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:59,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {22948#(>= oldRank0 fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,272 INFO L272 TraceCheckUtils]: 8: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(1 == ~n); {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,273 INFO L272 TraceCheckUtils]: 12: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret4 := fibonacci(~n - 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {25780#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {25780#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {25780#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {25780#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {25780#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,275 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25780#(and (<= 1 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,276 INFO L272 TraceCheckUtils]: 18: Hoare triple {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume true; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,277 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25736#(<= |old(oldRank0)| oldRank0)} {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,279 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {25790#(and (<= 2 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,279 INFO L272 TraceCheckUtils]: 26: Hoare triple {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume true; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,281 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25736#(<= |old(oldRank0)| oldRank0)} {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,282 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25815#(and (<= 3 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {25740#(and (<= fibonacci_~n |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #34#return; {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,283 INFO L272 TraceCheckUtils]: 35: Hoare triple {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} call #t~ret5 := fibonacci(~n - 2); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume !(1 == ~n); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,285 INFO L272 TraceCheckUtils]: 39: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} call #t~ret4 := fibonacci(~n - 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume !(~n < 1); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume 1 == ~n;#res := 1; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume true; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,286 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25736#(<= |old(oldRank0)| oldRank0)} {25736#(<= |old(oldRank0)| oldRank0)} #34#return; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,287 INFO L272 TraceCheckUtils]: 45: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := fibonacci(~n - 2); {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume ~n < 1;#res := 0; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume true; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,288 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25736#(<= |old(oldRank0)| oldRank0)} {25736#(<= |old(oldRank0)| oldRank0)} #36#return; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {25736#(<= |old(oldRank0)| oldRank0)} assume true; {25736#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:25:59,289 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25736#(<= |old(oldRank0)| oldRank0)} {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #36#return; {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:25:59,291 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25843#(and (<= 4 |fibonacci_#in~n|) (<= |old(oldRank0)| oldRank0))} {22948#(>= oldRank0 fibonacci_~n)} #34#return; {25907#(and (<= fibonacci_~n oldRank0) (<= 5 fibonacci_~n))} is VALID [2022-02-21 03:25:59,293 INFO L272 TraceCheckUtils]: 56: Hoare triple {25907#(and (<= fibonacci_~n oldRank0) (<= 5 fibonacci_~n))} call #t~ret5 := fibonacci(~n - 2); {25911#(and (<= (+ 2 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {25911#(and (<= (+ 2 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} ~n := #in~n; {25915#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {25915#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(~n < 1); {25915#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {25915#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(1 == ~n); {25915#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,294 INFO L272 TraceCheckUtils]: 60: Hoare triple {25915#(and (<= (+ 2 fibonacci_~n) oldRank0) (<= 5 oldRank0))} call #t~ret4 := fibonacci(~n - 1); {25925#(and (<= (+ 3 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {25925#(and (<= (+ 3 |fibonacci_#in~n|) oldRank0) (<= 5 oldRank0))} ~n := #in~n; {25929#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {25929#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(~n < 1); {25929#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} is VALID [2022-02-21 03:25:59,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {25929#(and (<= (+ 3 fibonacci_~n) oldRank0) (<= 5 oldRank0))} assume !(1 == ~n); {22958#(or unseeded (and (>= oldRank0 0) (> oldRank0 fibonacci_~n)))} is VALID [2022-02-21 03:25:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 39 proven. 129 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-02-21 03:25:59,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:25:59,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:59,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:25:59,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:59,348 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2022-02-21 03:25:59,348 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 337 transitions. cyclomatic complexity: 81 Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:26:00,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 337 transitions. cyclomatic complexity: 81. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Result 136 states and 141 transitions. Complement of second has 53 states. [2022-02-21 03:26:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:00,118 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:00,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 337 transitions. cyclomatic complexity: 81 [2022-02-21 03:26:00,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:00,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:00,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:26:00,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:00,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:00,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:00,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 141 transitions. [2022-02-21 03:26:00,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:00,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:00,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 260 states and 337 transitions. cyclomatic complexity: 81 [2022-02-21 03:26:00,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:26:00,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-21 03:26:00,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:00,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:00,121 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 141 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:00,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 141 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:00,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:00,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:00,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 260 states and 337 transitions. cyclomatic complexity: 81 Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:26:00,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:00,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 10 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:26:00,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:00,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 141 transitions. cyclomatic complexity: 7 Stem has 71 letters. Loop has 64 letters. [2022-02-21 03:26:00,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:00,130 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: buchiDifferenceNCSBLazy3 wrong result! at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.AbstractBuchiDifference.checkAcceptance(AbstractBuchiDifference.java:179) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.AbstractBuchiDifference.checkResult(AbstractBuchiDifference.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.nsbcDifference(RefineBuchi.java:543) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:731) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:518) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:26:00,136 INFO L158 Benchmark]: Toolchain (without parser) took 27563.50ms. Allocated memory was 123.7MB in the beginning and 262.1MB in the end (delta: 138.4MB). Free memory was 91.1MB in the beginning and 137.2MB in the end (delta: -46.1MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2022-02-21 03:26:00,137 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:26:00,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.49ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 100.1MB in the end (delta: -9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:26:00,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.91ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 98.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:26:00,137 INFO L158 Benchmark]: Boogie Preprocessor took 18.74ms. Allocated memory is still 123.7MB. Free memory was 98.8MB in the beginning and 97.8MB in the end (delta: 954.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:26:00,138 INFO L158 Benchmark]: RCFGBuilder took 242.42ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 88.5MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:26:00,138 INFO L158 Benchmark]: BuchiAutomizer took 27074.08ms. Allocated memory was 123.7MB in the beginning and 262.1MB in the end (delta: 138.4MB). Free memory was 88.5MB in the beginning and 137.2MB in the end (delta: -48.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2022-02-21 03:26:00,139 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.49ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 100.1MB in the end (delta: -9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.91ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 98.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.74ms. Allocated memory is still 123.7MB. Free memory was 98.8MB in the beginning and 97.8MB in the end (delta: 954.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 242.42ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 88.5MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 27074.08ms. Allocated memory was 123.7MB in the beginning and 262.1MB in the end (delta: 138.4MB). Free memory was 88.5MB in the beginning and 137.2MB in the end (delta: -48.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: buchiDifferenceNCSBLazy3 wrong result! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: buchiDifferenceNCSBLazy3 wrong result!: de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.AbstractBuchiDifference.checkAcceptance(AbstractBuchiDifference.java:179) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:26:00,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:00,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-02-21 03:26:00,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:00,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-02-21 03:26:00,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:01,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-21 03:26:01,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: buchiDifferenceNCSBLazy3 wrong result!