./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows 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/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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(G ! overflow) ) --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:06:16,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:06:16,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:06:16,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:06:16,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:06:16,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:06:16,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:06:16,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:06:16,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:06:16,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:06:16,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:06:16,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:06:16,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:06:16,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:06:16,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:06:16,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:06:16,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:06:16,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:06:16,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:06:16,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:06:16,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:06:16,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:06:16,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:06:16,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:06:16,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:06:16,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:06:16,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:06:16,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:06:16,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:06:16,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:06:16,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:06:16,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:06:16,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:06:16,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:06:16,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:06:16,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:06:16,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:06:16,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:06:16,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:06:16,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:06:16,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:06:16,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:06:16,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:06:16,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:06:16,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:06:16,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:06:16,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:06:16,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:06:16,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:06:16,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:06:16,172 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:06:16,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:06:16,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:06:16,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:06:16,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:06:16,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:06:16,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:06:16,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:06:16,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:06:16,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:06:16,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:06:16,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:06:16,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:06:16,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:06:16,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:06:16,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:06:16,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! overflow) ) 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:06:16,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:06:16,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:06:16,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:06:16,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:06:16,391 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:06:16,392 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:06:16,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b8cf8d22/c95c973a64d541c68500a356d5dbe1f0/FLAGb176b8ca0 [2022-02-21 03:06:16,760 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:06:16,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2022-02-21 03:06:16,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b8cf8d22/c95c973a64d541c68500a356d5dbe1f0/FLAGb176b8ca0 [2022-02-21 03:06:17,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b8cf8d22/c95c973a64d541c68500a356d5dbe1f0 [2022-02-21 03:06:17,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:06:17,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:06:17,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:06:17,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:06:17,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:06:17,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ecbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17, skipping insertion in model container [2022-02-21 03:06:17,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:06:17,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:06:17,344 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:06:17,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:06:17,363 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:06:17,380 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:06:17,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:06:17,394 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:06:17,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17 WrapperNode [2022-02-21 03:06:17,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:06:17,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:06:17,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:06:17,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:06:17,402 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:06:17" (1/1) ... [2022-02-21 03:06:17,408 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:06:17" (1/1) ... [2022-02-21 03:06:17,422 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-21 03:06:17,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:06:17,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:06:17,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:06:17,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:06:17,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:06:17,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:06:17,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:06:17,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:06:17,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (1/1) ... [2022-02-21 03:06:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:06:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:17,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:06:17,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:06:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-02-21 03:06:17,508 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-02-21 03:06:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:06:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:06:17,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:06:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:06:17,548 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:06:17,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:06:17,659 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:06:17,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:06:17,664 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:06:17,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:06:17 BoogieIcfgContainer [2022-02-21 03:06:17,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:06:17,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:06:17,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:06:17,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:06:17,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:06:17" (1/3) ... [2022-02-21 03:06:17,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b695d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:06:17, skipping insertion in model container [2022-02-21 03:06:17,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:06:17" (2/3) ... [2022-02-21 03:06:17,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b695d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:06:17, skipping insertion in model container [2022-02-21 03:06:17,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:06:17" (3/3) ... [2022-02-21 03:06:17,672 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-2.c [2022-02-21 03:06:17,675 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:06:17,675 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:06:17,714 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:06:17,722 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:06:17,735 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:06:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 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:06:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:06:17,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:17,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:17,761 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 627182713, now seen corresponding path program 1 times [2022-02-21 03:06:17,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:17,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219052566] [2022-02-21 03:06:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:17,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#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); {34#true} is VALID [2022-02-21 03:06:17,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {36#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:06:17,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 < 1); {36#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:06:17,936 INFO L272 TraceCheckUtils]: 3: Hoare triple {36#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {37#(<= |fibonacci_#in~n| 2147483647)} is VALID [2022-02-21 03:06:17,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#(<= |fibonacci_#in~n| 2147483647)} ~n := #in~n; {38#(<= fibonacci_~n 2147483647)} is VALID [2022-02-21 03:06:17,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#(<= fibonacci_~n 2147483647)} assume !(~n < 1); {38#(<= fibonacci_~n 2147483647)} is VALID [2022-02-21 03:06:17,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#(<= fibonacci_~n 2147483647)} assume !(1 == ~n); {38#(<= fibonacci_~n 2147483647)} is VALID [2022-02-21 03:06:17,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#(<= fibonacci_~n 2147483647)} assume !(~n - 1 <= 2147483647); {35#false} is VALID [2022-02-21 03:06:17,942 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:06:17,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:17,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219052566] [2022-02-21 03:06:17,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219052566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:17,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:17,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:17,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099932097] [2022-02-21 03:06:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:06:17,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:17,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:17,968 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:06:17,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:17,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:17,994 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,211 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-21 03:06:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:06:18,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:06:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-21 03:06:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-21 03:06:18,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-21 03:06:18,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:18,275 INFO L225 Difference]: With dead ends: 34 [2022-02-21 03:06:18,276 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 03:06:18,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:06:18,282 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:18,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 41 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 03:06:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-21 03:06:18,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:18,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,320 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,321 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,326 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-21 03:06:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-21 03:06:18,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:18,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:18,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-21 03:06:18,329 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-21 03:06:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,339 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-21 03:06:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-21 03:06:18,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:18,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:18,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:18,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-02-21 03:06:18,345 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2022-02-21 03:06:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:18,345 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-02-21 03:06:18,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-21 03:06:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:06:18,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:18,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:18,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:06:18,348 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2032172335, now seen corresponding path program 1 times [2022-02-21 03:06:18,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:18,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828301979] [2022-02-21 03:06:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#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); {156#true} is VALID [2022-02-21 03:06:18,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {156#true} is VALID [2022-02-21 03:06:18,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume !(main_~x~0#1 < 1); {156#true} is VALID [2022-02-21 03:06:18,393 INFO L272 TraceCheckUtils]: 3: Hoare triple {156#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {156#true} is VALID [2022-02-21 03:06:18,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {156#true} ~n := #in~n; {156#true} is VALID [2022-02-21 03:06:18,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} assume !(~n < 1); {158#(<= 1 fibonacci_~n)} is VALID [2022-02-21 03:06:18,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(<= 1 fibonacci_~n)} assume !(1 == ~n); {158#(<= 1 fibonacci_~n)} is VALID [2022-02-21 03:06:18,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(<= 1 fibonacci_~n)} assume ~n - 1 <= 2147483647; {158#(<= 1 fibonacci_~n)} is VALID [2022-02-21 03:06:18,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#(<= 1 fibonacci_~n)} assume !(~n - 1 >= -2147483648); {157#false} is VALID [2022-02-21 03:06:18,396 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:06:18,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:18,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828301979] [2022-02-21 03:06:18,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828301979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:18,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:18,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:06:18,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336584269] [2022-02-21 03:06:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:06:18,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:18,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,405 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:06:18,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:06:18,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:06:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:06:18,407 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,466 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-21 03:06:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:06:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:06:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:06:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:06:18,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:06:18,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:18,495 INFO L225 Difference]: With dead ends: 25 [2022-02-21 03:06:18,496 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 03:06:18,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:06:18,500 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:18,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 03:06:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-21 03:06:18,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:18,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,517 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,518 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,522 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-21 03:06:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-21 03:06:18,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:18,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:18,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-21 03:06:18,523 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-21 03:06:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,528 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-21 03:06:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-21 03:06:18,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:18,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:18,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:18,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-21 03:06:18,536 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2022-02-21 03:06:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:18,537 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-21 03:06:18,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:06:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-21 03:06:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 03:06:18,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:18,539 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:18,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:06:18,539 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:18,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash -60677199, now seen corresponding path program 1 times [2022-02-21 03:06:18,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:18,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99204690] [2022-02-21 03:06:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} ~n := #in~n; {261#true} is VALID [2022-02-21 03:06:18,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume ~n < 1;#res := 0; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {261#true} #47#return; {267#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-21 03:06:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} ~n := #in~n; {261#true} is VALID [2022-02-21 03:06:18,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume ~n < 1;#res := 0; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {267#(= |fibonacci_#t~ret4| 0)} #49#return; {272#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} is VALID [2022-02-21 03:06:18,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#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); {261#true} is VALID [2022-02-21 03:06:18,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {261#true} is VALID [2022-02-21 03:06:18,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume !(main_~x~0#1 < 1); {261#true} is VALID [2022-02-21 03:06:18,672 INFO L272 TraceCheckUtils]: 3: Hoare triple {261#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {261#true} is VALID [2022-02-21 03:06:18,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} ~n := #in~n; {261#true} is VALID [2022-02-21 03:06:18,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#true} assume !(~n < 1); {261#true} is VALID [2022-02-21 03:06:18,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#true} assume !(1 == ~n); {261#true} is VALID [2022-02-21 03:06:18,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {261#true} assume ~n - 1 <= 2147483647; {261#true} is VALID [2022-02-21 03:06:18,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#true} assume ~n - 1 >= -2147483648; {261#true} is VALID [2022-02-21 03:06:18,673 INFO L272 TraceCheckUtils]: 9: Hoare triple {261#true} call #t~ret4 := fibonacci(~n - 1); {261#true} is VALID [2022-02-21 03:06:18,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#true} ~n := #in~n; {261#true} is VALID [2022-02-21 03:06:18,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {261#true} assume ~n < 1;#res := 0; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,675 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {261#true} #47#return; {267#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(= |fibonacci_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {267#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 <= 2147483647; {267#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 >= -2147483648; {267#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,676 INFO L272 TraceCheckUtils]: 17: Hoare triple {267#(= |fibonacci_#t~ret4| 0)} call #t~ret5 := fibonacci(~n - 2); {261#true} is VALID [2022-02-21 03:06:18,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {261#true} ~n := #in~n; {261#true} is VALID [2022-02-21 03:06:18,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {261#true} assume ~n < 1;#res := 0; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,679 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {273#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {267#(= |fibonacci_#t~ret4| 0)} #49#return; {272#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} is VALID [2022-02-21 03:06:18,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {272#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {272#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} is VALID [2022-02-21 03:06:18,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {272#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {262#false} is VALID [2022-02-21 03:06:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-21 03:06:18,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:18,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99204690] [2022-02-21 03:06:18,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99204690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:18,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:18,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:18,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483299985] [2022-02-21 03:06:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-21 03:06:18,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:18,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:18,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:18,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:18,724 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,800 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:06:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:06:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-21 03:06:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-02-21 03:06:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-02-21 03:06:18,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-02-21 03:06:18,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:18,831 INFO L225 Difference]: With dead ends: 37 [2022-02-21 03:06:18,831 INFO L226 Difference]: Without dead ends: 35 [2022-02-21 03:06:18,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:18,832 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:18,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-21 03:06:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-02-21 03:06:18,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:18,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:06:18,846 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:06:18,846 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:06:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,848 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-21 03:06:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-21 03:06:18,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:18,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:18,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 35 states. [2022-02-21 03:06:18,849 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 35 states. [2022-02-21 03:06:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:18,851 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-21 03:06:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-21 03:06:18,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:18,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:18,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:18,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:06:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-21 03:06:18,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2022-02-21 03:06:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:18,854 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-21 03:06:18,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:06:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:06:18,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:18,855 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:18,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:06:18,855 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2034782143, now seen corresponding path program 1 times [2022-02-21 03:06:18,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:18,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096463779] [2022-02-21 03:06:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:06:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:18,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume ~n < 1;#res := 0; {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {423#true} #47#return; {429#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-21 03:06:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:18,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:18,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:18,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume 1 == ~n;#res := 1; {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,965 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {429#(= |fibonacci_#t~ret4| 0)} #49#return; {435#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:18,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#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); {423#true} is VALID [2022-02-21 03:06:18,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {423#true} is VALID [2022-02-21 03:06:18,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume !(main_~x~0#1 < 1); {423#true} is VALID [2022-02-21 03:06:18,966 INFO L272 TraceCheckUtils]: 3: Hoare triple {423#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {423#true} is VALID [2022-02-21 03:06:18,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:18,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:18,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {423#true} assume !(1 == ~n); {423#true} is VALID [2022-02-21 03:06:18,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#true} assume ~n - 1 <= 2147483647; {423#true} is VALID [2022-02-21 03:06:18,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#true} assume ~n - 1 >= -2147483648; {423#true} is VALID [2022-02-21 03:06:18,967 INFO L272 TraceCheckUtils]: 9: Hoare triple {423#true} call #t~ret4 := fibonacci(~n - 1); {423#true} is VALID [2022-02-21 03:06:18,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:18,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:18,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {423#true} assume !(1 == ~n); {423#true} is VALID [2022-02-21 03:06:18,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {423#true} assume ~n - 1 <= 2147483647; {423#true} is VALID [2022-02-21 03:06:18,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {423#true} assume ~n - 1 >= -2147483648; {423#true} is VALID [2022-02-21 03:06:18,968 INFO L272 TraceCheckUtils]: 15: Hoare triple {423#true} call #t~ret4 := fibonacci(~n - 1); {423#true} is VALID [2022-02-21 03:06:18,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:18,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#true} assume ~n < 1;#res := 0; {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,970 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {436#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {423#true} #47#return; {429#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {429#(= |fibonacci_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {429#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {429#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 <= 2147483647; {429#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {429#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 >= -2147483648; {429#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:06:18,971 INFO L272 TraceCheckUtils]: 23: Hoare triple {429#(= |fibonacci_#t~ret4| 0)} call #t~ret5 := fibonacci(~n - 2); {423#true} is VALID [2022-02-21 03:06:18,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:18,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:18,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {423#true} assume 1 == ~n;#res := 1; {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:18,973 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {437#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {429#(= |fibonacci_#t~ret4| 0)} #49#return; {435#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:18,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {435#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {435#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:18,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {435#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {424#false} is VALID [2022-02-21 03:06:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:06:18,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:18,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096463779] [2022-02-21 03:06:18,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096463779] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:18,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420516527] [2022-02-21 03:06:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:18,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:18,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:18,978 INFO L229 MonitoredProcess]: Starting monitored process 2 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:06:18,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:06:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:19,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:06:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:19,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#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); {423#true} is VALID [2022-02-21 03:06:19,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {423#true} is VALID [2022-02-21 03:06:19,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume !(main_~x~0#1 < 1); {423#true} is VALID [2022-02-21 03:06:19,282 INFO L272 TraceCheckUtils]: 3: Hoare triple {423#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {423#true} is VALID [2022-02-21 03:06:19,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {423#true} assume !(1 == ~n); {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#true} assume ~n - 1 <= 2147483647; {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#true} assume ~n - 1 >= -2147483648; {423#true} is VALID [2022-02-21 03:06:19,283 INFO L272 TraceCheckUtils]: 9: Hoare triple {423#true} call #t~ret4 := fibonacci(~n - 1); {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:19,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {423#true} assume !(1 == ~n); {423#true} is VALID [2022-02-21 03:06:19,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {423#true} assume ~n - 1 <= 2147483647; {423#true} is VALID [2022-02-21 03:06:19,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {423#true} assume ~n - 1 >= -2147483648; {423#true} is VALID [2022-02-21 03:06:19,284 INFO L272 TraceCheckUtils]: 15: Hoare triple {423#true} call #t~ret4 := fibonacci(~n - 1); {423#true} is VALID [2022-02-21 03:06:19,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#true} ~n := #in~n; {489#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:19,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {493#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:19,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {493#(< |fibonacci_#in~n| 1)} assume true; {493#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:19,297 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {493#(< |fibonacci_#in~n| 1)} {423#true} #47#return; {500#(< fibonacci_~n 2)} is VALID [2022-02-21 03:06:19,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {500#(< fibonacci_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {500#(< fibonacci_~n 2)} is VALID [2022-02-21 03:06:19,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {500#(< fibonacci_~n 2)} assume ~n - 2 <= 2147483647; {500#(< fibonacci_~n 2)} is VALID [2022-02-21 03:06:19,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {500#(< fibonacci_~n 2)} assume ~n - 2 >= -2147483648; {500#(< fibonacci_~n 2)} is VALID [2022-02-21 03:06:19,299 INFO L272 TraceCheckUtils]: 23: Hoare triple {500#(< fibonacci_~n 2)} call #t~ret5 := fibonacci(~n - 2); {423#true} is VALID [2022-02-21 03:06:19,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {423#true} ~n := #in~n; {516#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {516#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {520#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {520#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {520#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 |fibonacci_#in~n|)} assume true; {520#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,301 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {520#(<= 1 |fibonacci_#in~n|)} {500#(< fibonacci_~n 2)} #49#return; {424#false} is VALID [2022-02-21 03:06:19,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {424#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {424#false} is VALID [2022-02-21 03:06:19,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {424#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {424#false} is VALID [2022-02-21 03:06:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:06:19,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:19,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {424#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {424#false} is VALID [2022-02-21 03:06:19,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {424#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {424#false} is VALID [2022-02-21 03:06:19,629 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {520#(<= 1 |fibonacci_#in~n|)} {542#(< fibonacci_~n 3)} #49#return; {424#false} is VALID [2022-02-21 03:06:19,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 |fibonacci_#in~n|)} assume true; {520#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {520#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {520#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {555#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {520#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:19,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {423#true} ~n := #in~n; {555#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:06:19,638 INFO L272 TraceCheckUtils]: 23: Hoare triple {542#(< fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {423#true} is VALID [2022-02-21 03:06:19,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {542#(< fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {542#(< fibonacci_~n 3)} is VALID [2022-02-21 03:06:19,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {542#(< fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {542#(< fibonacci_~n 3)} is VALID [2022-02-21 03:06:19,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {542#(< fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {542#(< fibonacci_~n 3)} is VALID [2022-02-21 03:06:19,640 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {574#(< |fibonacci_#in~n| 2)} {423#true} #47#return; {542#(< fibonacci_~n 3)} is VALID [2022-02-21 03:06:19,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {574#(< |fibonacci_#in~n| 2)} assume true; {574#(< |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:19,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {581#(or (< |fibonacci_#in~n| 2) (not (< fibonacci_~n 1)))} assume ~n < 1;#res := 0; {574#(< |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:19,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#true} ~n := #in~n; {581#(or (< |fibonacci_#in~n| 2) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:06:19,641 INFO L272 TraceCheckUtils]: 15: Hoare triple {423#true} call #t~ret4 := fibonacci(~n - 1); {423#true} is VALID [2022-02-21 03:06:19,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {423#true} assume ~n - 1 >= -2147483648; {423#true} is VALID [2022-02-21 03:06:19,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {423#true} assume ~n - 1 <= 2147483647; {423#true} is VALID [2022-02-21 03:06:19,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {423#true} assume !(1 == ~n); {423#true} is VALID [2022-02-21 03:06:19,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:19,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:19,642 INFO L272 TraceCheckUtils]: 9: Hoare triple {423#true} call #t~ret4 := fibonacci(~n - 1); {423#true} is VALID [2022-02-21 03:06:19,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#true} assume ~n - 1 >= -2147483648; {423#true} is VALID [2022-02-21 03:06:19,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#true} assume ~n - 1 <= 2147483647; {423#true} is VALID [2022-02-21 03:06:19,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {423#true} assume !(1 == ~n); {423#true} is VALID [2022-02-21 03:06:19,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} assume !(~n < 1); {423#true} is VALID [2022-02-21 03:06:19,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {423#true} ~n := #in~n; {423#true} is VALID [2022-02-21 03:06:19,643 INFO L272 TraceCheckUtils]: 3: Hoare triple {423#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {423#true} is VALID [2022-02-21 03:06:19,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume !(main_~x~0#1 < 1); {423#true} is VALID [2022-02-21 03:06:19,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {423#true} is VALID [2022-02-21 03:06:19,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#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); {423#true} is VALID [2022-02-21 03:06:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:06:19,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420516527] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:19,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:19,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-02-21 03:06:19,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000791894] [2022-02-21 03:06:19,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-02-21 03:06:19,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:19,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:19,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:19,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:06:19,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:19,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:06:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:06:19,704 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:20,368 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-02-21 03:06:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:06:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-02-21 03:06:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-02-21 03:06:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-02-21 03:06:20,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 81 transitions. [2022-02-21 03:06:20,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:20,434 INFO L225 Difference]: With dead ends: 91 [2022-02-21 03:06:20,434 INFO L226 Difference]: Without dead ends: 65 [2022-02-21 03:06:20,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:06:20,435 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 144 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:20,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 91 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:06:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-21 03:06:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-02-21 03:06:20,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:20,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:20,461 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:20,461 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:20,468 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-02-21 03:06:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-02-21 03:06:20,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:20,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:20,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) Second operand 65 states. [2022-02-21 03:06:20,469 INFO L87 Difference]: Start difference. First operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) Second operand 65 states. [2022-02-21 03:06:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:20,473 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-02-21 03:06:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-02-21 03:06:20,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:20,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:20,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:20,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-02-21 03:06:20,476 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2022-02-21 03:06:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:20,476 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-02-21 03:06:20,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-21 03:06:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:06:20,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:20,480 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:20,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:06:20,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:20,692 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash -603092359, now seen corresponding path program 2 times [2022-02-21 03:06:20,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:20,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647910173] [2022-02-21 03:06:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:20,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#true} assume !(~n < 1); {942#true} is VALID [2022-02-21 03:06:20,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#true} assume 1 == ~n;#res := 1; {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,761 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {942#true} #47#return; {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:06:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:20,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#true} assume ~n < 1;#res := 0; {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #49#return; {954#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:20,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#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); {942#true} is VALID [2022-02-21 03:06:20,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {942#true} is VALID [2022-02-21 03:06:20,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#true} assume !(main_~x~0#1 < 1); {942#true} is VALID [2022-02-21 03:06:20,778 INFO L272 TraceCheckUtils]: 3: Hoare triple {942#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {942#true} is VALID [2022-02-21 03:06:20,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#true} assume !(~n < 1); {942#true} is VALID [2022-02-21 03:06:20,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#true} assume !(1 == ~n); {942#true} is VALID [2022-02-21 03:06:20,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#true} assume ~n - 1 <= 2147483647; {942#true} is VALID [2022-02-21 03:06:20,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#true} assume ~n - 1 >= -2147483648; {942#true} is VALID [2022-02-21 03:06:20,779 INFO L272 TraceCheckUtils]: 9: Hoare triple {942#true} call #t~ret4 := fibonacci(~n - 1); {942#true} is VALID [2022-02-21 03:06:20,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {942#true} assume !(~n < 1); {942#true} is VALID [2022-02-21 03:06:20,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {942#true} assume 1 == ~n;#res := 1; {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,781 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {955#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {942#true} #47#return; {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:20,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:20,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 <= 2147483647; {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:20,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 >= -2147483648; {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:20,782 INFO L272 TraceCheckUtils]: 18: Hoare triple {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} call #t~ret5 := fibonacci(~n - 2); {942#true} is VALID [2022-02-21 03:06:20,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#true} assume ~n < 1;#res := 0; {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:20,783 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {956#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {949#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #49#return; {954#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:20,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {954#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {954#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:20,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {954#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {943#false} is VALID [2022-02-21 03:06:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:06:20,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:20,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647910173] [2022-02-21 03:06:20,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647910173] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:20,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671482465] [2022-02-21 03:06:20,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:06:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:20,786 INFO L229 MonitoredProcess]: Starting monitored process 3 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:06:20,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:06:20,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:06:20,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:20,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:06:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:20,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:20,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#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); {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#true} assume !(main_~x~0#1 < 1); {942#true} is VALID [2022-02-21 03:06:20,918 INFO L272 TraceCheckUtils]: 3: Hoare triple {942#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#true} assume !(~n < 1); {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#true} assume !(1 == ~n); {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#true} assume ~n - 1 <= 2147483647; {942#true} is VALID [2022-02-21 03:06:20,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#true} assume ~n - 1 >= -2147483648; {942#true} is VALID [2022-02-21 03:06:20,918 INFO L272 TraceCheckUtils]: 9: Hoare triple {942#true} call #t~ret4 := fibonacci(~n - 1); {942#true} is VALID [2022-02-21 03:06:20,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {942#true} assume !(~n < 1); {942#true} is VALID [2022-02-21 03:06:20,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {942#true} assume 1 == ~n;#res := 1; {942#true} is VALID [2022-02-21 03:06:20,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {942#true} assume true; {942#true} is VALID [2022-02-21 03:06:20,919 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {942#true} {942#true} #47#return; {942#true} is VALID [2022-02-21 03:06:20,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {942#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1005#(<= |fibonacci_#t~ret4| 2147483647)} is VALID [2022-02-21 03:06:20,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {1005#(<= |fibonacci_#t~ret4| 2147483647)} assume ~n - 2 <= 2147483647; {1005#(<= |fibonacci_#t~ret4| 2147483647)} is VALID [2022-02-21 03:06:20,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {1005#(<= |fibonacci_#t~ret4| 2147483647)} assume ~n - 2 >= -2147483648; {1005#(<= |fibonacci_#t~ret4| 2147483647)} is VALID [2022-02-21 03:06:20,923 INFO L272 TraceCheckUtils]: 18: Hoare triple {1005#(<= |fibonacci_#t~ret4| 2147483647)} call #t~ret5 := fibonacci(~n - 2); {942#true} is VALID [2022-02-21 03:06:20,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#true} ~n := #in~n; {942#true} is VALID [2022-02-21 03:06:20,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#true} assume ~n < 1;#res := 0; {1021#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:20,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#(<= |fibonacci_#res| 0)} assume true; {1021#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:20,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1021#(<= |fibonacci_#res| 0)} {1005#(<= |fibonacci_#t~ret4| 2147483647)} #49#return; {1028#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} is VALID [2022-02-21 03:06:20,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {1028#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1028#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} is VALID [2022-02-21 03:06:20,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {1028#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {943#false} is VALID [2022-02-21 03:06:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:06:20,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:06:20,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671482465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:20,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:06:20,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-02-21 03:06:20,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123986593] [2022-02-21 03:06:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-21 03:06:20,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:20,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:20,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:20,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:20,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:06:20,941 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,026 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-02-21 03:06:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:06:21,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-21 03:06:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:06:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:06:21,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-21 03:06:21,050 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:06:21,052 INFO L225 Difference]: With dead ends: 61 [2022-02-21 03:06:21,052 INFO L226 Difference]: Without dead ends: 60 [2022-02-21 03:06:21,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:06:21,053 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:21,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 65 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-21 03:06:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-02-21 03:06:21,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:21,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:21,079 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:21,079 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,081 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-02-21 03:06:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-21 03:06:21,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:21,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:21,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) Second operand 60 states. [2022-02-21 03:06:21,082 INFO L87 Difference]: Start difference. First operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) Second operand 60 states. [2022-02-21 03:06:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,084 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-02-21 03:06:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-21 03:06:21,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:21,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:21,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:21,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:06:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-02-21 03:06:21,099 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2022-02-21 03:06:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:21,100 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-02-21 03:06:21,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:06:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-02-21 03:06:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:06:21,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:21,100 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:21,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:21,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:21,318 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1515993891, now seen corresponding path program 1 times [2022-02-21 03:06:21,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:21,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506254201] [2022-02-21 03:06:21,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:21,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume 1 == ~n;#res := 1; {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,370 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1288#true} #47#return; {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:06:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#true} assume ~n < 1;#res := 0; {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #49#return; {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:21,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#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); {1288#true} is VALID [2022-02-21 03:06:21,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1288#true} is VALID [2022-02-21 03:06:21,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(main_~x~0#1 < 1); {1288#true} is VALID [2022-02-21 03:06:21,402 INFO L272 TraceCheckUtils]: 3: Hoare triple {1288#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1288#true} is VALID [2022-02-21 03:06:21,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {1288#true} assume !(1 == ~n); {1288#true} is VALID [2022-02-21 03:06:21,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1288#true} assume ~n - 1 <= 2147483647; {1288#true} is VALID [2022-02-21 03:06:21,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#true} assume ~n - 1 >= -2147483648; {1288#true} is VALID [2022-02-21 03:06:21,403 INFO L272 TraceCheckUtils]: 9: Hoare triple {1288#true} call #t~ret4 := fibonacci(~n - 1); {1288#true} is VALID [2022-02-21 03:06:21,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {1288#true} assume 1 == ~n;#res := 1; {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,405 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1301#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1288#true} #47#return; {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:21,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:21,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 <= 2147483647; {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:21,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 >= -2147483648; {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:06:21,406 INFO L272 TraceCheckUtils]: 18: Hoare triple {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} call #t~ret5 := fibonacci(~n - 2); {1288#true} is VALID [2022-02-21 03:06:21,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {1288#true} assume ~n < 1;#res := 0; {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:21,408 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1302#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {1295#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #49#return; {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:21,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:21,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume #t~ret4 + #t~ret5 <= 2147483647; {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:06:21,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {1289#false} is VALID [2022-02-21 03:06:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:06:21,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:21,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506254201] [2022-02-21 03:06:21,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506254201] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:21,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911311365] [2022-02-21 03:06:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:21,412 INFO L229 MonitoredProcess]: Starting monitored process 4 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:06:21,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:06:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:06:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:21,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:21,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#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); {1288#true} is VALID [2022-02-21 03:06:21,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1288#true} is VALID [2022-02-21 03:06:21,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(main_~x~0#1 < 1); {1288#true} is VALID [2022-02-21 03:06:21,558 INFO L272 TraceCheckUtils]: 3: Hoare triple {1288#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1288#true} is VALID [2022-02-21 03:06:21,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {1288#true} assume !(1 == ~n); {1288#true} is VALID [2022-02-21 03:06:21,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {1288#true} assume ~n - 1 <= 2147483647; {1288#true} is VALID [2022-02-21 03:06:21,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#true} assume ~n - 1 >= -2147483648; {1288#true} is VALID [2022-02-21 03:06:21,561 INFO L272 TraceCheckUtils]: 9: Hoare triple {1288#true} call #t~ret4 := fibonacci(~n - 1); {1288#true} is VALID [2022-02-21 03:06:21,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1288#true} assume 1 == ~n;#res := 1; {1342#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:21,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {1342#(<= 1 |fibonacci_#res|)} assume true; {1342#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:21,565 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1342#(<= 1 |fibonacci_#res|)} {1288#true} #47#return; {1349#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {1349#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1349#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {1349#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {1349#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {1349#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {1349#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,566 INFO L272 TraceCheckUtils]: 18: Hoare triple {1349#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {1288#true} is VALID [2022-02-21 03:06:21,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {1288#true} assume ~n < 1;#res := 0; {1288#true} is VALID [2022-02-21 03:06:21,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-02-21 03:06:21,567 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1288#true} {1349#(<= 1 |fibonacci_#t~ret4|)} #49#return; {1349#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {1349#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1377#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} is VALID [2022-02-21 03:06:21,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {1377#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} assume #t~ret4 + #t~ret5 <= 2147483647; {1377#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} is VALID [2022-02-21 03:06:21,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {1377#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {1289#false} is VALID [2022-02-21 03:06:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:06:21,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:21,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {1384#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {1289#false} is VALID [2022-02-21 03:06:21,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {1384#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume #t~ret4 + #t~ret5 <= 2147483647; {1384#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:21,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {1391#(<= 0 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1384#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:21,714 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1288#true} {1391#(<= 0 |fibonacci_#t~ret4|)} #49#return; {1391#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#true} assume true; {1288#true} is VALID [2022-02-21 03:06:21,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {1288#true} assume ~n < 1;#res := 0; {1288#true} is VALID [2022-02-21 03:06:21,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,714 INFO L272 TraceCheckUtils]: 18: Hoare triple {1391#(<= 0 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {1288#true} is VALID [2022-02-21 03:06:21,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {1391#(<= 0 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {1391#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {1391#(<= 0 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {1391#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {1391#(<= 0 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1391#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,716 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1422#(<= 0 |fibonacci_#res|)} {1288#true} #47#return; {1391#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {1422#(<= 0 |fibonacci_#res|)} assume true; {1422#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {1288#true} assume 1 == ~n;#res := 1; {1422#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L272 TraceCheckUtils]: 9: Hoare triple {1288#true} call #t~ret4 := fibonacci(~n - 1); {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#true} assume ~n - 1 >= -2147483648; {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {1288#true} assume ~n - 1 <= 2147483647; {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {1288#true} assume !(1 == ~n); {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#true} assume !(~n < 1); {1288#true} is VALID [2022-02-21 03:06:21,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {1288#true} ~n := #in~n; {1288#true} is VALID [2022-02-21 03:06:21,718 INFO L272 TraceCheckUtils]: 3: Hoare triple {1288#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1288#true} is VALID [2022-02-21 03:06:21,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(main_~x~0#1 < 1); {1288#true} is VALID [2022-02-21 03:06:21,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1288#true} is VALID [2022-02-21 03:06:21,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#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); {1288#true} is VALID [2022-02-21 03:06:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:06:21,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911311365] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:21,718 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:21,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-02-21 03:06:21,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675172202] [2022-02-21 03:06:21,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2022-02-21 03:06:21,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:21,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:21,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:21,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:06:21,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:06:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:06:21,753 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:21,950 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-02-21 03:06:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:06:21,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2022-02-21 03:06:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-02-21 03:06:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-02-21 03:06:21,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2022-02-21 03:06:21,993 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:06:21,996 INFO L225 Difference]: With dead ends: 70 [2022-02-21 03:06:21,996 INFO L226 Difference]: Without dead ends: 69 [2022-02-21 03:06:21,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:06:21,997 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:21,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-21 03:06:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-21 03:06:22,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:22,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:06:22,023 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:06:22,023 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:06:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,025 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-02-21 03:06:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-02-21 03:06:22,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:22,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:22,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) Second operand 69 states. [2022-02-21 03:06:22,027 INFO L87 Difference]: Start difference. First operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) Second operand 69 states. [2022-02-21 03:06:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:22,029 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-02-21 03:06:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-02-21 03:06:22,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:22,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:22,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:22,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:06:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2022-02-21 03:06:22,032 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 26 [2022-02-21 03:06:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:22,033 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2022-02-21 03:06:22,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:06:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-02-21 03:06:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:06:22,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:22,033 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:22,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:22,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:22,250 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:22,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -263295008, now seen corresponding path program 1 times [2022-02-21 03:06:22,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:22,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203971290] [2022-02-21 03:06:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,337 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#true} assume ~n < 1;#res := 0; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1804#(<= |fibonacci_#res| 0)} assume true; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1804#(<= |fibonacci_#res| 0)} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L272 TraceCheckUtils]: 5: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,352 INFO L272 TraceCheckUtils]: 14: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:22,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#true} assume ~n < 1;#res := 0; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {1804#(<= |fibonacci_#res| 0)} assume true; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,354 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1804#(<= |fibonacci_#res| 0)} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-21 03:06:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:22,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:22,371 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1792#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#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); {1760#true} is VALID [2022-02-21 03:06:22,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1760#true} is VALID [2022-02-21 03:06:22,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume !(main_~x~0#1 < 1); {1760#true} is VALID [2022-02-21 03:06:22,371 INFO L272 TraceCheckUtils]: 3: Hoare triple {1760#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1760#true} is VALID [2022-02-21 03:06:22,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L272 TraceCheckUtils]: 9: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L272 TraceCheckUtils]: 15: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:22,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,374 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,375 INFO L272 TraceCheckUtils]: 24: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:22,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {1760#true} assume ~n < 1;#res := 0; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {1804#(<= |fibonacci_#res| 0)} assume true; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,376 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1804#(<= |fibonacci_#res| 0)} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:22,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {1802#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,378 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,378 INFO L272 TraceCheckUtils]: 37: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:22,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:22,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:22,383 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1805#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1792#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {1792#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1792#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {1792#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1761#false} is VALID [2022-02-21 03:06:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-21 03:06:22,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:22,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203971290] [2022-02-21 03:06:22,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203971290] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:22,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436547158] [2022-02-21 03:06:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:22,386 INFO L229 MonitoredProcess]: Starting monitored process 5 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:06:22,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:06:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:06:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:22,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:22,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#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); {1760#true} is VALID [2022-02-21 03:06:22,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1760#true} is VALID [2022-02-21 03:06:22,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume !(main_~x~0#1 < 1); {1760#true} is VALID [2022-02-21 03:06:22,640 INFO L272 TraceCheckUtils]: 3: Hoare triple {1760#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1760#true} is VALID [2022-02-21 03:06:22,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L272 TraceCheckUtils]: 9: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:22,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:22,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:22,642 INFO L272 TraceCheckUtils]: 15: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:22,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,643 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,647 INFO L272 TraceCheckUtils]: 24: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:22,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {1760#true} assume ~n < 1;#res := 0; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {1804#(<= |fibonacci_#res| 0)} assume true; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:22,648 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1804#(<= |fibonacci_#res| 0)} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1893#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {1893#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1893#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {1893#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {1893#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {1893#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,651 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1760#true} #47#return; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1786#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:22,652 INFO L272 TraceCheckUtils]: 37: Hoare triple {1786#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:22,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:22,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:22,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:22,653 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1786#(<= |fibonacci_#t~ret4| 1)} #49#return; {1936#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {1936#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1936#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:22,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {1936#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1761#false} is VALID [2022-02-21 03:06:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-21 03:06:22,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:23,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1761#false} is VALID [2022-02-21 03:06:23,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1943#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} is VALID [2022-02-21 03:06:23,220 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1803#(<= |fibonacci_#res| 1)} {1950#(<= |fibonacci_#t~ret4| 2147483646)} #49#return; {1943#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} is VALID [2022-02-21 03:06:23,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {1803#(<= |fibonacci_#res| 1)} assume true; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:23,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1803#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:23,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:23,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:23,221 INFO L272 TraceCheckUtils]: 37: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:23,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 >= -2147483648; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 <= 2147483647; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,232 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1981#(<= |fibonacci_#res| 2147483646)} {1760#true} #47#return; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {1981#(<= |fibonacci_#res| 2147483646)} assume true; {1981#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:06:23,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {1988#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1981#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:06:23,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {1988#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} assume #t~ret4 + #t~ret5 <= 2147483647; {1988#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} is VALID [2022-02-21 03:06:23,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {1988#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1988#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} is VALID [2022-02-21 03:06:23,240 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1804#(<= |fibonacci_#res| 0)} {1950#(<= |fibonacci_#t~ret4| 2147483646)} #49#return; {1988#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} is VALID [2022-02-21 03:06:23,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {1804#(<= |fibonacci_#res| 0)} assume true; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:23,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {1760#true} assume ~n < 1;#res := 0; {1804#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:23,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:23,241 INFO L272 TraceCheckUtils]: 24: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} call #t~ret5 := fibonacci(~n - 2); {1760#true} is VALID [2022-02-21 03:06:23,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 >= -2147483648; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 <= 2147483647; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {1950#(<= |fibonacci_#t~ret4| 2147483646)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,244 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1981#(<= |fibonacci_#res| 2147483646)} {1760#true} #47#return; {1950#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:06:23,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {1981#(<= |fibonacci_#res| 2147483646)} assume true; {1981#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:06:23,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1760#true} assume 1 == ~n;#res := 1; {1981#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:06:23,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:23,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:23,244 INFO L272 TraceCheckUtils]: 15: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L272 TraceCheckUtils]: 9: Hoare triple {1760#true} call #t~ret4 := fibonacci(~n - 1); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1760#true} assume ~n - 1 >= -2147483648; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {1760#true} assume ~n - 1 <= 2147483647; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1760#true} assume !(1 == ~n); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1760#true} assume !(~n < 1); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {1760#true} ~n := #in~n; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L272 TraceCheckUtils]: 3: Hoare triple {1760#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume !(main_~x~0#1 < 1); {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1760#true} is VALID [2022-02-21 03:06:23,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#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); {1760#true} is VALID [2022-02-21 03:06:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-21 03:06:23,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436547158] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:23,246 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:23,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-02-21 03:06:23,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623972973] [2022-02-21 03:06:23,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-02-21 03:06:23,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:23,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:06:23,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:23,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:06:23,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:06:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:06:23,287 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:06:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,617 INFO L93 Difference]: Finished difference Result 138 states and 205 transitions. [2022-02-21 03:06:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-21 03:06:23,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-02-21 03:06:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:06:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 87 transitions. [2022-02-21 03:06:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:06:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 87 transitions. [2022-02-21 03:06:23,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 87 transitions. [2022-02-21 03:06:23,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:23,689 INFO L225 Difference]: With dead ends: 138 [2022-02-21 03:06:23,689 INFO L226 Difference]: Without dead ends: 137 [2022-02-21 03:06:23,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:06:23,690 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:23,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 128 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-21 03:06:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2022-02-21 03:06:23,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:23,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:23,731 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:23,732 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,738 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2022-02-21 03:06:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2022-02-21 03:06:23,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:23,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:23,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 137 states. [2022-02-21 03:06:23,740 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 137 states. [2022-02-21 03:06:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:23,747 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2022-02-21 03:06:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2022-02-21 03:06:23,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:23,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:23,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:23,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2022-02-21 03:06:23,754 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 45 [2022-02-21 03:06:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:23,755 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2022-02-21 03:06:23,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:06:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-21 03:06:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-21 03:06:23,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:23,756 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:06:23,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:23,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:23,973 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:23,973 INFO L85 PathProgramCache]: Analyzing trace with hash -904137505, now seen corresponding path program 1 times [2022-02-21 03:06:23,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:23,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063040031] [2022-02-21 03:06:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:23,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-21 03:06:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume !(1 == ~n); {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {2629#true} assume ~n - 1 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {2629#true} assume ~n - 1 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L272 TraceCheckUtils]: 5: Hoare triple {2629#true} call #t~ret4 := fibonacci(~n - 1); {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {2629#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {2629#true} assume ~n - 2 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} assume ~n - 2 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {2629#true} call #t~ret5 := fibonacci(~n - 2); {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-21 03:06:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume !(1 == ~n); {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {2629#true} assume ~n - 1 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {2629#true} assume ~n - 1 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L272 TraceCheckUtils]: 5: Hoare triple {2629#true} call #t~ret4 := fibonacci(~n - 1); {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(1 == ~n); {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume ~n - 1 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {2629#true} assume ~n - 1 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {2629#true} call #t~ret4 := fibonacci(~n - 1); {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {2629#true} assume ~n - 2 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} assume ~n - 2 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L272 TraceCheckUtils]: 19: Hoare triple {2629#true} call #t~ret5 := fibonacci(~n - 2); {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {2629#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {2629#true} assume ~n - 2 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {2629#true} assume ~n - 2 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L272 TraceCheckUtils]: 32: Hoare triple {2629#true} call #t~ret5 := fibonacci(~n - 2); {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {2629#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-21 03:06:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume 1 == ~n;#res := 1; {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,079 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #49#return; {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:24,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#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); {2629#true} is VALID [2022-02-21 03:06:24,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2629#true} is VALID [2022-02-21 03:06:24,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume !(main_~x~0#1 < 1); {2629#true} is VALID [2022-02-21 03:06:24,080 INFO L272 TraceCheckUtils]: 3: Hoare triple {2629#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2629#true} is VALID [2022-02-21 03:06:24,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {2629#true} assume !(1 == ~n); {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} assume ~n - 1 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume ~n - 1 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L272 TraceCheckUtils]: 9: Hoare triple {2629#true} call #t~ret4 := fibonacci(~n - 1); {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} assume !(1 == ~n); {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume ~n - 1 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume ~n - 1 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,081 INFO L272 TraceCheckUtils]: 15: Hoare triple {2629#true} call #t~ret4 := fibonacci(~n - 1); {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} assume !(1 == ~n); {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume ~n - 1 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume ~n - 1 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L272 TraceCheckUtils]: 21: Hoare triple {2629#true} call #t~ret4 := fibonacci(~n - 1); {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {2629#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {2629#true} assume ~n - 2 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {2629#true} assume ~n - 2 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L272 TraceCheckUtils]: 29: Hoare triple {2629#true} call #t~ret5 := fibonacci(~n - 2); {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume ~n - 2 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {2629#true} assume ~n - 2 >= -2147483648; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L272 TraceCheckUtils]: 42: Hoare triple {2629#true} call #t~ret5 := fibonacci(~n - 2); {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {2629#true} assume ~n < 1;#res := 0; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2629#true} {2629#true} #49#return; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {2629#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2629#true} is VALID [2022-02-21 03:06:24,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {2629#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2629#true} is VALID [2022-02-21 03:06:24,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-02-21 03:06:24,086 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2629#true} {2629#true} #47#return; {2629#true} is VALID [2022-02-21 03:06:24,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {2629#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:24,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 <= 2147483647; {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:24,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 >= -2147483648; {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:24,087 INFO L272 TraceCheckUtils]: 55: Hoare triple {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} call #t~ret5 := fibonacci(~n - 2); {2629#true} is VALID [2022-02-21 03:06:24,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {2629#true} ~n := #in~n; {2629#true} is VALID [2022-02-21 03:06:24,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {2629#true} assume !(~n < 1); {2629#true} is VALID [2022-02-21 03:06:24,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {2629#true} assume 1 == ~n;#res := 1; {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,088 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2715#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {2673#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #49#return; {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:24,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:24,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume #t~ret4 + #t~ret5 <= 2147483647; {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:06:24,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {2679#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {2630#false} is VALID [2022-02-21 03:06:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-21 03:06:24,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:24,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063040031] [2022-02-21 03:06:24,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063040031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:24,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:24,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:24,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184322368] [2022-02-21 03:06:24,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2022-02-21 03:06:24,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:24,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:24,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:24,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:24,108 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,211 INFO L93 Difference]: Finished difference Result 112 states and 174 transitions. [2022-02-21 03:06:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:06:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2022-02-21 03:06:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:06:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:06:24,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-21 03:06:24,231 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:06:24,234 INFO L225 Difference]: With dead ends: 112 [2022-02-21 03:06:24,234 INFO L226 Difference]: Without dead ends: 111 [2022-02-21 03:06:24,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:24,235 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:24,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-21 03:06:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-02-21 03:06:24,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:24,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,276 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,276 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,281 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:06:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:06:24,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:24,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:24,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:06:24,283 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:06:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,294 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:06:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:06:24,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:24,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:24,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:24,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2022-02-21 03:06:24,301 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 64 [2022-02-21 03:06:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:24,301 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2022-02-21 03:06:24,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-21 03:06:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-21 03:06:24,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:24,302 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:06:24,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:06:24,302 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash 53232581, now seen corresponding path program 2 times [2022-02-21 03:06:24,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:24,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391828884] [2022-02-21 03:06:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,368 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} assume ~n < 1;#res := 0; {3177#true} is VALID [2022-02-21 03:06:24,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume !(1 == ~n); {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {3177#true} assume ~n - 1 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {3177#true} assume ~n - 1 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L272 TraceCheckUtils]: 5: Hoare triple {3177#true} call #t~ret4 := fibonacci(~n - 1); {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {3177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {3177#true} assume ~n - 2 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {3177#true} assume ~n - 2 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,375 INFO L272 TraceCheckUtils]: 14: Hoare triple {3177#true} call #t~ret5 := fibonacci(~n - 2); {3177#true} is VALID [2022-02-21 03:06:24,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {3177#true} assume ~n < 1;#res := 0; {3177#true} is VALID [2022-02-21 03:06:24,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,377 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {3177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3177#true} is VALID [2022-02-21 03:06:24,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,378 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,383 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume !(1 == ~n); {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {3177#true} assume ~n - 1 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {3177#true} assume ~n - 1 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L272 TraceCheckUtils]: 5: Hoare triple {3177#true} call #t~ret4 := fibonacci(~n - 1); {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {3177#true} assume !(1 == ~n); {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {3177#true} assume ~n - 1 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {3177#true} assume ~n - 1 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L272 TraceCheckUtils]: 11: Hoare triple {3177#true} call #t~ret4 := fibonacci(~n - 1); {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,385 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {3177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {3177#true} assume ~n - 2 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {3177#true} assume ~n - 2 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L272 TraceCheckUtils]: 20: Hoare triple {3177#true} call #t~ret5 := fibonacci(~n - 2); {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {3177#true} assume ~n < 1;#res := 0; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,386 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {3177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {3177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {3177#true} assume ~n - 2 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {3177#true} assume ~n - 2 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L272 TraceCheckUtils]: 33: Hoare triple {3177#true} call #t~ret5 := fibonacci(~n - 2); {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {3177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3177#true} is VALID [2022-02-21 03:06:24,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,389 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-21 03:06:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#true} assume ~n < 1;#res := 0; {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #49#return; {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:06:24,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {3177#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); {3177#true} is VALID [2022-02-21 03:06:24,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3177#true} is VALID [2022-02-21 03:06:24,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume !(main_~x~0#1 < 1); {3177#true} is VALID [2022-02-21 03:06:24,431 INFO L272 TraceCheckUtils]: 3: Hoare triple {3177#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3177#true} is VALID [2022-02-21 03:06:24,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !(1 == ~n); {3177#true} is VALID [2022-02-21 03:06:24,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume ~n - 1 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {3177#true} assume ~n - 1 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L272 TraceCheckUtils]: 9: Hoare triple {3177#true} call #t~ret4 := fibonacci(~n - 1); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {3177#true} assume !(1 == ~n); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {3177#true} assume ~n - 1 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {3177#true} assume ~n - 1 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L272 TraceCheckUtils]: 15: Hoare triple {3177#true} call #t~ret4 := fibonacci(~n - 1); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {3177#true} assume !(1 == ~n); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {3177#true} assume ~n - 1 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {3177#true} assume ~n - 1 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L272 TraceCheckUtils]: 21: Hoare triple {3177#true} call #t~ret4 := fibonacci(~n - 1); {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {3177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {3177#true} assume ~n - 2 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {3177#true} assume ~n - 2 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L272 TraceCheckUtils]: 30: Hoare triple {3177#true} call #t~ret5 := fibonacci(~n - 2); {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {3177#true} assume ~n < 1;#res := 0; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {3177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,433 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {3177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {3177#true} assume ~n - 2 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {3177#true} assume ~n - 2 >= -2147483648; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L272 TraceCheckUtils]: 43: Hoare triple {3177#true} call #t~ret5 := fibonacci(~n - 2); {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {3177#true} assume !(~n < 1); {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {3177#true} assume 1 == ~n;#res := 1; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3177#true} {3177#true} #49#return; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {3177#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {3177#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-02-21 03:06:24,434 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3177#true} {3177#true} #47#return; {3177#true} is VALID [2022-02-21 03:06:24,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {3177#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:24,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 <= 2147483647; {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:24,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 >= -2147483648; {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:24,448 INFO L272 TraceCheckUtils]: 57: Hoare triple {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} call #t~ret5 := fibonacci(~n - 2); {3177#true} is VALID [2022-02-21 03:06:24,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2022-02-21 03:06:24,449 INFO L290 TraceCheckUtils]: 59: Hoare triple {3177#true} assume ~n < 1;#res := 0; {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:06:24,450 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3267#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {3223#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #49#return; {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:06:24,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:06:24,450 INFO L290 TraceCheckUtils]: 63: Hoare triple {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} assume #t~ret4 + #t~ret5 <= 2147483647; {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:06:24,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {3228#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {3178#false} is VALID [2022-02-21 03:06:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-02-21 03:06:24,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:24,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391828884] [2022-02-21 03:06:24,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391828884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:06:24,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:06:24,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:06:24,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304623787] [2022-02-21 03:06:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:06:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-02-21 03:06:24,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:24,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:24,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:06:24,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:06:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:24,471 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,569 INFO L93 Difference]: Finished difference Result 112 states and 174 transitions. [2022-02-21 03:06:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:06:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-02-21 03:06:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:06:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:06:24,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-02-21 03:06:24,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:24,592 INFO L225 Difference]: With dead ends: 112 [2022-02-21 03:06:24,592 INFO L226 Difference]: Without dead ends: 111 [2022-02-21 03:06:24,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:06:24,593 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:24,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-21 03:06:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-02-21 03:06:24,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:24,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,632 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,632 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,637 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:06:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:06:24,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:24,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:24,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:06:24,639 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:06:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:24,644 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:06:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:06:24,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:24,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:24,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:24,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:06:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2022-02-21 03:06:24,650 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 65 [2022-02-21 03:06:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:24,651 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2022-02-21 03:06:24,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:06:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-21 03:06:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-21 03:06:24,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:24,652 INFO L514 BasicCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 1, 1, 1, 1, 1] [2022-02-21 03:06:24,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:06:24,652 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash -498924056, now seen corresponding path program 2 times [2022-02-21 03:06:24,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:24,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898506208] [2022-02-21 03:06:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:06:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:24,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {3851#(<= |fibonacci_#in~n| 1)} assume true; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:24,766 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3851#(<= |fibonacci_#in~n| 1)} {3839#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3729#true} {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,772 INFO L272 TraceCheckUtils]: 5: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:24,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#(<= |fibonacci_#in~n| 1)} assume true; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:24,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3851#(<= |fibonacci_#in~n| 1)} {3839#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,775 INFO L272 TraceCheckUtils]: 14: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,776 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3729#true} {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume true; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,777 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3850#(<= |fibonacci_#in~n| 2)} {3729#true} #47#return; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-21 03:06:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,841 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L272 TraceCheckUtils]: 5: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L272 TraceCheckUtils]: 14: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,847 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3729#true} {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,873 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L272 TraceCheckUtils]: 5: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L272 TraceCheckUtils]: 14: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:24,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,883 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L272 TraceCheckUtils]: 5: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,885 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L272 TraceCheckUtils]: 20: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,887 INFO L272 TraceCheckUtils]: 33: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,889 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3729#true} {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3852#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {3852#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,891 INFO L272 TraceCheckUtils]: 5: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L272 TraceCheckUtils]: 11: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L272 TraceCheckUtils]: 20: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,894 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,895 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3729#true} {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,896 INFO L272 TraceCheckUtils]: 33: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,896 INFO L272 TraceCheckUtils]: 39: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L272 TraceCheckUtils]: 45: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L272 TraceCheckUtils]: 54: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L290 TraceCheckUtils]: 61: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L272 TraceCheckUtils]: 67: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 68: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 69: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 70: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 71: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,900 INFO L290 TraceCheckUtils]: 73: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,901 INFO L290 TraceCheckUtils]: 76: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,902 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3729#true} {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,903 INFO L290 TraceCheckUtils]: 81: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume true; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,903 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {3922#(<= 2 |fibonacci_#in~n|)} {3755#(<= fibonacci_~n 3)} #49#return; {3730#false} is VALID [2022-02-21 03:06:24,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#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); {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume !(main_~x~0#1 < 1); {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L272 TraceCheckUtils]: 3: Hoare triple {3729#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,904 INFO L272 TraceCheckUtils]: 9: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L272 TraceCheckUtils]: 15: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,907 INFO L272 TraceCheckUtils]: 21: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:24,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {3851#(<= |fibonacci_#in~n| 1)} assume true; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:24,910 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3851#(<= |fibonacci_#in~n| 1)} {3839#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,911 INFO L272 TraceCheckUtils]: 30: Hoare triple {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,912 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3729#true} {3845#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume true; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:24,914 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3850#(<= |fibonacci_#in~n| 2)} {3729#true} #47#return; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:24,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {3755#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:24,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {3755#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:24,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {3755#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:24,914 INFO L272 TraceCheckUtils]: 43: Hoare triple {3755#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#true} ~n := #in~n; {3839#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {3839#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3852#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {3852#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,916 INFO L272 TraceCheckUtils]: 49: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L272 TraceCheckUtils]: 55: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L272 TraceCheckUtils]: 64: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 70: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 71: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,917 INFO L290 TraceCheckUtils]: 72: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,918 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3729#true} {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,918 INFO L290 TraceCheckUtils]: 74: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:24,919 INFO L272 TraceCheckUtils]: 77: Hoare triple {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 78: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L272 TraceCheckUtils]: 83: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 84: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 85: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,919 INFO L290 TraceCheckUtils]: 86: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 87: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 88: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L272 TraceCheckUtils]: 89: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 95: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 96: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 97: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L272 TraceCheckUtils]: 98: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 99: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 100: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:24,920 INFO L290 TraceCheckUtils]: 101: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 103: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 104: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 105: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 106: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 108: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 109: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 110: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L272 TraceCheckUtils]: 111: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 112: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 113: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 114: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 115: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:24,921 INFO L290 TraceCheckUtils]: 117: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:24,922 INFO L290 TraceCheckUtils]: 119: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:24,922 INFO L290 TraceCheckUtils]: 120: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:24,928 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {3729#true} {3853#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,928 INFO L290 TraceCheckUtils]: 122: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,929 INFO L290 TraceCheckUtils]: 123: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,929 INFO L290 TraceCheckUtils]: 124: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,929 INFO L290 TraceCheckUtils]: 125: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume true; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:24,930 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {3922#(<= 2 |fibonacci_#in~n|)} {3755#(<= fibonacci_~n 3)} #49#return; {3730#false} is VALID [2022-02-21 03:06:24,930 INFO L290 TraceCheckUtils]: 127: Hoare triple {3730#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3730#false} is VALID [2022-02-21 03:06:24,930 INFO L290 TraceCheckUtils]: 128: Hoare triple {3730#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {3730#false} is VALID [2022-02-21 03:06:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 73 proven. 158 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-02-21 03:06:24,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:24,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898506208] [2022-02-21 03:06:24,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898506208] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:24,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413245628] [2022-02-21 03:06:24,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:06:24,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:24,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:24,948 INFO L229 MonitoredProcess]: Starting monitored process 6 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:06:24,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:06:25,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:06:25,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:25,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:06:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:25,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:25,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#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); {3729#true} is VALID [2022-02-21 03:06:25,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3729#true} is VALID [2022-02-21 03:06:25,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume !(main_~x~0#1 < 1); {3729#true} is VALID [2022-02-21 03:06:25,411 INFO L272 TraceCheckUtils]: 3: Hoare triple {3729#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3729#true} is VALID [2022-02-21 03:06:25,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L272 TraceCheckUtils]: 9: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:25,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:25,413 INFO L272 TraceCheckUtils]: 15: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#true} ~n := #in~n; {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,414 INFO L272 TraceCheckUtils]: 21: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} ~n := #in~n; {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {4021#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:25,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {4021#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:25,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {3851#(<= |fibonacci_#in~n| 1)} assume true; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:25,416 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3851#(<= |fibonacci_#in~n| 1)} {4021#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,417 INFO L272 TraceCheckUtils]: 30: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:25,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:25,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,418 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3729#true} {3850#(<= |fibonacci_#in~n| 2)} #49#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume true; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:25,420 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3850#(<= |fibonacci_#in~n| 2)} {3729#true} #47#return; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:25,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {3755#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:25,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {3755#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:25,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {3755#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:25,421 INFO L272 TraceCheckUtils]: 43: Hoare triple {3755#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:25,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#true} ~n := #in~n; {4106#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {4106#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4106#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {4106#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4106#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {4106#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4106#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {4106#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4106#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,422 INFO L272 TraceCheckUtils]: 49: Hoare triple {4106#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {3729#true} ~n := #in~n; {4106#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {4106#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,424 INFO L272 TraceCheckUtils]: 55: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:25,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,425 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3729#true} {4128#(<= 1 |fibonacci_#in~n|)} #47#return; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,426 INFO L272 TraceCheckUtils]: 64: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:25,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:25,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,427 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3729#true} {4128#(<= 1 |fibonacci_#in~n|)} #49#return; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume true; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,429 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4128#(<= 1 |fibonacci_#in~n|)} {4106#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,429 INFO L290 TraceCheckUtils]: 74: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,430 INFO L290 TraceCheckUtils]: 75: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,430 INFO L272 TraceCheckUtils]: 77: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:25,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,430 INFO L290 TraceCheckUtils]: 79: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 81: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 82: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L272 TraceCheckUtils]: 83: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 84: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 85: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 86: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:25,431 INFO L290 TraceCheckUtils]: 87: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 88: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L272 TraceCheckUtils]: 89: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 90: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 91: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 92: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 93: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 95: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,432 INFO L290 TraceCheckUtils]: 96: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L290 TraceCheckUtils]: 97: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L272 TraceCheckUtils]: 98: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L290 TraceCheckUtils]: 99: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L290 TraceCheckUtils]: 100: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L290 TraceCheckUtils]: 101: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L290 TraceCheckUtils]: 103: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,433 INFO L290 TraceCheckUtils]: 104: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L290 TraceCheckUtils]: 105: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L290 TraceCheckUtils]: 106: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L290 TraceCheckUtils]: 108: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L290 TraceCheckUtils]: 109: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L290 TraceCheckUtils]: 110: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:25,434 INFO L272 TraceCheckUtils]: 111: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 112: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 113: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 114: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 115: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 117: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 118: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 119: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:25,435 INFO L290 TraceCheckUtils]: 120: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:25,438 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {3729#true} {3922#(<= 2 |fibonacci_#in~n|)} #49#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,439 INFO L290 TraceCheckUtils]: 122: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,439 INFO L290 TraceCheckUtils]: 123: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,439 INFO L290 TraceCheckUtils]: 124: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,439 INFO L290 TraceCheckUtils]: 125: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume true; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:25,440 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {3922#(<= 2 |fibonacci_#in~n|)} {3755#(<= fibonacci_~n 3)} #49#return; {3730#false} is VALID [2022-02-21 03:06:25,440 INFO L290 TraceCheckUtils]: 127: Hoare triple {3730#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3730#false} is VALID [2022-02-21 03:06:25,440 INFO L290 TraceCheckUtils]: 128: Hoare triple {3730#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {3730#false} is VALID [2022-02-21 03:06:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 85 proven. 206 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-02-21 03:06:25,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:26,521 INFO L290 TraceCheckUtils]: 128: Hoare triple {3730#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {3730#false} is VALID [2022-02-21 03:06:26,521 INFO L290 TraceCheckUtils]: 127: Hoare triple {3730#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3730#false} is VALID [2022-02-21 03:06:26,522 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {3922#(<= 2 |fibonacci_#in~n|)} {3755#(<= fibonacci_~n 3)} #49#return; {3730#false} is VALID [2022-02-21 03:06:26,522 INFO L290 TraceCheckUtils]: 125: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume true; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,523 INFO L290 TraceCheckUtils]: 124: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,523 INFO L290 TraceCheckUtils]: 123: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,523 INFO L290 TraceCheckUtils]: 122: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,524 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {3729#true} {3922#(<= 2 |fibonacci_#in~n|)} #49#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 120: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 119: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 118: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 117: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 115: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 114: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 113: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 112: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L272 TraceCheckUtils]: 111: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:26,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 109: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 108: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 106: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 105: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 104: Hoare triple {3729#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 103: Hoare triple {3729#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {3729#true} {3729#true} #49#return; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 100: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L272 TraceCheckUtils]: 98: Hoare triple {3729#true} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 97: Hoare triple {3729#true} assume ~n - 2 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 96: Hoare triple {3729#true} assume ~n - 2 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 95: Hoare triple {3729#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3729#true} {3729#true} #47#return; {3729#true} is VALID [2022-02-21 03:06:26,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:26,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,526 INFO L272 TraceCheckUtils]: 89: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 84: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L272 TraceCheckUtils]: 83: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 82: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 81: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 79: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,530 INFO L272 TraceCheckUtils]: 77: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:26,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,532 INFO L290 TraceCheckUtils]: 74: Hoare triple {3922#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,532 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4128#(<= 1 |fibonacci_#in~n|)} {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #47#return; {3922#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume true; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,534 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3729#true} {4128#(<= 1 |fibonacci_#in~n|)} #49#return; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:26,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,534 INFO L272 TraceCheckUtils]: 64: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:26,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,535 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3729#true} {4128#(<= 1 |fibonacci_#in~n|)} #47#return; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,536 INFO L290 TraceCheckUtils]: 58: Hoare triple {3729#true} assume 1 == ~n;#res := 1; {3729#true} is VALID [2022-02-21 03:06:26,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,536 INFO L272 TraceCheckUtils]: 55: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {4128#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {4598#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {4128#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:26,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {3729#true} ~n := #in~n; {4598#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:06:26,537 INFO L272 TraceCheckUtils]: 49: Hoare triple {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:26,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:26,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:26,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:26,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#true} ~n := #in~n; {4528#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:26,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {3755#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:26,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {3755#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:26,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {3755#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:26,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {3755#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:26,540 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3850#(<= |fibonacci_#in~n| 2)} {3729#true} #47#return; {3755#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:06:26,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume true; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,543 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3729#true} {3850#(<= |fibonacci_#in~n| 2)} #49#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {3729#true} assume true; {3729#true} is VALID [2022-02-21 03:06:26,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {3729#true} assume ~n < 1;#res := 0; {3729#true} is VALID [2022-02-21 03:06:26,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,543 INFO L272 TraceCheckUtils]: 30: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {3729#true} is VALID [2022-02-21 03:06:26,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {3850#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,553 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3851#(<= |fibonacci_#in~n| 1)} {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #47#return; {3850#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:26,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {3851#(<= |fibonacci_#in~n| 1)} assume true; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:26,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {4681#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {3851#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:26,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {4681#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {4681#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:26,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#true} ~n := #in~n; {4681#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:26,554 INFO L272 TraceCheckUtils]: 21: Hoare triple {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:26,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:26,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#true} ~n := #in~n; {4671#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:26,556 INFO L272 TraceCheckUtils]: 15: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L272 TraceCheckUtils]: 9: Hoare triple {3729#true} call #t~ret4 := fibonacci(~n - 1); {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {3729#true} assume ~n - 1 >= -2147483648; {3729#true} is VALID [2022-02-21 03:06:26,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {3729#true} assume ~n - 1 <= 2147483647; {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {3729#true} assume !(1 == ~n); {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {3729#true} assume !(~n < 1); {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {3729#true} ~n := #in~n; {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L272 TraceCheckUtils]: 3: Hoare triple {3729#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {3729#true} assume !(main_~x~0#1 < 1); {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {3729#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {3729#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); {3729#true} is VALID [2022-02-21 03:06:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 85 proven. 209 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-02-21 03:06:26,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413245628] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:26,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:26,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 17 [2022-02-21 03:06:26,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334602852] [2022-02-21 03:06:26,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) Word has length 129 [2022-02-21 03:06:39,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:39,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:06:39,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:39,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:06:39,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:06:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:06:39,376 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:06:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:39,767 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2022-02-21 03:06:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:06:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) Word has length 129 [2022-02-21 03:06:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:06:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-02-21 03:06:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:06:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-02-21 03:06:39,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2022-02-21 03:06:39,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:39,824 INFO L225 Difference]: With dead ends: 178 [2022-02-21 03:06:39,824 INFO L226 Difference]: Without dead ends: 83 [2022-02-21 03:06:39,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:06:39,826 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 163 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:39,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 57 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-21 03:06:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2022-02-21 03:06:39,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:39,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:06:39,856 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:06:39,856 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:06:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:39,858 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-02-21 03:06:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2022-02-21 03:06:39,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:39,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:39,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) Second operand 83 states. [2022-02-21 03:06:39,859 INFO L87 Difference]: Start difference. First operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) Second operand 83 states. [2022-02-21 03:06:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:39,861 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-02-21 03:06:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2022-02-21 03:06:39,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:39,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:39,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:39,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:06:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2022-02-21 03:06:39,864 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 129 [2022-02-21 03:06:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:39,864 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2022-02-21 03:06:39,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:06:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-02-21 03:06:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-21 03:06:39,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:39,867 INFO L514 BasicCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 1, 1, 1, 1, 1] [2022-02-21 03:06:39,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-21 03:06:40,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:06:40,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1709494790, now seen corresponding path program 3 times [2022-02-21 03:06:40,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:40,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224505819] [2022-02-21 03:06:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:06:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,210 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5342#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {5342#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5343#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {5343#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,221 INFO L272 TraceCheckUtils]: 5: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,223 INFO L272 TraceCheckUtils]: 14: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,224 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume true; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,226 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5354#(<= 2 |fibonacci_#in~n|)} {5204#true} #47#return; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5342#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {5342#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {5355#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:06:40,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {5355#(<= |fibonacci_#in~n| 0)} assume true; {5355#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:06:40,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5355#(<= |fibonacci_#in~n| 0)} {5337#(<= 3 fibonacci_~n)} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,239 INFO L272 TraceCheckUtils]: 5: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} ~n := #in~n; {5342#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {5342#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5343#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {5343#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,242 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,243 INFO L272 TraceCheckUtils]: 20: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,244 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume true; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,246 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5354#(<= 2 |fibonacci_#in~n|)} {5204#true} #47#return; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {5337#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {5337#(<= 3 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {5337#(<= 3 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,247 INFO L272 TraceCheckUtils]: 33: Hoare triple {5337#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {5204#true} ~n := #in~n; {5342#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {5342#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {5355#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:06:40,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {5355#(<= |fibonacci_#in~n| 0)} assume true; {5355#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:06:40,248 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5355#(<= |fibonacci_#in~n| 0)} {5337#(<= 3 fibonacci_~n)} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5205#false} is VALID [2022-02-21 03:06:40,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {5205#false} assume true; {5205#false} is VALID [2022-02-21 03:06:40,249 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5205#false} {5204#true} #47#return; {5205#false} is VALID [2022-02-21 03:06:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-21 03:06:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,284 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L272 TraceCheckUtils]: 5: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L272 TraceCheckUtils]: 14: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,289 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,290 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,293 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L272 TraceCheckUtils]: 5: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L272 TraceCheckUtils]: 20: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,297 INFO L272 TraceCheckUtils]: 33: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,299 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:06:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L272 TraceCheckUtils]: 5: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L272 TraceCheckUtils]: 17: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L272 TraceCheckUtils]: 26: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L272 TraceCheckUtils]: 39: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L272 TraceCheckUtils]: 53: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L290 TraceCheckUtils]: 59: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L290 TraceCheckUtils]: 60: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L290 TraceCheckUtils]: 61: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,309 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {5204#true} {5205#false} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#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); {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(main_~x~0#1 < 1); {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L272 TraceCheckUtils]: 3: Hoare triple {5204#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L272 TraceCheckUtils]: 9: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L272 TraceCheckUtils]: 15: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,312 INFO L272 TraceCheckUtils]: 21: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {5204#true} ~n := #in~n; {5342#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {5342#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5343#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {5343#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,314 INFO L272 TraceCheckUtils]: 27: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,315 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:40,316 INFO L272 TraceCheckUtils]: 36: Hoare triple {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,317 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5204#true} {5344#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {5354#(<= 2 |fibonacci_#in~n|)} assume true; {5354#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,319 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5354#(<= 2 |fibonacci_#in~n|)} {5204#true} #47#return; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {5337#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {5337#(<= 3 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {5337#(<= 3 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5337#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:06:40,320 INFO L272 TraceCheckUtils]: 49: Hoare triple {5337#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {5204#true} ~n := #in~n; {5342#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {5342#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {5355#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:06:40,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {5355#(<= |fibonacci_#in~n| 0)} assume true; {5355#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:06:40,321 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5355#(<= |fibonacci_#in~n| 0)} {5337#(<= 3 fibonacci_~n)} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5205#false} is VALID [2022-02-21 03:06:40,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {5205#false} assume true; {5205#false} is VALID [2022-02-21 03:06:40,322 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5205#false} {5204#true} #47#return; {5205#false} is VALID [2022-02-21 03:06:40,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {5205#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {5205#false} assume ~n - 2 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {5205#false} assume ~n - 2 >= -2147483648; {5205#false} is VALID [2022-02-21 03:06:40,322 INFO L272 TraceCheckUtils]: 62: Hoare triple {5205#false} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L272 TraceCheckUtils]: 68: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 71: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L272 TraceCheckUtils]: 74: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 77: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L272 TraceCheckUtils]: 80: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L272 TraceCheckUtils]: 89: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 90: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L290 TraceCheckUtils]: 94: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L290 TraceCheckUtils]: 95: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L290 TraceCheckUtils]: 96: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L290 TraceCheckUtils]: 97: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 100: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 101: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L272 TraceCheckUtils]: 102: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 103: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 104: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 106: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,327 INFO L290 TraceCheckUtils]: 108: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 109: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 110: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 111: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 113: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 114: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 115: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L272 TraceCheckUtils]: 116: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,328 INFO L290 TraceCheckUtils]: 117: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 118: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 119: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 120: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 122: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 123: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 124: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L290 TraceCheckUtils]: 125: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,329 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {5204#true} {5205#false} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,330 INFO L290 TraceCheckUtils]: 127: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,330 INFO L290 TraceCheckUtils]: 128: Hoare triple {5205#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {5205#false} is VALID [2022-02-21 03:06:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 55 proven. 134 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-02-21 03:06:40,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:40,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224505819] [2022-02-21 03:06:40,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224505819] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:40,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101484112] [2022-02-21 03:06:40,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:06:40,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:40,332 INFO L229 MonitoredProcess]: Starting monitored process 7 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:06:40,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:06:40,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-21 03:06:40,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:40,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:06:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:40,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#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); {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(main_~x~0#1 < 1); {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L272 TraceCheckUtils]: 3: Hoare triple {5204#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L272 TraceCheckUtils]: 9: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L272 TraceCheckUtils]: 15: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L272 TraceCheckUtils]: 21: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L272 TraceCheckUtils]: 27: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L272 TraceCheckUtils]: 36: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 46: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L272 TraceCheckUtils]: 49: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L272 TraceCheckUtils]: 62: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,745 INFO L272 TraceCheckUtils]: 68: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {5204#true} ~n := #in~n; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,761 INFO L272 TraceCheckUtils]: 74: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,761 INFO L290 TraceCheckUtils]: 75: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:40,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,761 INFO L290 TraceCheckUtils]: 79: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,761 INFO L272 TraceCheckUtils]: 80: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 81: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 82: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 83: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 84: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 86: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 87: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L290 TraceCheckUtils]: 88: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:40,762 INFO L272 TraceCheckUtils]: 89: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 90: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 91: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 92: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 94: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 95: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 96: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:40,763 INFO L290 TraceCheckUtils]: 97: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:40,764 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5204#true} {5653#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,764 INFO L290 TraceCheckUtils]: 99: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,765 INFO L290 TraceCheckUtils]: 100: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,765 INFO L290 TraceCheckUtils]: 101: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,765 INFO L272 TraceCheckUtils]: 102: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,765 INFO L290 TraceCheckUtils]: 103: Hoare triple {5204#true} ~n := #in~n; {5653#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,766 INFO L290 TraceCheckUtils]: 104: Hoare triple {5653#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5759#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,766 INFO L290 TraceCheckUtils]: 105: Hoare triple {5759#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {5759#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,766 INFO L290 TraceCheckUtils]: 106: Hoare triple {5759#(<= 1 |fibonacci_#in~n|)} assume true; {5759#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,767 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5759#(<= 1 |fibonacci_#in~n|)} {5653#(<= fibonacci_~n |fibonacci_#in~n|)} #49#return; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,767 INFO L290 TraceCheckUtils]: 108: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,768 INFO L290 TraceCheckUtils]: 109: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,768 INFO L290 TraceCheckUtils]: 110: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,768 INFO L290 TraceCheckUtils]: 111: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume true; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:40,769 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {5769#(<= 3 |fibonacci_#in~n|)} {5204#true} #47#return; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:40,769 INFO L290 TraceCheckUtils]: 113: Hoare triple {5785#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:40,769 INFO L290 TraceCheckUtils]: 114: Hoare triple {5785#(<= 4 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:40,769 INFO L290 TraceCheckUtils]: 115: Hoare triple {5785#(<= 4 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:40,770 INFO L272 TraceCheckUtils]: 116: Hoare triple {5785#(<= 4 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:40,770 INFO L290 TraceCheckUtils]: 117: Hoare triple {5204#true} ~n := #in~n; {5801#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:40,770 INFO L290 TraceCheckUtils]: 118: Hoare triple {5801#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {5801#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:40,771 INFO L290 TraceCheckUtils]: 119: Hoare triple {5801#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {5808#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:40,771 INFO L290 TraceCheckUtils]: 120: Hoare triple {5808#(<= |fibonacci_#in~n| 1)} assume true; {5808#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:40,771 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {5808#(<= |fibonacci_#in~n| 1)} {5785#(<= 4 fibonacci_~n)} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L290 TraceCheckUtils]: 122: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L290 TraceCheckUtils]: 123: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L290 TraceCheckUtils]: 124: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L290 TraceCheckUtils]: 125: Hoare triple {5205#false} assume true; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {5205#false} {5204#true} #49#return; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L290 TraceCheckUtils]: 127: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:40,772 INFO L290 TraceCheckUtils]: 128: Hoare triple {5205#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {5205#false} is VALID [2022-02-21 03:06:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 200 proven. 21 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2022-02-21 03:06:40,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:41,698 INFO L290 TraceCheckUtils]: 128: Hoare triple {5205#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {5205#false} is VALID [2022-02-21 03:06:41,699 INFO L290 TraceCheckUtils]: 127: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:41,699 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {5205#false} {5204#true} #49#return; {5205#false} is VALID [2022-02-21 03:06:41,699 INFO L290 TraceCheckUtils]: 125: Hoare triple {5205#false} assume true; {5205#false} is VALID [2022-02-21 03:06:41,699 INFO L290 TraceCheckUtils]: 124: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5205#false} is VALID [2022-02-21 03:06:41,699 INFO L290 TraceCheckUtils]: 123: Hoare triple {5205#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:41,699 INFO L290 TraceCheckUtils]: 122: Hoare triple {5205#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5205#false} is VALID [2022-02-21 03:06:41,700 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {5808#(<= |fibonacci_#in~n| 1)} {5785#(<= 4 fibonacci_~n)} #49#return; {5205#false} is VALID [2022-02-21 03:06:41,700 INFO L290 TraceCheckUtils]: 120: Hoare triple {5808#(<= |fibonacci_#in~n| 1)} assume true; {5808#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:41,700 INFO L290 TraceCheckUtils]: 119: Hoare triple {5869#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {5808#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:41,701 INFO L290 TraceCheckUtils]: 118: Hoare triple {5869#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {5869#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:41,701 INFO L290 TraceCheckUtils]: 117: Hoare triple {5204#true} ~n := #in~n; {5869#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:41,701 INFO L272 TraceCheckUtils]: 116: Hoare triple {5785#(<= 4 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:41,701 INFO L290 TraceCheckUtils]: 115: Hoare triple {5785#(<= 4 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:41,701 INFO L290 TraceCheckUtils]: 114: Hoare triple {5785#(<= 4 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:41,702 INFO L290 TraceCheckUtils]: 113: Hoare triple {5785#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:41,702 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {5769#(<= 3 |fibonacci_#in~n|)} {5204#true} #47#return; {5785#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:06:41,703 INFO L290 TraceCheckUtils]: 111: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume true; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,703 INFO L290 TraceCheckUtils]: 110: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,703 INFO L290 TraceCheckUtils]: 109: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,703 INFO L290 TraceCheckUtils]: 108: Hoare triple {5769#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,704 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5759#(<= 1 |fibonacci_#in~n|)} {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #49#return; {5769#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,704 INFO L290 TraceCheckUtils]: 106: Hoare triple {5759#(<= 1 |fibonacci_#in~n|)} assume true; {5759#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,705 INFO L290 TraceCheckUtils]: 105: Hoare triple {5759#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {5759#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,705 INFO L290 TraceCheckUtils]: 104: Hoare triple {5919#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {5759#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:41,705 INFO L290 TraceCheckUtils]: 103: Hoare triple {5204#true} ~n := #in~n; {5919#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:06:41,705 INFO L272 TraceCheckUtils]: 102: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:41,706 INFO L290 TraceCheckUtils]: 101: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 2 >= -2147483648; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,706 INFO L290 TraceCheckUtils]: 100: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 2 <= 2147483647; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,708 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5204#true} {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #47#return; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,708 INFO L290 TraceCheckUtils]: 97: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,708 INFO L290 TraceCheckUtils]: 96: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:41,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,708 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:41,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,708 INFO L290 TraceCheckUtils]: 91: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 90: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L272 TraceCheckUtils]: 89: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 88: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 87: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 86: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 84: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 83: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:41,709 INFO L290 TraceCheckUtils]: 82: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L290 TraceCheckUtils]: 81: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L272 TraceCheckUtils]: 80: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L290 TraceCheckUtils]: 77: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L290 TraceCheckUtils]: 76: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,710 INFO L272 TraceCheckUtils]: 74: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,711 INFO L290 TraceCheckUtils]: 73: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 >= -2147483648; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 <= 2147483647; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(1 == ~n); {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(~n < 1); {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {5204#true} ~n := #in~n; {5906#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:41,712 INFO L272 TraceCheckUtils]: 68: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,712 INFO L290 TraceCheckUtils]: 67: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L272 TraceCheckUtils]: 62: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:41,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L272 TraceCheckUtils]: 49: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {5204#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {5204#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5204#true} {5204#true} #49#return; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {5204#true} assume ~n < 1;#res := 0; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L272 TraceCheckUtils]: 36: Hoare triple {5204#true} call #t~ret5 := fibonacci(~n - 2); {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {5204#true} assume ~n - 2 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {5204#true} assume ~n - 2 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {5204#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5204#true} {5204#true} #47#return; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {5204#true} assume true; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {5204#true} assume 1 == ~n;#res := 1; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L272 TraceCheckUtils]: 27: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L272 TraceCheckUtils]: 21: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L272 TraceCheckUtils]: 15: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L272 TraceCheckUtils]: 9: Hoare triple {5204#true} call #t~ret4 := fibonacci(~n - 1); {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {5204#true} assume ~n - 1 >= -2147483648; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {5204#true} assume ~n - 1 <= 2147483647; {5204#true} is VALID [2022-02-21 03:06:41,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#true} assume !(1 == ~n); {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {5204#true} assume !(~n < 1); {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {5204#true} ~n := #in~n; {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L272 TraceCheckUtils]: 3: Hoare triple {5204#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {5204#true} assume !(main_~x~0#1 < 1); {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {5204#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {5204#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); {5204#true} is VALID [2022-02-21 03:06:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 200 proven. 22 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-02-21 03:06:41,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101484112] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:41,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:41,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2022-02-21 03:06:41,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468630359] [2022-02-21 03:06:41,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 129 [2022-02-21 03:06:41,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:41,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:06:41,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:41,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:06:41,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:41,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:06:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:06:41,823 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:06:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:42,193 INFO L93 Difference]: Finished difference Result 125 states and 175 transitions. [2022-02-21 03:06:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:06:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 129 [2022-02-21 03:06:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:06:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-02-21 03:06:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:06:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-02-21 03:06:42,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2022-02-21 03:06:42,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:42,257 INFO L225 Difference]: With dead ends: 125 [2022-02-21 03:06:42,257 INFO L226 Difference]: Without dead ends: 59 [2022-02-21 03:06:42,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:06:42,258 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:42,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 84 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:06:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-21 03:06:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-21 03:06:42,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:42,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:06:42,291 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:06:42,292 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:06:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:42,293 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-21 03:06:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-21 03:06:42,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:42,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:42,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) Second operand 59 states. [2022-02-21 03:06:42,294 INFO L87 Difference]: Start difference. First operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) Second operand 59 states. [2022-02-21 03:06:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:42,295 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-21 03:06:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-21 03:06:42,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:42,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:42,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:42,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:06:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-02-21 03:06:42,297 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 129 [2022-02-21 03:06:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:42,297 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-02-21 03:06:42,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:06:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-21 03:06:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-21 03:06:42,298 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:42,298 INFO L514 BasicCegarLoop]: trace histogram [12, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2022-02-21 03:06:42,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:42,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:42,511 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -46810727, now seen corresponding path program 4 times [2022-02-21 03:06:42,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:42,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467565113] [2022-02-21 03:06:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:06:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {6699#(<= |fibonacci_#in~n| 1)} assume true; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,630 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6699#(<= |fibonacci_#in~n| 1)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6565#true} {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,636 INFO L272 TraceCheckUtils]: 5: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {6699#(<= |fibonacci_#in~n| 1)} assume true; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6699#(<= |fibonacci_#in~n| 1)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,639 INFO L272 TraceCheckUtils]: 14: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,640 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6565#true} {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume true; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,641 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6698#(<= |fibonacci_#in~n| 2)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,653 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6565#true} {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,655 INFO L272 TraceCheckUtils]: 5: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {6699#(<= |fibonacci_#in~n| 1)} assume true; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6699#(<= |fibonacci_#in~n| 1)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,660 INFO L272 TraceCheckUtils]: 20: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,661 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6565#true} {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume true; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,662 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6698#(<= |fibonacci_#in~n| 2)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,664 INFO L272 TraceCheckUtils]: 33: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,664 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6565#true} {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume true; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,666 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6687#(<= |fibonacci_#in~n| 3)} {6565#true} #47#return; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-21 03:06:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,738 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6731#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {6731#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,750 INFO L272 TraceCheckUtils]: 5: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,753 INFO L272 TraceCheckUtils]: 14: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,754 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume true; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,755 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6742#(<= 2 |fibonacci_#in~n|)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,762 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6565#true} {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,764 INFO L272 TraceCheckUtils]: 5: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6731#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {6731#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,765 INFO L272 TraceCheckUtils]: 11: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,766 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,767 INFO L272 TraceCheckUtils]: 20: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,768 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume true; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,770 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6742#(<= 2 |fibonacci_#in~n|)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,771 INFO L272 TraceCheckUtils]: 33: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,772 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6565#true} {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume true; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,774 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6730#(<= 3 |fibonacci_#in~n|)} {6611#(<= fibonacci_~n 4)} #49#return; {6566#false} is VALID [2022-02-21 03:06:42,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#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); {6565#true} is VALID [2022-02-21 03:06:42,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6565#true} is VALID [2022-02-21 03:06:42,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume !(main_~x~0#1 < 1); {6565#true} is VALID [2022-02-21 03:06:42,774 INFO L272 TraceCheckUtils]: 3: Hoare triple {6565#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} assume !(1 == ~n); {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {6565#true} assume ~n - 1 <= 2147483647; {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {6565#true} assume ~n - 1 >= -2147483648; {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L272 TraceCheckUtils]: 9: Hoare triple {6565#true} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {6565#true} assume !(1 == ~n); {6565#true} is VALID [2022-02-21 03:06:42,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {6565#true} assume ~n - 1 <= 2147483647; {6565#true} is VALID [2022-02-21 03:06:42,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {6565#true} assume ~n - 1 >= -2147483648; {6565#true} is VALID [2022-02-21 03:06:42,776 INFO L272 TraceCheckUtils]: 15: Hoare triple {6565#true} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,777 INFO L272 TraceCheckUtils]: 21: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,779 INFO L272 TraceCheckUtils]: 27: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {6699#(<= |fibonacci_#in~n| 1)} assume true; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:42,781 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6699#(<= |fibonacci_#in~n| 1)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,782 INFO L272 TraceCheckUtils]: 36: Hoare triple {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,783 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6565#true} {6693#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume true; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:42,784 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6698#(<= |fibonacci_#in~n| 2)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,786 INFO L272 TraceCheckUtils]: 49: Hoare triple {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,787 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6565#true} {6681#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume true; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:42,788 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6687#(<= |fibonacci_#in~n| 3)} {6565#true} #47#return; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:42,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {6611#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:42,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {6611#(<= fibonacci_~n 4)} assume ~n - 2 <= 2147483647; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:42,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {6611#(<= fibonacci_~n 4)} assume ~n - 2 >= -2147483648; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:42,789 INFO L272 TraceCheckUtils]: 63: Hoare triple {6611#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,791 INFO L272 TraceCheckUtils]: 69: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,791 INFO L290 TraceCheckUtils]: 70: Hoare triple {6565#true} ~n := #in~n; {6656#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {6656#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6731#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {6731#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,793 INFO L272 TraceCheckUtils]: 75: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:42,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,794 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,795 INFO L272 TraceCheckUtils]: 84: Hoare triple {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:42,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,796 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6565#true} {6732#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,796 INFO L290 TraceCheckUtils]: 89: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,796 INFO L290 TraceCheckUtils]: 90: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,797 INFO L290 TraceCheckUtils]: 91: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,797 INFO L290 TraceCheckUtils]: 92: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume true; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,798 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {6742#(<= 2 |fibonacci_#in~n|)} {6656#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,798 INFO L290 TraceCheckUtils]: 94: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,798 INFO L290 TraceCheckUtils]: 95: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:42,799 INFO L272 TraceCheckUtils]: 97: Hoare triple {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:42,799 INFO L290 TraceCheckUtils]: 98: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:42,799 INFO L290 TraceCheckUtils]: 99: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:42,799 INFO L290 TraceCheckUtils]: 100: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:42,799 INFO L290 TraceCheckUtils]: 101: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:42,800 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6565#true} {6724#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,800 INFO L290 TraceCheckUtils]: 103: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,801 INFO L290 TraceCheckUtils]: 105: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,801 INFO L290 TraceCheckUtils]: 106: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume true; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:42,801 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6730#(<= 3 |fibonacci_#in~n|)} {6611#(<= fibonacci_~n 4)} #49#return; {6566#false} is VALID [2022-02-21 03:06:42,802 INFO L290 TraceCheckUtils]: 108: Hoare triple {6566#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6566#false} is VALID [2022-02-21 03:06:42,802 INFO L290 TraceCheckUtils]: 109: Hoare triple {6566#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {6566#false} is VALID [2022-02-21 03:06:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 104 proven. 129 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-21 03:06:42,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:42,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467565113] [2022-02-21 03:06:42,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467565113] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:42,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076537938] [2022-02-21 03:06:42,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:06:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:42,804 INFO L229 MonitoredProcess]: Starting monitored process 8 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:06:42,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:06:42,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:06:42,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:42,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:06:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:42,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#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); {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume !(main_~x~0#1 < 1); {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L272 TraceCheckUtils]: 3: Hoare triple {6565#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} assume !(1 == ~n); {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {6565#true} assume ~n - 1 <= 2147483647; {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {6565#true} assume ~n - 1 >= -2147483648; {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L272 TraceCheckUtils]: 9: Hoare triple {6565#true} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:43,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:43,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {6565#true} assume !(1 == ~n); {6565#true} is VALID [2022-02-21 03:06:43,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {6565#true} assume ~n - 1 <= 2147483647; {6565#true} is VALID [2022-02-21 03:06:43,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {6565#true} assume ~n - 1 >= -2147483648; {6565#true} is VALID [2022-02-21 03:06:43,348 INFO L272 TraceCheckUtils]: 15: Hoare triple {6565#true} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:43,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {6565#true} ~n := #in~n; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,349 INFO L272 TraceCheckUtils]: 21: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:43,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {6565#true} ~n := #in~n; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,351 INFO L272 TraceCheckUtils]: 27: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:43,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {6565#true} ~n := #in~n; {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {6794#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:43,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {6794#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:43,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {6699#(<= |fibonacci_#in~n| 1)} assume true; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:43,352 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6699#(<= |fibonacci_#in~n| 1)} {6794#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,353 INFO L272 TraceCheckUtils]: 36: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:43,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:43,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:43,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:43,354 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6565#true} {6698#(<= |fibonacci_#in~n| 2)} #49#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume true; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:43,356 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6698#(<= |fibonacci_#in~n| 2)} {6794#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,356 INFO L290 TraceCheckUtils]: 47: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume ~n - 2 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume ~n - 2 >= -2147483648; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,356 INFO L272 TraceCheckUtils]: 49: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:43,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:43,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:43,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:43,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:43,363 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6565#true} {6687#(<= |fibonacci_#in~n| 3)} #49#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume true; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:43,365 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6687#(<= |fibonacci_#in~n| 3)} {6565#true} #47#return; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:43,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {6611#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:43,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {6611#(<= fibonacci_~n 4)} assume ~n - 2 <= 2147483647; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:43,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {6611#(<= fibonacci_~n 4)} assume ~n - 2 >= -2147483648; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:43,366 INFO L272 TraceCheckUtils]: 63: Hoare triple {6611#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:43,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {6565#true} ~n := #in~n; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,367 INFO L290 TraceCheckUtils]: 67: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,368 INFO L272 TraceCheckUtils]: 69: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:43,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {6565#true} ~n := #in~n; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,369 INFO L290 TraceCheckUtils]: 73: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,370 INFO L290 TraceCheckUtils]: 74: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,370 INFO L272 TraceCheckUtils]: 75: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:43,370 INFO L290 TraceCheckUtils]: 76: Hoare triple {6565#true} ~n := #in~n; {6939#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {6939#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6979#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {6979#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6979#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,372 INFO L290 TraceCheckUtils]: 79: Hoare triple {6979#(<= 1 |fibonacci_#in~n|)} assume true; {6979#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,372 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6979#(<= 1 |fibonacci_#in~n|)} {6939#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,373 INFO L290 TraceCheckUtils]: 82: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,373 INFO L272 TraceCheckUtils]: 84: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:43,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:43,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:43,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:43,374 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6565#true} {6742#(<= 2 |fibonacci_#in~n|)} #49#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,375 INFO L290 TraceCheckUtils]: 90: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,375 INFO L290 TraceCheckUtils]: 91: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,375 INFO L290 TraceCheckUtils]: 92: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume true; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,376 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {6742#(<= 2 |fibonacci_#in~n|)} {6939#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,376 INFO L290 TraceCheckUtils]: 94: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,377 INFO L290 TraceCheckUtils]: 95: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,377 INFO L290 TraceCheckUtils]: 96: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,377 INFO L272 TraceCheckUtils]: 97: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:43,377 INFO L290 TraceCheckUtils]: 98: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:43,377 INFO L290 TraceCheckUtils]: 99: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:43,377 INFO L290 TraceCheckUtils]: 100: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:43,377 INFO L290 TraceCheckUtils]: 101: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:43,378 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6565#true} {6730#(<= 3 |fibonacci_#in~n|)} #49#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,378 INFO L290 TraceCheckUtils]: 103: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,378 INFO L290 TraceCheckUtils]: 104: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,379 INFO L290 TraceCheckUtils]: 105: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,379 INFO L290 TraceCheckUtils]: 106: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume true; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:43,380 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6730#(<= 3 |fibonacci_#in~n|)} {6611#(<= fibonacci_~n 4)} #49#return; {6566#false} is VALID [2022-02-21 03:06:43,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {6566#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6566#false} is VALID [2022-02-21 03:06:43,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {6566#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {6566#false} is VALID [2022-02-21 03:06:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 102 proven. 158 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-02-21 03:06:43,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:44,990 INFO L290 TraceCheckUtils]: 109: Hoare triple {6566#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {6566#false} is VALID [2022-02-21 03:06:44,990 INFO L290 TraceCheckUtils]: 108: Hoare triple {6566#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6566#false} is VALID [2022-02-21 03:06:44,991 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6730#(<= 3 |fibonacci_#in~n|)} {6611#(<= fibonacci_~n 4)} #49#return; {6566#false} is VALID [2022-02-21 03:06:44,991 INFO L290 TraceCheckUtils]: 106: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume true; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,991 INFO L290 TraceCheckUtils]: 105: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,991 INFO L290 TraceCheckUtils]: 104: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,992 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6565#true} {6730#(<= 3 |fibonacci_#in~n|)} #49#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:44,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:44,994 INFO L290 TraceCheckUtils]: 99: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:44,994 INFO L290 TraceCheckUtils]: 98: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:44,994 INFO L272 TraceCheckUtils]: 97: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:44,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,995 INFO L290 TraceCheckUtils]: 95: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,995 INFO L290 TraceCheckUtils]: 94: Hoare triple {6730#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,996 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {6742#(<= 2 |fibonacci_#in~n|)} {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #47#return; {6730#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,996 INFO L290 TraceCheckUtils]: 92: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume true; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,996 INFO L290 TraceCheckUtils]: 91: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,997 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6565#true} {6742#(<= 2 |fibonacci_#in~n|)} #49#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,998 INFO L290 TraceCheckUtils]: 87: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:44,998 INFO L290 TraceCheckUtils]: 86: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:44,998 INFO L290 TraceCheckUtils]: 85: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:44,998 INFO L272 TraceCheckUtils]: 84: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:44,998 INFO L290 TraceCheckUtils]: 83: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,999 INFO L290 TraceCheckUtils]: 82: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:44,999 INFO L290 TraceCheckUtils]: 81: Hoare triple {6742#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:45,000 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6979#(<= 1 |fibonacci_#in~n|)} {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #47#return; {6742#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:45,000 INFO L290 TraceCheckUtils]: 79: Hoare triple {6979#(<= 1 |fibonacci_#in~n|)} assume true; {6979#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:45,000 INFO L290 TraceCheckUtils]: 78: Hoare triple {6979#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6979#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:45,000 INFO L290 TraceCheckUtils]: 77: Hoare triple {7183#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {6979#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:45,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {6565#true} ~n := #in~n; {7183#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:06:45,001 INFO L272 TraceCheckUtils]: 75: Hoare triple {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:45,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:45,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:45,002 INFO L290 TraceCheckUtils]: 72: Hoare triple {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:45,003 INFO L290 TraceCheckUtils]: 71: Hoare triple {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:45,003 INFO L290 TraceCheckUtils]: 70: Hoare triple {6565#true} ~n := #in~n; {7170#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:45,003 INFO L272 TraceCheckUtils]: 69: Hoare triple {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:45,003 INFO L290 TraceCheckUtils]: 68: Hoare triple {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 >= -2147483648; {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:45,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 <= 2147483647; {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:45,004 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(1 == ~n); {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:45,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(~n < 1); {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:45,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {6565#true} ~n := #in~n; {7127#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:45,005 INFO L272 TraceCheckUtils]: 63: Hoare triple {6611#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:45,005 INFO L290 TraceCheckUtils]: 62: Hoare triple {6611#(<= fibonacci_~n 4)} assume ~n - 2 >= -2147483648; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:45,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {6611#(<= fibonacci_~n 4)} assume ~n - 2 <= 2147483647; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:45,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {6611#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:45,006 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6687#(<= |fibonacci_#in~n| 3)} {6565#true} #47#return; {6611#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:06:45,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume true; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,008 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6565#true} {6687#(<= |fibonacci_#in~n| 3)} #49#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:45,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {6565#true} assume 1 == ~n;#res := 1; {6565#true} is VALID [2022-02-21 03:06:45,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:45,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:45,008 INFO L272 TraceCheckUtils]: 49: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:45,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume ~n - 2 >= -2147483648; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume ~n - 2 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {6687#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,009 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6698#(<= |fibonacci_#in~n| 2)} {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #47#return; {6687#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:45,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume true; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,011 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6565#true} {6698#(<= |fibonacci_#in~n| 2)} #49#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {6565#true} assume true; {6565#true} is VALID [2022-02-21 03:06:45,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {6565#true} assume ~n < 1;#res := 0; {6565#true} is VALID [2022-02-21 03:06:45,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:45,011 INFO L272 TraceCheckUtils]: 36: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {6565#true} is VALID [2022-02-21 03:06:45,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {6698#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,012 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6699#(<= |fibonacci_#in~n| 1)} {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #47#return; {6698#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:45,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {6699#(<= |fibonacci_#in~n| 1)} assume true; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:45,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {7327#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {6699#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:45,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {7327#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {7327#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:45,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {6565#true} ~n := #in~n; {7327#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:45,014 INFO L272 TraceCheckUtils]: 27: Hoare triple {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:45,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:45,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:45,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:45,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:45,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {6565#true} ~n := #in~n; {7317#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:45,015 INFO L272 TraceCheckUtils]: 21: Hoare triple {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:45,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 >= -2147483648; {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:45,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 <= 2147483647; {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:45,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:45,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {6565#true} ~n := #in~n; {7274#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:45,017 INFO L272 TraceCheckUtils]: 15: Hoare triple {6565#true} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {6565#true} assume ~n - 1 >= -2147483648; {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {6565#true} assume ~n - 1 <= 2147483647; {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {6565#true} assume !(1 == ~n); {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L272 TraceCheckUtils]: 9: Hoare triple {6565#true} call #t~ret4 := fibonacci(~n - 1); {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {6565#true} assume ~n - 1 >= -2147483648; {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {6565#true} assume ~n - 1 <= 2147483647; {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {6565#true} assume !(1 == ~n); {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {6565#true} assume !(~n < 1); {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {6565#true} ~n := #in~n; {6565#true} is VALID [2022-02-21 03:06:45,017 INFO L272 TraceCheckUtils]: 3: Hoare triple {6565#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {6565#true} is VALID [2022-02-21 03:06:45,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {6565#true} assume !(main_~x~0#1 < 1); {6565#true} is VALID [2022-02-21 03:06:45,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {6565#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6565#true} is VALID [2022-02-21 03:06:45,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {6565#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); {6565#true} is VALID [2022-02-21 03:06:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 102 proven. 174 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-02-21 03:06:45,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076537938] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:45,018 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:45,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 23 [2022-02-21 03:06:45,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499804282] [2022-02-21 03:06:45,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:45,019 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) Word has length 110 [2022-02-21 03:06:46,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:46,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:06:46,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:46,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-21 03:06:46,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:46,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:06:46,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:06:46,413 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:06:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:46,945 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2022-02-21 03:06:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:06:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) Word has length 110 [2022-02-21 03:06:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:06:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 101 transitions. [2022-02-21 03:06:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:06:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 101 transitions. [2022-02-21 03:06:46,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 101 transitions. [2022-02-21 03:06:47,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:47,014 INFO L225 Difference]: With dead ends: 128 [2022-02-21 03:06:47,014 INFO L226 Difference]: Without dead ends: 75 [2022-02-21 03:06:47,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2022-02-21 03:06:47,015 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 169 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:47,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 112 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:06:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-21 03:06:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2022-02-21 03:06:47,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:47,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:47,050 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:47,050 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:47,052 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-21 03:06:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-02-21 03:06:47,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:47,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:47,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 75 states. [2022-02-21 03:06:47,053 INFO L87 Difference]: Start difference. First operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 75 states. [2022-02-21 03:06:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:47,054 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-21 03:06:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-02-21 03:06:47,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:47,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:47,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:47,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-02-21 03:06:47,056 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 110 [2022-02-21 03:06:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:47,056 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-02-21 03:06:47,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 17 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 10 states have call predecessors, (22), 17 states have call successors, (22) [2022-02-21 03:06:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-02-21 03:06:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-21 03:06:47,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:47,057 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2022-02-21 03:06:47,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:47,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:47,271 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash 184548158, now seen corresponding path program 3 times [2022-02-21 03:06:47,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:47,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96658573] [2022-02-21 03:06:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,546 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L272 TraceCheckUtils]: 5: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,561 INFO L272 TraceCheckUtils]: 14: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,563 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,565 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,571 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,571 INFO L272 TraceCheckUtils]: 5: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,572 INFO L272 TraceCheckUtils]: 11: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,574 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,575 INFO L272 TraceCheckUtils]: 20: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,576 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,578 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,579 INFO L272 TraceCheckUtils]: 33: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,580 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7909#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {7909#(<= 2 |fibonacci_#res|)} assume true; {7909#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,583 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7909#(<= 2 |fibonacci_#res|)} {7806#true} #47#return; {7852#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-21 03:06:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,606 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,614 INFO L272 TraceCheckUtils]: 5: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,616 INFO L272 TraceCheckUtils]: 14: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,618 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,620 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7852#(<= 2 |fibonacci_#t~ret4|)} #49#return; {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#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); {7806#true} is VALID [2022-02-21 03:06:47,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7806#true} is VALID [2022-02-21 03:06:47,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume !(main_~x~0#1 < 1); {7806#true} is VALID [2022-02-21 03:06:47,620 INFO L272 TraceCheckUtils]: 3: Hoare triple {7806#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {7806#true} is VALID [2022-02-21 03:06:47,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L272 TraceCheckUtils]: 9: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,621 INFO L272 TraceCheckUtils]: 15: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L272 TraceCheckUtils]: 21: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,624 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,625 INFO L272 TraceCheckUtils]: 30: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,627 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,628 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,629 INFO L272 TraceCheckUtils]: 43: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,630 INFO L290 TraceCheckUtils]: 47: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,630 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,631 INFO L290 TraceCheckUtils]: 49: Hoare triple {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {7908#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7909#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {7909#(<= 2 |fibonacci_#res|)} assume true; {7909#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,632 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7909#(<= 2 |fibonacci_#res|)} {7806#true} #47#return; {7852#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {7852#(<= 2 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7852#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {7852#(<= 2 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7852#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {7852#(<= 2 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7852#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,633 INFO L272 TraceCheckUtils]: 57: Hoare triple {7852#(<= 2 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,634 INFO L272 TraceCheckUtils]: 63: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,634 INFO L290 TraceCheckUtils]: 65: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,634 INFO L290 TraceCheckUtils]: 66: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,634 INFO L290 TraceCheckUtils]: 67: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,635 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,636 INFO L272 TraceCheckUtils]: 72: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,636 INFO L290 TraceCheckUtils]: 74: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,636 INFO L290 TraceCheckUtils]: 75: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,637 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,638 INFO L290 TraceCheckUtils]: 78: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,639 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7852#(<= 2 |fibonacci_#t~ret4|)} #49#return; {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,639 INFO L290 TraceCheckUtils]: 82: Hoare triple {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,639 INFO L290 TraceCheckUtils]: 83: Hoare triple {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:47,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {7877#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {7807#false} is VALID [2022-02-21 03:06:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-02-21 03:06:47,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:47,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96658573] [2022-02-21 03:06:47,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96658573] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:47,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294466879] [2022-02-21 03:06:47,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:06:47,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:47,642 INFO L229 MonitoredProcess]: Starting monitored process 9 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:06:47,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:06:47,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:06:47,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:47,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:06:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:47,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#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); {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume !(main_~x~0#1 < 1); {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L272 TraceCheckUtils]: 3: Hoare triple {7806#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L272 TraceCheckUtils]: 9: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L272 TraceCheckUtils]: 15: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L272 TraceCheckUtils]: 21: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7806#true} {7806#true} #47#return; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {7806#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {7806#true} assume ~n - 2 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {7806#true} assume ~n - 2 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L272 TraceCheckUtils]: 30: Hoare triple {7806#true} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7806#true} {7806#true} #49#return; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {7806#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7806#true} {7806#true} #47#return; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {7806#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {7806#true} assume ~n - 2 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {7806#true} assume ~n - 2 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L272 TraceCheckUtils]: 43: Hoare triple {7806#true} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7806#true} {7806#true} #49#return; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {7806#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7806#true} {7806#true} #47#return; {7806#true} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {7806#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:47,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 <= 2147483647; {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 >= -2147483648; {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:47,958 INFO L272 TraceCheckUtils]: 57: Hoare triple {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L272 TraceCheckUtils]: 63: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:47,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,959 INFO L290 TraceCheckUtils]: 67: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,959 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,960 INFO L290 TraceCheckUtils]: 70: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,960 INFO L290 TraceCheckUtils]: 71: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:47,960 INFO L272 TraceCheckUtils]: 72: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:47,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:47,961 INFO L290 TraceCheckUtils]: 74: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,961 INFO L290 TraceCheckUtils]: 75: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,961 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {8163#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:06:47,962 INFO L290 TraceCheckUtils]: 77: Hoare triple {8163#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8163#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:06:47,962 INFO L290 TraceCheckUtils]: 78: Hoare triple {8163#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8163#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:06:47,963 INFO L290 TraceCheckUtils]: 79: Hoare triple {8163#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:47,963 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {8096#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #49#return; {8179#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:06:47,964 INFO L290 TraceCheckUtils]: 82: Hoare triple {8179#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8179#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:06:47,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {8179#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8179#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:06:47,964 INFO L290 TraceCheckUtils]: 84: Hoare triple {8179#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {7807#false} is VALID [2022-02-21 03:06:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-02-21 03:06:47,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:48,478 INFO L290 TraceCheckUtils]: 84: Hoare triple {8189#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {7807#false} is VALID [2022-02-21 03:06:48,478 INFO L290 TraceCheckUtils]: 83: Hoare triple {8189#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume #t~ret4 + #t~ret5 <= 2147483647; {8189#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:48,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {8189#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8189#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:48,480 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} #49#return; {8189#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:06:48,480 INFO L290 TraceCheckUtils]: 80: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:48,480 INFO L290 TraceCheckUtils]: 79: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:48,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:48,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:48,482 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7921#(<= 0 |fibonacci_#res|)} {7902#(<= 1 |fibonacci_#t~ret4|)} #49#return; {7919#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:48,482 INFO L290 TraceCheckUtils]: 75: Hoare triple {7921#(<= 0 |fibonacci_#res|)} assume true; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:48,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7921#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:06:48,482 INFO L290 TraceCheckUtils]: 73: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,482 INFO L272 TraceCheckUtils]: 72: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:48,483 INFO L290 TraceCheckUtils]: 71: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:48,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:48,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {7902#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:48,484 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7920#(<= 1 |fibonacci_#res|)} {7806#true} #47#return; {7902#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:06:48,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {7920#(<= 1 |fibonacci_#res|)} assume true; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:48,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7920#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:06:48,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L272 TraceCheckUtils]: 63: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,485 INFO L272 TraceCheckUtils]: 57: Hoare triple {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:48,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} assume ~n - 2 >= -2147483648; {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:48,490 INFO L290 TraceCheckUtils]: 55: Hoare triple {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} assume ~n - 2 <= 2147483647; {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {7806#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8199#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:06:48,491 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7806#true} {7806#true} #47#return; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {7806#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7806#true} {7806#true} #49#return; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,491 INFO L272 TraceCheckUtils]: 43: Hoare triple {7806#true} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {7806#true} assume ~n - 2 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {7806#true} assume ~n - 2 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {7806#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7806#true} {7806#true} #47#return; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {7806#true} assume #t~ret4 + #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {7806#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7806#true} {7806#true} #49#return; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {7806#true} assume ~n < 1;#res := 0; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L272 TraceCheckUtils]: 30: Hoare triple {7806#true} call #t~ret5 := fibonacci(~n - 2); {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {7806#true} assume ~n - 2 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {7806#true} assume ~n - 2 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {7806#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,492 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7806#true} {7806#true} #47#return; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {7806#true} assume true; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {7806#true} assume 1 == ~n;#res := 1; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L272 TraceCheckUtils]: 21: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L272 TraceCheckUtils]: 15: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L272 TraceCheckUtils]: 9: Hoare triple {7806#true} call #t~ret4 := fibonacci(~n - 1); {7806#true} is VALID [2022-02-21 03:06:48,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {7806#true} assume ~n - 1 >= -2147483648; {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {7806#true} assume ~n - 1 <= 2147483647; {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {7806#true} assume !(1 == ~n); {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {7806#true} assume !(~n < 1); {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {7806#true} ~n := #in~n; {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L272 TraceCheckUtils]: 3: Hoare triple {7806#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {7806#true} assume !(main_~x~0#1 < 1); {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {7806#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {7806#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); {7806#true} is VALID [2022-02-21 03:06:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-02-21 03:06:48,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294466879] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:48,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:48,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-02-21 03:06:48,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045941578] [2022-02-21 03:06:48,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 85 [2022-02-21 03:06:48,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:48,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:06:48,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:48,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:06:48,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:06:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:06:48,539 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:06:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:48,740 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-21 03:06:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:06:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 85 [2022-02-21 03:06:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:06:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-21 03:06:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:06:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-21 03:06:48,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-02-21 03:06:48,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:48,776 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:06:48,776 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:06:48,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:06:48,777 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:48,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 156 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:06:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:06:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-21 03:06:48,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:48,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:48,814 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:48,814 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:48,816 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-21 03:06:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-21 03:06:48,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:48,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:48,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 64 states. [2022-02-21 03:06:48,817 INFO L87 Difference]: Start difference. First operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 64 states. [2022-02-21 03:06:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:48,818 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-21 03:06:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-21 03:06:48,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:48,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:48,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:48,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:06:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-02-21 03:06:48,820 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 85 [2022-02-21 03:06:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:48,820 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-02-21 03:06:48,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:06:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-21 03:06:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-21 03:06:48,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:48,821 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 1, 1, 1, 1, 1] [2022-02-21 03:06:48,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:49,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-21 03:06:49,037 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1461335952, now seen corresponding path program 5 times [2022-02-21 03:06:49,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:49,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626452199] [2022-02-21 03:06:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,154 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L272 TraceCheckUtils]: 5: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L272 TraceCheckUtils]: 14: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,158 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L272 TraceCheckUtils]: 5: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,160 INFO L272 TraceCheckUtils]: 11: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L272 TraceCheckUtils]: 20: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L272 TraceCheckUtils]: 33: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,163 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8730#true} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:06:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,207 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8948#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {8948#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,213 INFO L272 TraceCheckUtils]: 5: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,215 INFO L272 TraceCheckUtils]: 14: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,217 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume true; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,218 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8959#(<= 2 |fibonacci_#in~n|)} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,220 INFO L272 TraceCheckUtils]: 5: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L272 TraceCheckUtils]: 11: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L272 TraceCheckUtils]: 17: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L272 TraceCheckUtils]: 26: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L272 TraceCheckUtils]: 39: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,225 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,226 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8730#true} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,227 INFO L272 TraceCheckUtils]: 53: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,227 INFO L290 TraceCheckUtils]: 54: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8948#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {8948#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,229 INFO L272 TraceCheckUtils]: 59: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,230 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,231 INFO L272 TraceCheckUtils]: 68: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,232 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,233 INFO L290 TraceCheckUtils]: 75: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,233 INFO L290 TraceCheckUtils]: 76: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume true; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,234 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8959#(<= 2 |fibonacci_#in~n|)} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,235 INFO L290 TraceCheckUtils]: 79: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,235 INFO L290 TraceCheckUtils]: 81: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume true; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,236 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8909#(<= 4 |fibonacci_#in~n|)} {8730#true} #47#return; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-21 03:06:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {8971#(<= |fibonacci_#in~n| 1)} assume true; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,279 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8971#(<= |fibonacci_#in~n| 1)} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,286 INFO L272 TraceCheckUtils]: 5: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {8971#(<= |fibonacci_#in~n| 1)} assume true; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8971#(<= |fibonacci_#in~n| 1)} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,289 INFO L272 TraceCheckUtils]: 14: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,290 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8730#true} {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume true; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,292 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8970#(<= |fibonacci_#in~n| 2)} {8815#(<= 5 fibonacci_~n)} #49#return; {8731#false} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#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); {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume !(main_~x~0#1 < 1); {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L272 TraceCheckUtils]: 3: Hoare triple {8730#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,294 INFO L272 TraceCheckUtils]: 9: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,296 INFO L272 TraceCheckUtils]: 15: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L272 TraceCheckUtils]: 21: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L272 TraceCheckUtils]: 27: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,299 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L272 TraceCheckUtils]: 49: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,301 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,302 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8730#true} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,302 INFO L290 TraceCheckUtils]: 60: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,303 INFO L272 TraceCheckUtils]: 63: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,303 INFO L290 TraceCheckUtils]: 64: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8948#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {8948#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,305 INFO L272 TraceCheckUtils]: 69: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,305 INFO L290 TraceCheckUtils]: 71: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,305 INFO L290 TraceCheckUtils]: 72: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,306 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,307 INFO L290 TraceCheckUtils]: 75: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,307 INFO L290 TraceCheckUtils]: 77: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,307 INFO L272 TraceCheckUtils]: 78: Hoare triple {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,308 INFO L290 TraceCheckUtils]: 79: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,309 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8730#true} {8949#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,310 INFO L290 TraceCheckUtils]: 85: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,310 INFO L290 TraceCheckUtils]: 86: Hoare triple {8959#(<= 2 |fibonacci_#in~n|)} assume true; {8959#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,311 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8959#(<= 2 |fibonacci_#in~n|)} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,311 INFO L290 TraceCheckUtils]: 88: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,311 INFO L290 TraceCheckUtils]: 89: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,312 INFO L290 TraceCheckUtils]: 90: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,312 INFO L290 TraceCheckUtils]: 91: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume true; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,313 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {8909#(<= 4 |fibonacci_#in~n|)} {8730#true} #47#return; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,313 INFO L290 TraceCheckUtils]: 93: Hoare triple {8815#(<= 5 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,313 INFO L290 TraceCheckUtils]: 94: Hoare triple {8815#(<= 5 fibonacci_~n)} assume ~n - 2 <= 2147483647; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,314 INFO L290 TraceCheckUtils]: 95: Hoare triple {8815#(<= 5 fibonacci_~n)} assume ~n - 2 >= -2147483648; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,314 INFO L272 TraceCheckUtils]: 96: Hoare triple {8815#(<= 5 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,314 INFO L290 TraceCheckUtils]: 97: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,314 INFO L290 TraceCheckUtils]: 98: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,315 INFO L290 TraceCheckUtils]: 99: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,315 INFO L290 TraceCheckUtils]: 101: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,316 INFO L272 TraceCheckUtils]: 102: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,316 INFO L290 TraceCheckUtils]: 103: Hoare triple {8730#true} ~n := #in~n; {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,316 INFO L290 TraceCheckUtils]: 104: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {8840#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,317 INFO L290 TraceCheckUtils]: 105: Hoare triple {8840#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,317 INFO L290 TraceCheckUtils]: 106: Hoare triple {8971#(<= |fibonacci_#in~n| 1)} assume true; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,318 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {8971#(<= |fibonacci_#in~n| 1)} {8840#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,318 INFO L290 TraceCheckUtils]: 108: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,319 INFO L290 TraceCheckUtils]: 109: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,319 INFO L290 TraceCheckUtils]: 110: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:49,319 INFO L272 TraceCheckUtils]: 111: Hoare triple {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,319 INFO L290 TraceCheckUtils]: 112: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,319 INFO L290 TraceCheckUtils]: 113: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,320 INFO L290 TraceCheckUtils]: 114: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,320 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8730#true} {8965#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,321 INFO L290 TraceCheckUtils]: 116: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,321 INFO L290 TraceCheckUtils]: 117: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,321 INFO L290 TraceCheckUtils]: 118: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,321 INFO L290 TraceCheckUtils]: 119: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume true; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,322 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {8970#(<= |fibonacci_#in~n| 2)} {8815#(<= 5 fibonacci_~n)} #49#return; {8731#false} is VALID [2022-02-21 03:06:49,322 INFO L290 TraceCheckUtils]: 121: Hoare triple {8731#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8731#false} is VALID [2022-02-21 03:06:49,322 INFO L290 TraceCheckUtils]: 122: Hoare triple {8731#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {8731#false} is VALID [2022-02-21 03:06:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 197 proven. 68 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-02-21 03:06:49,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:49,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626452199] [2022-02-21 03:06:49,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626452199] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:49,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459291504] [2022-02-21 03:06:49,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:06:49,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:49,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:49,334 INFO L229 MonitoredProcess]: Starting monitored process 10 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:06:49,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:06:49,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-02-21 03:06:49,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:49,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:06:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:49,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#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); {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume !(main_~x~0#1 < 1); {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L272 TraceCheckUtils]: 3: Hoare triple {8730#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,814 INFO L272 TraceCheckUtils]: 9: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {8730#true} ~n := #in~n; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,816 INFO L272 TraceCheckUtils]: 15: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} ~n := #in~n; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,817 INFO L272 TraceCheckUtils]: 21: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L272 TraceCheckUtils]: 27: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L272 TraceCheckUtils]: 36: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,819 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8730#true} {9005#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,820 INFO L272 TraceCheckUtils]: 49: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {8730#true} ~n := #in~n; {9005#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {9005#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9129#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {9129#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9129#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {9129#(<= 1 |fibonacci_#in~n|)} assume true; {9129#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,824 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9129#(<= 1 |fibonacci_#in~n|)} {9005#(<= fibonacci_~n |fibonacci_#in~n|)} #49#return; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,825 INFO L290 TraceCheckUtils]: 58: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume true; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,826 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9139#(<= 3 |fibonacci_#in~n|)} {9005#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,827 INFO L272 TraceCheckUtils]: 63: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 68: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L272 TraceCheckUtils]: 69: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 70: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 71: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:49,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 75: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 76: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L272 TraceCheckUtils]: 78: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 79: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,830 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:49,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:49,830 INFO L290 TraceCheckUtils]: 85: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:49,830 INFO L290 TraceCheckUtils]: 86: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,831 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8730#true} {8909#(<= 4 |fibonacci_#in~n|)} #49#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume true; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:49,832 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {8909#(<= 4 |fibonacci_#in~n|)} {8730#true} #47#return; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,833 INFO L290 TraceCheckUtils]: 93: Hoare triple {8815#(<= 5 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,833 INFO L290 TraceCheckUtils]: 94: Hoare triple {8815#(<= 5 fibonacci_~n)} assume ~n - 2 <= 2147483647; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,833 INFO L290 TraceCheckUtils]: 95: Hoare triple {8815#(<= 5 fibonacci_~n)} assume ~n - 2 >= -2147483648; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:49,833 INFO L272 TraceCheckUtils]: 96: Hoare triple {8815#(<= 5 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {8730#true} ~n := #in~n; {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,834 INFO L290 TraceCheckUtils]: 98: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,835 INFO L290 TraceCheckUtils]: 100: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,835 INFO L290 TraceCheckUtils]: 101: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,835 INFO L272 TraceCheckUtils]: 102: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:49,835 INFO L290 TraceCheckUtils]: 103: Hoare triple {8730#true} ~n := #in~n; {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,836 INFO L290 TraceCheckUtils]: 104: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {9269#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:49,836 INFO L290 TraceCheckUtils]: 105: Hoare triple {9269#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,836 INFO L290 TraceCheckUtils]: 106: Hoare triple {8971#(<= |fibonacci_#in~n| 1)} assume true; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:49,837 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {8971#(<= |fibonacci_#in~n| 1)} {9269#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,837 INFO L290 TraceCheckUtils]: 108: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,838 INFO L290 TraceCheckUtils]: 109: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,838 INFO L290 TraceCheckUtils]: 110: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,838 INFO L272 TraceCheckUtils]: 111: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:49,838 INFO L290 TraceCheckUtils]: 112: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:49,838 INFO L290 TraceCheckUtils]: 113: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:49,838 INFO L290 TraceCheckUtils]: 114: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:49,839 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8730#true} {8970#(<= |fibonacci_#in~n| 2)} #49#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,839 INFO L290 TraceCheckUtils]: 116: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,839 INFO L290 TraceCheckUtils]: 117: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,840 INFO L290 TraceCheckUtils]: 118: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,840 INFO L290 TraceCheckUtils]: 119: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume true; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:49,841 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {8970#(<= |fibonacci_#in~n| 2)} {8815#(<= 5 fibonacci_~n)} #49#return; {8731#false} is VALID [2022-02-21 03:06:49,841 INFO L290 TraceCheckUtils]: 121: Hoare triple {8731#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8731#false} is VALID [2022-02-21 03:06:49,841 INFO L290 TraceCheckUtils]: 122: Hoare triple {8731#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {8731#false} is VALID [2022-02-21 03:06:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 158 proven. 137 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-02-21 03:06:49,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:51,125 INFO L290 TraceCheckUtils]: 122: Hoare triple {8731#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {8731#false} is VALID [2022-02-21 03:06:51,126 INFO L290 TraceCheckUtils]: 121: Hoare triple {8731#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8731#false} is VALID [2022-02-21 03:06:51,126 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {8970#(<= |fibonacci_#in~n| 2)} {8815#(<= 5 fibonacci_~n)} #49#return; {8731#false} is VALID [2022-02-21 03:06:51,127 INFO L290 TraceCheckUtils]: 119: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume true; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,127 INFO L290 TraceCheckUtils]: 118: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,127 INFO L290 TraceCheckUtils]: 117: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,127 INFO L290 TraceCheckUtils]: 116: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,128 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {8730#true} {8970#(<= |fibonacci_#in~n| 2)} #49#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,128 INFO L290 TraceCheckUtils]: 114: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,128 INFO L290 TraceCheckUtils]: 113: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:51,128 INFO L290 TraceCheckUtils]: 112: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,128 INFO L272 TraceCheckUtils]: 111: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:51,128 INFO L290 TraceCheckUtils]: 110: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {8970#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,130 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {8971#(<= |fibonacci_#in~n| 1)} {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #47#return; {8970#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:51,130 INFO L290 TraceCheckUtils]: 106: Hoare triple {8971#(<= |fibonacci_#in~n| 1)} assume true; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:51,130 INFO L290 TraceCheckUtils]: 105: Hoare triple {9403#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {8971#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:51,131 INFO L290 TraceCheckUtils]: 104: Hoare triple {9403#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {9403#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:51,131 INFO L290 TraceCheckUtils]: 103: Hoare triple {8730#true} ~n := #in~n; {9403#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:51,131 INFO L272 TraceCheckUtils]: 102: Hoare triple {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:51,131 INFO L290 TraceCheckUtils]: 101: Hoare triple {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:51,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:51,132 INFO L290 TraceCheckUtils]: 99: Hoare triple {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:51,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:51,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {8730#true} ~n := #in~n; {9393#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:06:51,133 INFO L272 TraceCheckUtils]: 96: Hoare triple {8815#(<= 5 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:51,133 INFO L290 TraceCheckUtils]: 95: Hoare triple {8815#(<= 5 fibonacci_~n)} assume ~n - 2 >= -2147483648; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:51,133 INFO L290 TraceCheckUtils]: 94: Hoare triple {8815#(<= 5 fibonacci_~n)} assume ~n - 2 <= 2147483647; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:51,133 INFO L290 TraceCheckUtils]: 93: Hoare triple {8815#(<= 5 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:51,134 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {8909#(<= 4 |fibonacci_#in~n|)} {8730#true} #47#return; {8815#(<= 5 fibonacci_~n)} is VALID [2022-02-21 03:06:51,134 INFO L290 TraceCheckUtils]: 91: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume true; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,134 INFO L290 TraceCheckUtils]: 90: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,135 INFO L290 TraceCheckUtils]: 89: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,135 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8730#true} {8909#(<= 4 |fibonacci_#in~n|)} #49#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,135 INFO L290 TraceCheckUtils]: 86: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 85: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 84: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 83: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 81: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 80: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 79: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L272 TraceCheckUtils]: 78: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 77: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 76: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L272 TraceCheckUtils]: 69: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:51,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:51,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:51,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:51,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,137 INFO L272 TraceCheckUtils]: 63: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:51,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {8909#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,138 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9139#(<= 3 |fibonacci_#in~n|)} {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} #47#return; {8909#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume true; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {9139#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,140 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9129#(<= 1 |fibonacci_#in~n|)} {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #49#return; {9139#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {9129#(<= 1 |fibonacci_#in~n|)} assume true; {9129#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {9129#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9129#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {9571#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {9129#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:51,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {8730#true} ~n := #in~n; {9571#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:06:51,141 INFO L272 TraceCheckUtils]: 49: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:51,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 2 >= -2147483648; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 2 <= 2147483647; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,143 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8730#true} {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #47#return; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8730#true} is VALID [2022-02-21 03:06:51,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {8730#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {8730#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,143 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8730#true} {8730#true} #49#return; {8730#true} is VALID [2022-02-21 03:06:51,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {8730#true} assume ~n < 1;#res := 0; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L272 TraceCheckUtils]: 36: Hoare triple {8730#true} call #t~ret5 := fibonacci(~n - 2); {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {8730#true} assume ~n - 2 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {8730#true} assume ~n - 2 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {8730#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8730#true} {8730#true} #47#return; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {8730#true} assume 1 == ~n;#res := 1; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L272 TraceCheckUtils]: 27: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,144 INFO L272 TraceCheckUtils]: 21: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:51,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 >= -2147483648; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 <= 2147483647; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(1 == ~n); {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(~n < 1); {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#true} ~n := #in~n; {9558#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:06:51,146 INFO L272 TraceCheckUtils]: 15: Hoare triple {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:51,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:51,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:51,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(1 == ~n); {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:51,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(~n < 1); {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {8730#true} ~n := #in~n; {9539#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:51,148 INFO L272 TraceCheckUtils]: 9: Hoare triple {8730#true} call #t~ret4 := fibonacci(~n - 1); {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#true} assume ~n - 1 >= -2147483648; {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#true} assume ~n - 1 <= 2147483647; {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {8730#true} assume !(1 == ~n); {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#true} assume !(~n < 1); {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {8730#true} ~n := #in~n; {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L272 TraceCheckUtils]: 3: Hoare triple {8730#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume !(main_~x~0#1 < 1); {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {8730#true} is VALID [2022-02-21 03:06:51,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {8730#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); {8730#true} is VALID [2022-02-21 03:06:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 162 proven. 142 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-02-21 03:06:51,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459291504] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:51,149 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:51,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 20 [2022-02-21 03:06:51,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278334679] [2022-02-21 03:06:51,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) Word has length 123 [2022-02-21 03:06:51,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:51,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-02-21 03:06:51,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:51,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-21 03:06:51,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:51,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:06:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:06:51,450 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-02-21 03:06:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:52,010 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2022-02-21 03:06:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:06:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) Word has length 123 [2022-02-21 03:06:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-02-21 03:06:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2022-02-21 03:06:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-02-21 03:06:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2022-02-21 03:06:52,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 98 transitions. [2022-02-21 03:06:52,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:52,078 INFO L225 Difference]: With dead ends: 131 [2022-02-21 03:06:52,078 INFO L226 Difference]: Without dead ends: 73 [2022-02-21 03:06:52,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:06:52,079 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:52,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 134 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:06:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-21 03:06:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2022-02-21 03:06:52,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:52,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 70 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-02-21 03:06:52,121 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 70 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-02-21 03:06:52,121 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 70 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-02-21 03:06:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:52,122 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-02-21 03:06:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-02-21 03:06:52,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:52,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:52,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Second operand 73 states. [2022-02-21 03:06:52,123 INFO L87 Difference]: Start difference. First operand has 70 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Second operand 73 states. [2022-02-21 03:06:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:52,125 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-02-21 03:06:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-02-21 03:06:52,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:52,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:52,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:52,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 54 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-02-21 03:06:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-02-21 03:06:52,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 123 [2022-02-21 03:06:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:52,128 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-02-21 03:06:52,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2022-02-21 03:06:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-02-21 03:06:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-02-21 03:06:52,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:52,129 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 4, 1, 1, 1, 1, 1] [2022-02-21 03:06:52,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:52,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:06:52,343 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash 570135007, now seen corresponding path program 6 times [2022-02-21 03:06:52,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:52,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639136716] [2022-02-21 03:06:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:06:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,497 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10116#true} {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,503 INFO L272 TraceCheckUtils]: 5: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,507 INFO L272 TraceCheckUtils]: 14: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,508 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10116#true} {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume true; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,510 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10397#(<= |fibonacci_#in~n| 2)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,514 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10116#true} {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,516 INFO L272 TraceCheckUtils]: 5: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,517 INFO L272 TraceCheckUtils]: 11: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,519 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,521 INFO L272 TraceCheckUtils]: 20: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,522 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10116#true} {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume true; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,524 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {10397#(<= |fibonacci_#in~n| 2)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,525 INFO L272 TraceCheckUtils]: 33: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,526 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10116#true} {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume true; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,528 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10386#(<= |fibonacci_#in~n| 3)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:06:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,545 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L272 TraceCheckUtils]: 5: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L272 TraceCheckUtils]: 14: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,551 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:52,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,552 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10116#true} {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,554 INFO L272 TraceCheckUtils]: 5: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,556 INFO L272 TraceCheckUtils]: 11: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,557 INFO L272 TraceCheckUtils]: 17: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,559 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,561 INFO L272 TraceCheckUtils]: 26: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,562 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10116#true} {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume true; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,564 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10397#(<= |fibonacci_#in~n| 2)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,565 INFO L272 TraceCheckUtils]: 39: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,566 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10116#true} {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume true; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,568 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10386#(<= |fibonacci_#in~n| 3)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,569 INFO L272 TraceCheckUtils]: 53: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L272 TraceCheckUtils]: 59: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,570 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L290 TraceCheckUtils]: 67: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L272 TraceCheckUtils]: 68: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L290 TraceCheckUtils]: 71: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,571 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,572 INFO L290 TraceCheckUtils]: 74: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,572 INFO L290 TraceCheckUtils]: 75: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:52,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,573 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10116#true} {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,573 INFO L290 TraceCheckUtils]: 78: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,573 INFO L290 TraceCheckUtils]: 79: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,574 INFO L290 TraceCheckUtils]: 80: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,574 INFO L290 TraceCheckUtils]: 81: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume true; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,575 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10355#(<= |fibonacci_#in~n| 4)} {10116#true} #47#return; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-21 03:06:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,692 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,698 INFO L272 TraceCheckUtils]: 5: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,701 INFO L272 TraceCheckUtils]: 14: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,702 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume true; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,704 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10520#(<= 2 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,712 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10116#true} {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,714 INFO L272 TraceCheckUtils]: 5: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,715 INFO L272 TraceCheckUtils]: 11: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,717 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,718 INFO L272 TraceCheckUtils]: 20: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,719 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume true; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,721 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {10520#(<= 2 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,722 INFO L272 TraceCheckUtils]: 33: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,724 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10116#true} {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume true; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,725 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10508#(<= 3 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:06:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,739 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L272 TraceCheckUtils]: 5: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L272 TraceCheckUtils]: 14: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,745 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:52,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,746 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10116#true} {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,748 INFO L272 TraceCheckUtils]: 5: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,750 INFO L272 TraceCheckUtils]: 11: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,751 INFO L272 TraceCheckUtils]: 17: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,753 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,754 INFO L272 TraceCheckUtils]: 26: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,755 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume true; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,757 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10520#(<= 2 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,758 INFO L272 TraceCheckUtils]: 39: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,759 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10116#true} {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume true; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,761 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10508#(<= 3 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,763 INFO L272 TraceCheckUtils]: 53: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L272 TraceCheckUtils]: 59: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,763 INFO L290 TraceCheckUtils]: 60: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L272 TraceCheckUtils]: 68: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L290 TraceCheckUtils]: 71: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:52,766 INFO L290 TraceCheckUtils]: 76: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,767 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10116#true} {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,767 INFO L290 TraceCheckUtils]: 78: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,767 INFO L290 TraceCheckUtils]: 79: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume true; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,768 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10477#(<= 4 |fibonacci_#in~n|)} {10201#(<= fibonacci_~n 5)} #49#return; {10117#false} is VALID [2022-02-21 03:06:52,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#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); {10116#true} is VALID [2022-02-21 03:06:52,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10116#true} is VALID [2022-02-21 03:06:52,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume !(main_~x~0#1 < 1); {10116#true} is VALID [2022-02-21 03:06:52,769 INFO L272 TraceCheckUtils]: 3: Hoare triple {10116#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10116#true} is VALID [2022-02-21 03:06:52,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,770 INFO L272 TraceCheckUtils]: 9: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,771 INFO L272 TraceCheckUtils]: 15: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,773 INFO L272 TraceCheckUtils]: 21: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,775 INFO L272 TraceCheckUtils]: 27: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:52,777 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,778 INFO L272 TraceCheckUtils]: 36: Hoare triple {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,779 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10116#true} {10392#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {10397#(<= |fibonacci_#in~n| 2)} assume true; {10397#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:06:52,781 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10397#(<= |fibonacci_#in~n| 2)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,782 INFO L272 TraceCheckUtils]: 49: Hoare triple {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,783 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10116#true} {10380#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,784 INFO L290 TraceCheckUtils]: 58: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume true; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:52,785 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10386#(<= |fibonacci_#in~n| 3)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,786 INFO L272 TraceCheckUtils]: 63: Hoare triple {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L272 TraceCheckUtils]: 69: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 70: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L290 TraceCheckUtils]: 73: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L272 TraceCheckUtils]: 78: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,789 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,789 INFO L290 TraceCheckUtils]: 83: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:52,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,790 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10116#true} {10330#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,790 INFO L290 TraceCheckUtils]: 88: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,791 INFO L290 TraceCheckUtils]: 89: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,791 INFO L290 TraceCheckUtils]: 91: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume true; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:52,792 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10355#(<= |fibonacci_#in~n| 4)} {10116#true} #47#return; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:52,792 INFO L290 TraceCheckUtils]: 93: Hoare triple {10201#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:52,793 INFO L290 TraceCheckUtils]: 94: Hoare triple {10201#(<= fibonacci_~n 5)} assume ~n - 2 <= 2147483647; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:52,793 INFO L290 TraceCheckUtils]: 95: Hoare triple {10201#(<= fibonacci_~n 5)} assume ~n - 2 >= -2147483648; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:52,793 INFO L272 TraceCheckUtils]: 96: Hoare triple {10201#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,793 INFO L290 TraceCheckUtils]: 97: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,794 INFO L290 TraceCheckUtils]: 98: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,794 INFO L290 TraceCheckUtils]: 99: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,794 INFO L290 TraceCheckUtils]: 100: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,795 INFO L290 TraceCheckUtils]: 101: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,795 INFO L272 TraceCheckUtils]: 102: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,795 INFO L290 TraceCheckUtils]: 103: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,795 INFO L290 TraceCheckUtils]: 104: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,796 INFO L290 TraceCheckUtils]: 105: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,796 INFO L290 TraceCheckUtils]: 106: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,796 INFO L290 TraceCheckUtils]: 107: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,796 INFO L272 TraceCheckUtils]: 108: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,797 INFO L290 TraceCheckUtils]: 109: Hoare triple {10116#true} ~n := #in~n; {10285#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {10285#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,797 INFO L290 TraceCheckUtils]: 111: Hoare triple {10509#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,798 INFO L290 TraceCheckUtils]: 112: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,798 INFO L290 TraceCheckUtils]: 113: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,798 INFO L272 TraceCheckUtils]: 114: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,798 INFO L290 TraceCheckUtils]: 115: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,798 INFO L290 TraceCheckUtils]: 116: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,799 INFO L290 TraceCheckUtils]: 117: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,799 INFO L290 TraceCheckUtils]: 118: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,799 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,800 INFO L290 TraceCheckUtils]: 120: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,800 INFO L290 TraceCheckUtils]: 121: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,800 INFO L290 TraceCheckUtils]: 122: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,801 INFO L272 TraceCheckUtils]: 123: Hoare triple {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,801 INFO L290 TraceCheckUtils]: 124: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,801 INFO L290 TraceCheckUtils]: 125: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,801 INFO L290 TraceCheckUtils]: 126: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,802 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {10116#true} {10510#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,802 INFO L290 TraceCheckUtils]: 128: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,802 INFO L290 TraceCheckUtils]: 129: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,803 INFO L290 TraceCheckUtils]: 130: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,803 INFO L290 TraceCheckUtils]: 131: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume true; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,804 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {10520#(<= 2 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,804 INFO L290 TraceCheckUtils]: 133: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,804 INFO L290 TraceCheckUtils]: 134: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,805 INFO L290 TraceCheckUtils]: 135: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,805 INFO L272 TraceCheckUtils]: 136: Hoare triple {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,805 INFO L290 TraceCheckUtils]: 137: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,805 INFO L290 TraceCheckUtils]: 138: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,805 INFO L290 TraceCheckUtils]: 139: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,805 INFO L290 TraceCheckUtils]: 140: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,806 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {10116#true} {10502#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,806 INFO L290 TraceCheckUtils]: 142: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,807 INFO L290 TraceCheckUtils]: 143: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,807 INFO L290 TraceCheckUtils]: 144: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,807 INFO L290 TraceCheckUtils]: 145: Hoare triple {10508#(<= 3 |fibonacci_#in~n|)} assume true; {10508#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,808 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {10508#(<= 3 |fibonacci_#in~n|)} {10285#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,808 INFO L290 TraceCheckUtils]: 147: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,809 INFO L290 TraceCheckUtils]: 148: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,809 INFO L290 TraceCheckUtils]: 149: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:52,809 INFO L272 TraceCheckUtils]: 150: Hoare triple {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,809 INFO L290 TraceCheckUtils]: 151: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,809 INFO L290 TraceCheckUtils]: 152: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,809 INFO L290 TraceCheckUtils]: 153: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L290 TraceCheckUtils]: 154: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L290 TraceCheckUtils]: 155: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L272 TraceCheckUtils]: 156: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L290 TraceCheckUtils]: 157: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L290 TraceCheckUtils]: 158: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L290 TraceCheckUtils]: 159: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L290 TraceCheckUtils]: 160: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,810 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L290 TraceCheckUtils]: 162: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L290 TraceCheckUtils]: 163: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L290 TraceCheckUtils]: 164: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L272 TraceCheckUtils]: 165: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L290 TraceCheckUtils]: 166: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L290 TraceCheckUtils]: 167: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:52,811 INFO L290 TraceCheckUtils]: 168: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,812 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:52,812 INFO L290 TraceCheckUtils]: 170: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,812 INFO L290 TraceCheckUtils]: 171: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:52,812 INFO L290 TraceCheckUtils]: 172: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:52,812 INFO L290 TraceCheckUtils]: 173: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:52,813 INFO L284 TraceCheckUtils]: 174: Hoare quadruple {10116#true} {10452#(and (<= 4 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,814 INFO L290 TraceCheckUtils]: 175: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,814 INFO L290 TraceCheckUtils]: 176: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,814 INFO L290 TraceCheckUtils]: 177: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,814 INFO L290 TraceCheckUtils]: 178: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume true; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:52,815 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {10477#(<= 4 |fibonacci_#in~n|)} {10201#(<= fibonacci_~n 5)} #49#return; {10117#false} is VALID [2022-02-21 03:06:52,815 INFO L290 TraceCheckUtils]: 180: Hoare triple {10117#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10117#false} is VALID [2022-02-21 03:06:52,815 INFO L290 TraceCheckUtils]: 181: Hoare triple {10117#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {10117#false} is VALID [2022-02-21 03:06:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 228 proven. 420 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-02-21 03:06:52,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:52,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639136716] [2022-02-21 03:06:52,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639136716] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:52,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667888558] [2022-02-21 03:06:52,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:06:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:52,832 INFO L229 MonitoredProcess]: Starting monitored process 11 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:06:52,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:06:52,923 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-02-21 03:06:52,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:06:52,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:06:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:52,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:53,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#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); {10116#true} is VALID [2022-02-21 03:06:53,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10116#true} is VALID [2022-02-21 03:06:53,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume !(main_~x~0#1 < 1); {10116#true} is VALID [2022-02-21 03:06:53,497 INFO L272 TraceCheckUtils]: 3: Hoare triple {10116#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L272 TraceCheckUtils]: 9: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {10116#true} ~n := #in~n; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,499 INFO L272 TraceCheckUtils]: 15: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} ~n := #in~n; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,501 INFO L272 TraceCheckUtils]: 21: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L272 TraceCheckUtils]: 27: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L272 TraceCheckUtils]: 36: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:53,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,503 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10116#true} {10563#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 2 <= 2147483647; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 2 >= -2147483648; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,504 INFO L272 TraceCheckUtils]: 49: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {10116#true} ~n := #in~n; {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {10563#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:06:53,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {10563#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:53,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:53,506 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {10563#(<= |fibonacci_#in~n| fibonacci_~n)} #49#return; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:53,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:53,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:53,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:53,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume true; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:53,508 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10386#(<= |fibonacci_#in~n| 3)} {10563#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume ~n - 2 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume ~n - 2 >= -2147483648; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,509 INFO L272 TraceCheckUtils]: 63: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L272 TraceCheckUtils]: 69: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L290 TraceCheckUtils]: 73: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,510 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L290 TraceCheckUtils]: 76: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L290 TraceCheckUtils]: 77: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L272 TraceCheckUtils]: 78: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L290 TraceCheckUtils]: 79: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L290 TraceCheckUtils]: 80: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L290 TraceCheckUtils]: 81: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,511 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:53,512 INFO L290 TraceCheckUtils]: 83: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,512 INFO L290 TraceCheckUtils]: 84: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:53,512 INFO L290 TraceCheckUtils]: 86: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,524 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10116#true} {10355#(<= |fibonacci_#in~n| 4)} #49#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,524 INFO L290 TraceCheckUtils]: 88: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,524 INFO L290 TraceCheckUtils]: 89: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,525 INFO L290 TraceCheckUtils]: 91: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume true; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:53,526 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10355#(<= |fibonacci_#in~n| 4)} {10116#true} #47#return; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:53,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {10201#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:53,527 INFO L290 TraceCheckUtils]: 94: Hoare triple {10201#(<= fibonacci_~n 5)} assume ~n - 2 <= 2147483647; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:53,527 INFO L290 TraceCheckUtils]: 95: Hoare triple {10201#(<= fibonacci_~n 5)} assume ~n - 2 >= -2147483648; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:53,527 INFO L272 TraceCheckUtils]: 96: Hoare triple {10201#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,527 INFO L290 TraceCheckUtils]: 97: Hoare triple {10116#true} ~n := #in~n; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,528 INFO L290 TraceCheckUtils]: 99: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,528 INFO L290 TraceCheckUtils]: 100: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,529 INFO L290 TraceCheckUtils]: 101: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,529 INFO L272 TraceCheckUtils]: 102: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,529 INFO L290 TraceCheckUtils]: 103: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,529 INFO L290 TraceCheckUtils]: 104: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,529 INFO L290 TraceCheckUtils]: 105: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:53,529 INFO L290 TraceCheckUtils]: 106: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,529 INFO L290 TraceCheckUtils]: 107: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L272 TraceCheckUtils]: 108: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L290 TraceCheckUtils]: 109: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L290 TraceCheckUtils]: 110: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L290 TraceCheckUtils]: 111: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L290 TraceCheckUtils]: 112: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L290 TraceCheckUtils]: 113: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L272 TraceCheckUtils]: 114: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,530 INFO L290 TraceCheckUtils]: 115: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L290 TraceCheckUtils]: 116: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L290 TraceCheckUtils]: 117: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L290 TraceCheckUtils]: 118: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L290 TraceCheckUtils]: 120: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L290 TraceCheckUtils]: 121: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,531 INFO L290 TraceCheckUtils]: 122: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L272 TraceCheckUtils]: 123: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L290 TraceCheckUtils]: 124: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L290 TraceCheckUtils]: 125: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L290 TraceCheckUtils]: 126: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L290 TraceCheckUtils]: 128: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L290 TraceCheckUtils]: 129: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,532 INFO L290 TraceCheckUtils]: 130: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L290 TraceCheckUtils]: 131: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L290 TraceCheckUtils]: 133: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L290 TraceCheckUtils]: 134: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L290 TraceCheckUtils]: 135: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L272 TraceCheckUtils]: 136: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L290 TraceCheckUtils]: 137: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,533 INFO L290 TraceCheckUtils]: 138: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L290 TraceCheckUtils]: 139: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L290 TraceCheckUtils]: 140: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L290 TraceCheckUtils]: 142: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L290 TraceCheckUtils]: 143: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L290 TraceCheckUtils]: 144: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:53,534 INFO L290 TraceCheckUtils]: 145: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,535 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {10116#true} {10825#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,535 INFO L290 TraceCheckUtils]: 147: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,536 INFO L290 TraceCheckUtils]: 148: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,536 INFO L290 TraceCheckUtils]: 149: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,536 INFO L272 TraceCheckUtils]: 150: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,536 INFO L290 TraceCheckUtils]: 151: Hoare triple {10116#true} ~n := #in~n; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,537 INFO L290 TraceCheckUtils]: 152: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,537 INFO L290 TraceCheckUtils]: 153: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,537 INFO L290 TraceCheckUtils]: 154: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,538 INFO L290 TraceCheckUtils]: 155: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,538 INFO L272 TraceCheckUtils]: 156: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:53,538 INFO L290 TraceCheckUtils]: 157: Hoare triple {10116#true} ~n := #in~n; {10825#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,538 INFO L290 TraceCheckUtils]: 158: Hoare triple {10825#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {11009#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,539 INFO L290 TraceCheckUtils]: 159: Hoare triple {11009#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {11009#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,539 INFO L290 TraceCheckUtils]: 160: Hoare triple {11009#(<= 1 |fibonacci_#in~n|)} assume true; {11009#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,540 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {11009#(<= 1 |fibonacci_#in~n|)} {10825#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,540 INFO L290 TraceCheckUtils]: 162: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,540 INFO L290 TraceCheckUtils]: 163: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,541 INFO L290 TraceCheckUtils]: 164: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,541 INFO L272 TraceCheckUtils]: 165: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:53,541 INFO L290 TraceCheckUtils]: 166: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:53,541 INFO L290 TraceCheckUtils]: 167: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:53,541 INFO L290 TraceCheckUtils]: 168: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:53,542 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {10116#true} {10520#(<= 2 |fibonacci_#in~n|)} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,542 INFO L290 TraceCheckUtils]: 170: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,542 INFO L290 TraceCheckUtils]: 171: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,543 INFO L290 TraceCheckUtils]: 172: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,543 INFO L290 TraceCheckUtils]: 173: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume true; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,544 INFO L284 TraceCheckUtils]: 174: Hoare quadruple {10520#(<= 2 |fibonacci_#in~n|)} {10825#(<= fibonacci_~n |fibonacci_#in~n|)} #49#return; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,544 INFO L290 TraceCheckUtils]: 175: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,544 INFO L290 TraceCheckUtils]: 176: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,545 INFO L290 TraceCheckUtils]: 177: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,545 INFO L290 TraceCheckUtils]: 178: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume true; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:53,546 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {10477#(<= 4 |fibonacci_#in~n|)} {10201#(<= fibonacci_~n 5)} #49#return; {10117#false} is VALID [2022-02-21 03:06:53,546 INFO L290 TraceCheckUtils]: 180: Hoare triple {10117#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10117#false} is VALID [2022-02-21 03:06:53,546 INFO L290 TraceCheckUtils]: 181: Hoare triple {10117#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {10117#false} is VALID [2022-02-21 03:06:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 295 proven. 305 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2022-02-21 03:06:53,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:06:55,406 INFO L290 TraceCheckUtils]: 181: Hoare triple {10117#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {10117#false} is VALID [2022-02-21 03:06:55,406 INFO L290 TraceCheckUtils]: 180: Hoare triple {10117#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10117#false} is VALID [2022-02-21 03:06:55,407 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {10477#(<= 4 |fibonacci_#in~n|)} {10201#(<= fibonacci_~n 5)} #49#return; {10117#false} is VALID [2022-02-21 03:06:55,407 INFO L290 TraceCheckUtils]: 178: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume true; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,407 INFO L290 TraceCheckUtils]: 177: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,408 INFO L290 TraceCheckUtils]: 176: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,408 INFO L290 TraceCheckUtils]: 175: Hoare triple {10477#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,409 INFO L284 TraceCheckUtils]: 174: Hoare quadruple {10520#(<= 2 |fibonacci_#in~n|)} {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} #49#return; {10477#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,409 INFO L290 TraceCheckUtils]: 173: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume true; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,409 INFO L290 TraceCheckUtils]: 172: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,409 INFO L290 TraceCheckUtils]: 171: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,410 INFO L290 TraceCheckUtils]: 170: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,410 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {10116#true} {10520#(<= 2 |fibonacci_#in~n|)} #49#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,410 INFO L290 TraceCheckUtils]: 168: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,410 INFO L290 TraceCheckUtils]: 167: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:55,410 INFO L290 TraceCheckUtils]: 166: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,411 INFO L272 TraceCheckUtils]: 165: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,411 INFO L290 TraceCheckUtils]: 164: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,411 INFO L290 TraceCheckUtils]: 163: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,411 INFO L290 TraceCheckUtils]: 162: Hoare triple {10520#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,412 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {11009#(<= 1 |fibonacci_#in~n|)} {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #47#return; {10520#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,412 INFO L290 TraceCheckUtils]: 160: Hoare triple {11009#(<= 1 |fibonacci_#in~n|)} assume true; {11009#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,413 INFO L290 TraceCheckUtils]: 159: Hoare triple {11009#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {11009#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,413 INFO L290 TraceCheckUtils]: 158: Hoare triple {11159#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {11009#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:06:55,413 INFO L290 TraceCheckUtils]: 157: Hoare triple {10116#true} ~n := #in~n; {11159#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:06:55,414 INFO L272 TraceCheckUtils]: 156: Hoare triple {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,414 INFO L290 TraceCheckUtils]: 155: Hoare triple {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:55,414 INFO L290 TraceCheckUtils]: 154: Hoare triple {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:55,415 INFO L290 TraceCheckUtils]: 153: Hoare triple {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:55,415 INFO L290 TraceCheckUtils]: 152: Hoare triple {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:55,415 INFO L290 TraceCheckUtils]: 151: Hoare triple {10116#true} ~n := #in~n; {11146#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:06:55,415 INFO L272 TraceCheckUtils]: 150: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,416 INFO L290 TraceCheckUtils]: 149: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,416 INFO L290 TraceCheckUtils]: 148: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,416 INFO L290 TraceCheckUtils]: 147: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,417 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {10116#true} {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} #47#return; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,417 INFO L290 TraceCheckUtils]: 145: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,417 INFO L290 TraceCheckUtils]: 144: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:55,417 INFO L290 TraceCheckUtils]: 143: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,417 INFO L290 TraceCheckUtils]: 142: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,417 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:55,417 INFO L290 TraceCheckUtils]: 140: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,417 INFO L290 TraceCheckUtils]: 139: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 138: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 137: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L272 TraceCheckUtils]: 136: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 135: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 134: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 133: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 131: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 130: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 129: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 128: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 126: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,418 INFO L290 TraceCheckUtils]: 125: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 124: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L272 TraceCheckUtils]: 123: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 122: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 121: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 120: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 118: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 117: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 116: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 115: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L272 TraceCheckUtils]: 114: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 113: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 112: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,419 INFO L290 TraceCheckUtils]: 111: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 110: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 109: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L272 TraceCheckUtils]: 108: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 107: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 106: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 105: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 103: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L272 TraceCheckUtils]: 102: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,420 INFO L290 TraceCheckUtils]: 101: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,421 INFO L290 TraceCheckUtils]: 100: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,421 INFO L290 TraceCheckUtils]: 99: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(1 == ~n); {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,421 INFO L290 TraceCheckUtils]: 98: Hoare triple {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(~n < 1); {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,422 INFO L290 TraceCheckUtils]: 97: Hoare triple {10116#true} ~n := #in~n; {11103#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:06:55,422 INFO L272 TraceCheckUtils]: 96: Hoare triple {10201#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,422 INFO L290 TraceCheckUtils]: 95: Hoare triple {10201#(<= fibonacci_~n 5)} assume ~n - 2 >= -2147483648; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:55,422 INFO L290 TraceCheckUtils]: 94: Hoare triple {10201#(<= fibonacci_~n 5)} assume ~n - 2 <= 2147483647; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:55,423 INFO L290 TraceCheckUtils]: 93: Hoare triple {10201#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:55,424 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10355#(<= |fibonacci_#in~n| 4)} {10116#true} #47#return; {10201#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:06:55,424 INFO L290 TraceCheckUtils]: 91: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume true; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,424 INFO L290 TraceCheckUtils]: 90: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,425 INFO L290 TraceCheckUtils]: 88: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,425 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {10116#true} {10355#(<= |fibonacci_#in~n| 4)} #49#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,425 INFO L290 TraceCheckUtils]: 86: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:55,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 83: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 81: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L272 TraceCheckUtils]: 78: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 76: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L272 TraceCheckUtils]: 69: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L272 TraceCheckUtils]: 63: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume ~n - 2 >= -2147483648; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume ~n - 2 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {10355#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,429 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10386#(<= |fibonacci_#in~n| 3)} {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} #47#return; {10355#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:06:55,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume true; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:55,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:55,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:55,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {10386#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:55,431 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10398#(<= |fibonacci_#in~n| 1)} {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #49#return; {10386#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:06:55,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {10398#(<= |fibonacci_#in~n| 1)} assume true; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:55,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {11480#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {10398#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:06:55,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {11480#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {11480#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:55,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {10116#true} ~n := #in~n; {11480#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:06:55,432 INFO L272 TraceCheckUtils]: 49: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 2 >= -2147483648; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 2 <= 2147483647; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,433 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10116#true} {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #47#return; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {10116#true} assume #t~ret4 + #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {10116#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10116#true} {10116#true} #49#return; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {10116#true} assume ~n < 1;#res := 0; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L272 TraceCheckUtils]: 36: Hoare triple {10116#true} call #t~ret5 := fibonacci(~n - 2); {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {10116#true} assume ~n - 2 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {10116#true} assume ~n - 2 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {10116#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10116#true} {10116#true} #47#return; {10116#true} is VALID [2022-02-21 03:06:55,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {10116#true} assume true; {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {10116#true} assume 1 == ~n;#res := 1; {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L272 TraceCheckUtils]: 27: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:55,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,436 INFO L272 TraceCheckUtils]: 21: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 >= -2147483648; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 <= 2147483647; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {10116#true} ~n := #in~n; {11470#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:06:55,449 INFO L272 TraceCheckUtils]: 15: Hoare triple {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume ~n - 1 >= -2147483648; {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:06:55,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume ~n - 1 <= 2147483647; {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:06:55,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume !(1 == ~n); {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:06:55,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume !(~n < 1); {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:06:55,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {10116#true} ~n := #in~n; {11451#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:06:55,451 INFO L272 TraceCheckUtils]: 9: Hoare triple {10116#true} call #t~ret4 := fibonacci(~n - 1); {10116#true} is VALID [2022-02-21 03:06:55,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {10116#true} assume ~n - 1 >= -2147483648; {10116#true} is VALID [2022-02-21 03:06:55,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {10116#true} assume ~n - 1 <= 2147483647; {10116#true} is VALID [2022-02-21 03:06:55,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {10116#true} assume !(1 == ~n); {10116#true} is VALID [2022-02-21 03:06:55,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {10116#true} assume !(~n < 1); {10116#true} is VALID [2022-02-21 03:06:55,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {10116#true} ~n := #in~n; {10116#true} is VALID [2022-02-21 03:06:55,451 INFO L272 TraceCheckUtils]: 3: Hoare triple {10116#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {10116#true} is VALID [2022-02-21 03:06:55,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {10116#true} assume !(main_~x~0#1 < 1); {10116#true} is VALID [2022-02-21 03:06:55,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {10116#true} is VALID [2022-02-21 03:06:55,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#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); {10116#true} is VALID [2022-02-21 03:06:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 295 proven. 321 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2022-02-21 03:06:55,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667888558] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:06:55,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:06:55,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 15] total 27 [2022-02-21 03:06:55,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566514017] [2022-02-21 03:06:55,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:06:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) Word has length 182 [2022-02-21 03:06:57,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:06:57,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) [2022-02-21 03:06:57,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:57,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-21 03:06:57,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:06:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-21 03:06:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2022-02-21 03:06:57,451 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) [2022-02-21 03:06:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:58,243 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2022-02-21 03:06:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 03:06:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) Word has length 182 [2022-02-21 03:06:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:06:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) [2022-02-21 03:06:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 122 transitions. [2022-02-21 03:06:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) [2022-02-21 03:06:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 122 transitions. [2022-02-21 03:06:58,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 122 transitions. [2022-02-21 03:06:58,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:06:58,341 INFO L225 Difference]: With dead ends: 162 [2022-02-21 03:06:58,341 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 03:06:58,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=408, Invalid=1074, Unknown=0, NotChecked=0, Total=1482 [2022-02-21 03:06:58,345 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 216 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:06:58,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 126 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:06:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 03:06:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2022-02-21 03:06:58,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:06:58,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 83 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2022-02-21 03:06:58,403 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 83 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2022-02-21 03:06:58,404 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 83 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2022-02-21 03:06:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:58,406 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-02-21 03:06:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-02-21 03:06:58,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:58,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:58,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Second operand 98 states. [2022-02-21 03:06:58,407 INFO L87 Difference]: Start difference. First operand has 83 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Second operand 98 states. [2022-02-21 03:06:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:06:58,409 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-02-21 03:06:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-02-21 03:06:58,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:06:58,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:06:58,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:06:58,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:06:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2022-02-21 03:06:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-02-21 03:06:58,415 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 182 [2022-02-21 03:06:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:06:58,416 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-02-21 03:06:58,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (30), 19 states have call predecessors, (30), 17 states have call successors, (30) [2022-02-21 03:06:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-02-21 03:06:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-21 03:06:58,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:06:58,417 INFO L514 BasicCegarLoop]: trace histogram [16, 14, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1, 1] [2022-02-21 03:06:58,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:06:58,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-21 03:06:58,633 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:06:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:06:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 111090145, now seen corresponding path program 7 times [2022-02-21 03:06:58,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:06:58,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105586231] [2022-02-21 03:06:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:06:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:06:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:06:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,801 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,814 INFO L272 TraceCheckUtils]: 5: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,816 INFO L272 TraceCheckUtils]: 14: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,818 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,820 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,826 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L272 TraceCheckUtils]: 5: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,828 INFO L272 TraceCheckUtils]: 11: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,829 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,830 INFO L272 TraceCheckUtils]: 20: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,832 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,834 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,835 INFO L272 TraceCheckUtils]: 33: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,836 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,838 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12145#true} #47#return; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:06:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,856 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,864 INFO L272 TraceCheckUtils]: 5: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,866 INFO L272 TraceCheckUtils]: 14: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,867 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,870 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12320#(<= |fibonacci_#t~ret4| 2)} #49#return; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L272 TraceCheckUtils]: 5: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L272 TraceCheckUtils]: 11: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L272 TraceCheckUtils]: 17: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,874 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,874 INFO L272 TraceCheckUtils]: 26: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,876 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,878 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,879 INFO L272 TraceCheckUtils]: 39: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,880 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,882 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12145#true} #47#return; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume ~n - 2 <= 2147483647; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume ~n - 2 >= -2147483648; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,883 INFO L272 TraceCheckUtils]: 53: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 55: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,884 INFO L272 TraceCheckUtils]: 59: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,884 INFO L290 TraceCheckUtils]: 60: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,885 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,886 INFO L290 TraceCheckUtils]: 67: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,886 INFO L272 TraceCheckUtils]: 68: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,887 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,888 INFO L290 TraceCheckUtils]: 73: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,888 INFO L290 TraceCheckUtils]: 74: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,888 INFO L290 TraceCheckUtils]: 75: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,889 INFO L290 TraceCheckUtils]: 76: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,889 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12320#(<= |fibonacci_#t~ret4| 2)} #49#return; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,890 INFO L290 TraceCheckUtils]: 78: Hoare triple {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,890 INFO L290 TraceCheckUtils]: 79: Hoare triple {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12346#(<= |fibonacci_#res| 3)} is VALID [2022-02-21 03:06:58,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {12346#(<= |fibonacci_#res| 3)} assume true; {12346#(<= |fibonacci_#res| 3)} is VALID [2022-02-21 03:06:58,891 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12346#(<= |fibonacci_#res| 3)} {12145#true} #47#return; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:58,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-02-21 03:06:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:06:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,927 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:06:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,934 INFO L272 TraceCheckUtils]: 5: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,936 INFO L272 TraceCheckUtils]: 14: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,937 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,939 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:06:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:58,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,948 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L272 TraceCheckUtils]: 5: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,951 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,952 INFO L272 TraceCheckUtils]: 20: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,954 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,955 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,956 INFO L272 TraceCheckUtils]: 33: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,958 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,960 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12230#(<= |fibonacci_#t~ret4| 3)} #49#return; {12275#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 5)} is VALID [2022-02-21 03:06:58,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#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); {12145#true} is VALID [2022-02-21 03:06:58,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {12145#true} is VALID [2022-02-21 03:06:58,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(main_~x~0#1 < 1); {12145#true} is VALID [2022-02-21 03:06:58,960 INFO L272 TraceCheckUtils]: 3: Hoare triple {12145#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {12145#true} is VALID [2022-02-21 03:06:58,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L272 TraceCheckUtils]: 9: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L272 TraceCheckUtils]: 15: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L272 TraceCheckUtils]: 21: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L272 TraceCheckUtils]: 27: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,964 INFO L272 TraceCheckUtils]: 33: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,965 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,966 INFO L272 TraceCheckUtils]: 42: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,967 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,969 INFO L290 TraceCheckUtils]: 50: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,969 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,970 INFO L272 TraceCheckUtils]: 55: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,970 INFO L290 TraceCheckUtils]: 56: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,972 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,974 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12145#true} #47#return; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,974 INFO L290 TraceCheckUtils]: 66: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume ~n - 2 <= 2147483647; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume ~n - 2 >= -2147483648; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:58,975 INFO L272 TraceCheckUtils]: 69: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 72: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L272 TraceCheckUtils]: 75: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,975 INFO L290 TraceCheckUtils]: 77: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,976 INFO L290 TraceCheckUtils]: 78: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,977 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,977 INFO L290 TraceCheckUtils]: 82: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,977 INFO L290 TraceCheckUtils]: 83: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,978 INFO L272 TraceCheckUtils]: 84: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,978 INFO L290 TraceCheckUtils]: 85: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,978 INFO L290 TraceCheckUtils]: 86: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,978 INFO L290 TraceCheckUtils]: 87: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,979 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,979 INFO L290 TraceCheckUtils]: 89: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,980 INFO L290 TraceCheckUtils]: 90: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,980 INFO L290 TraceCheckUtils]: 91: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,980 INFO L290 TraceCheckUtils]: 92: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,981 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12320#(<= |fibonacci_#t~ret4| 2)} #49#return; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,981 INFO L290 TraceCheckUtils]: 94: Hoare triple {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} is VALID [2022-02-21 03:06:58,982 INFO L290 TraceCheckUtils]: 96: Hoare triple {12345#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12346#(<= |fibonacci_#res| 3)} is VALID [2022-02-21 03:06:58,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {12346#(<= |fibonacci_#res| 3)} assume true; {12346#(<= |fibonacci_#res| 3)} is VALID [2022-02-21 03:06:58,983 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {12346#(<= |fibonacci_#res| 3)} {12145#true} #47#return; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:58,983 INFO L290 TraceCheckUtils]: 99: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:58,984 INFO L290 TraceCheckUtils]: 100: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} assume ~n - 2 <= 2147483647; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:58,984 INFO L290 TraceCheckUtils]: 101: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} assume ~n - 2 >= -2147483648; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:58,984 INFO L272 TraceCheckUtils]: 102: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,984 INFO L290 TraceCheckUtils]: 103: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,984 INFO L290 TraceCheckUtils]: 104: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,984 INFO L290 TraceCheckUtils]: 105: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,984 INFO L290 TraceCheckUtils]: 106: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 107: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L272 TraceCheckUtils]: 108: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 109: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 110: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 111: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 112: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 113: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L272 TraceCheckUtils]: 114: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:58,985 INFO L290 TraceCheckUtils]: 115: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,986 INFO L290 TraceCheckUtils]: 116: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,986 INFO L290 TraceCheckUtils]: 117: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,986 INFO L290 TraceCheckUtils]: 118: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,987 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,987 INFO L290 TraceCheckUtils]: 120: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,987 INFO L290 TraceCheckUtils]: 121: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,987 INFO L290 TraceCheckUtils]: 122: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,988 INFO L272 TraceCheckUtils]: 123: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,988 INFO L290 TraceCheckUtils]: 124: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,988 INFO L290 TraceCheckUtils]: 125: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,988 INFO L290 TraceCheckUtils]: 126: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:58,989 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,989 INFO L290 TraceCheckUtils]: 128: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,990 INFO L290 TraceCheckUtils]: 129: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:06:58,990 INFO L290 TraceCheckUtils]: 130: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,990 INFO L290 TraceCheckUtils]: 131: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,991 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,991 INFO L290 TraceCheckUtils]: 133: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,991 INFO L290 TraceCheckUtils]: 134: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,992 INFO L290 TraceCheckUtils]: 135: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:58,992 INFO L272 TraceCheckUtils]: 136: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:58,992 INFO L290 TraceCheckUtils]: 137: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:58,992 INFO L290 TraceCheckUtils]: 138: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:58,992 INFO L290 TraceCheckUtils]: 139: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,993 INFO L290 TraceCheckUtils]: 140: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:58,993 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,994 INFO L290 TraceCheckUtils]: 142: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,994 INFO L290 TraceCheckUtils]: 143: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:06:58,994 INFO L290 TraceCheckUtils]: 144: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,995 INFO L290 TraceCheckUtils]: 145: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:58,995 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12230#(<= |fibonacci_#t~ret4| 3)} #49#return; {12275#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 5)} is VALID [2022-02-21 03:06:58,996 INFO L290 TraceCheckUtils]: 147: Hoare triple {12275#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 5)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12275#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 5)} is VALID [2022-02-21 03:06:58,996 INFO L290 TraceCheckUtils]: 148: Hoare triple {12275#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 5)} assume !(#t~ret4 + #t~ret5 <= 2147483647); {12146#false} is VALID [2022-02-21 03:06:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-02-21 03:06:58,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:06:58,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105586231] [2022-02-21 03:06:58,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105586231] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:06:58,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434234429] [2022-02-21 03:06:58,997 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-21 03:06:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:06:58,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:06:59,012 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:06:59,013 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:06:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:59,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-21 03:06:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:06:59,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:06:59,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#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); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(main_~x~0#1 < 1); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L272 TraceCheckUtils]: 3: Hoare triple {12145#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L272 TraceCheckUtils]: 9: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L272 TraceCheckUtils]: 15: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L272 TraceCheckUtils]: 21: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L272 TraceCheckUtils]: 27: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L272 TraceCheckUtils]: 33: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,859 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,860 INFO L272 TraceCheckUtils]: 42: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:59,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:59,862 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,864 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,865 INFO L272 TraceCheckUtils]: 55: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,866 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,867 INFO L290 TraceCheckUtils]: 61: Hoare triple {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,867 INFO L290 TraceCheckUtils]: 62: Hoare triple {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,867 INFO L290 TraceCheckUtils]: 63: Hoare triple {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:59,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:59,868 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12145#true} #47#return; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:59,868 INFO L290 TraceCheckUtils]: 66: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 67: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume ~n - 2 <= 2147483647; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 68: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} assume ~n - 2 >= -2147483648; {12320#(<= |fibonacci_#t~ret4| 2)} is VALID [2022-02-21 03:06:59,869 INFO L272 TraceCheckUtils]: 69: Hoare triple {12320#(<= |fibonacci_#t~ret4| 2)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 72: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 73: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 74: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L272 TraceCheckUtils]: 75: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 76: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,870 INFO L290 TraceCheckUtils]: 78: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,870 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,871 INFO L290 TraceCheckUtils]: 81: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,871 INFO L290 TraceCheckUtils]: 83: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,871 INFO L272 TraceCheckUtils]: 84: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,872 INFO L290 TraceCheckUtils]: 86: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:59,872 INFO L290 TraceCheckUtils]: 87: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:59,872 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,873 INFO L290 TraceCheckUtils]: 89: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,874 INFO L290 TraceCheckUtils]: 91: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,874 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12320#(<= |fibonacci_#t~ret4| 2)} #49#return; {12722#(and (<= |fibonacci_#t~ret4| 2) (<= |fibonacci_#t~ret5| 1))} is VALID [2022-02-21 03:06:59,875 INFO L290 TraceCheckUtils]: 94: Hoare triple {12722#(and (<= |fibonacci_#t~ret4| 2) (<= |fibonacci_#t~ret5| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12722#(and (<= |fibonacci_#t~ret4| 2) (<= |fibonacci_#t~ret5| 1))} is VALID [2022-02-21 03:06:59,875 INFO L290 TraceCheckUtils]: 95: Hoare triple {12722#(and (<= |fibonacci_#t~ret4| 2) (<= |fibonacci_#t~ret5| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {12722#(and (<= |fibonacci_#t~ret4| 2) (<= |fibonacci_#t~ret5| 1))} is VALID [2022-02-21 03:06:59,875 INFO L290 TraceCheckUtils]: 96: Hoare triple {12722#(and (<= |fibonacci_#t~ret4| 2) (<= |fibonacci_#t~ret5| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12346#(<= |fibonacci_#res| 3)} is VALID [2022-02-21 03:06:59,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {12346#(<= |fibonacci_#res| 3)} assume true; {12346#(<= |fibonacci_#res| 3)} is VALID [2022-02-21 03:06:59,876 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {12346#(<= |fibonacci_#res| 3)} {12145#true} #47#return; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:59,876 INFO L290 TraceCheckUtils]: 99: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 100: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} assume ~n - 2 <= 2147483647; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 101: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} assume ~n - 2 >= -2147483648; {12230#(<= |fibonacci_#t~ret4| 3)} is VALID [2022-02-21 03:06:59,877 INFO L272 TraceCheckUtils]: 102: Hoare triple {12230#(<= |fibonacci_#t~ret4| 3)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 103: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 104: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 105: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 106: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 107: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L272 TraceCheckUtils]: 108: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 109: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 110: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,877 INFO L290 TraceCheckUtils]: 111: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:06:59,878 INFO L290 TraceCheckUtils]: 112: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:06:59,878 INFO L290 TraceCheckUtils]: 113: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:06:59,878 INFO L272 TraceCheckUtils]: 114: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:06:59,878 INFO L290 TraceCheckUtils]: 115: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,878 INFO L290 TraceCheckUtils]: 116: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,878 INFO L290 TraceCheckUtils]: 117: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,878 INFO L290 TraceCheckUtils]: 118: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,879 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,879 INFO L290 TraceCheckUtils]: 120: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,879 INFO L290 TraceCheckUtils]: 121: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,880 INFO L290 TraceCheckUtils]: 122: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,880 INFO L272 TraceCheckUtils]: 123: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,880 INFO L290 TraceCheckUtils]: 124: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,880 INFO L290 TraceCheckUtils]: 125: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:59,880 INFO L290 TraceCheckUtils]: 126: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:06:59,881 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,881 INFO L290 TraceCheckUtils]: 128: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,882 INFO L290 TraceCheckUtils]: 130: Hoare triple {12579#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,882 INFO L290 TraceCheckUtils]: 131: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,883 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,883 INFO L290 TraceCheckUtils]: 133: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,883 INFO L290 TraceCheckUtils]: 134: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,883 INFO L290 TraceCheckUtils]: 135: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:06:59,883 INFO L272 TraceCheckUtils]: 136: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:06:59,883 INFO L290 TraceCheckUtils]: 137: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:06:59,884 INFO L290 TraceCheckUtils]: 138: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:06:59,884 INFO L290 TraceCheckUtils]: 139: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,884 INFO L290 TraceCheckUtils]: 140: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:06:59,885 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,885 INFO L290 TraceCheckUtils]: 142: Hoare triple {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,885 INFO L290 TraceCheckUtils]: 143: Hoare triple {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:06:59,886 INFO L290 TraceCheckUtils]: 144: Hoare triple {12622#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:59,886 INFO L290 TraceCheckUtils]: 145: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:06:59,886 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12230#(<= |fibonacci_#t~ret4| 3)} #49#return; {12882#(and (<= |fibonacci_#t~ret4| 3) (<= |fibonacci_#t~ret5| 2))} is VALID [2022-02-21 03:06:59,887 INFO L290 TraceCheckUtils]: 147: Hoare triple {12882#(and (<= |fibonacci_#t~ret4| 3) (<= |fibonacci_#t~ret5| 2))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12882#(and (<= |fibonacci_#t~ret4| 3) (<= |fibonacci_#t~ret5| 2))} is VALID [2022-02-21 03:06:59,887 INFO L290 TraceCheckUtils]: 148: Hoare triple {12882#(and (<= |fibonacci_#t~ret4| 3) (<= |fibonacci_#t~ret5| 2))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {12146#false} is VALID [2022-02-21 03:06:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-02-21 03:06:59,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:07:03,368 INFO L290 TraceCheckUtils]: 148: Hoare triple {12889#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} assume !(#t~ret4 + #t~ret5 <= 2147483647); {12146#false} is VALID [2022-02-21 03:07:03,368 INFO L290 TraceCheckUtils]: 147: Hoare triple {12889#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12889#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} is VALID [2022-02-21 03:07:03,369 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {12378#(<= |fibonacci_#res| 2)} {12896#(<= |fibonacci_#t~ret4| 2147483645)} #49#return; {12889#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} is VALID [2022-02-21 03:07:03,369 INFO L290 TraceCheckUtils]: 145: Hoare triple {12378#(<= |fibonacci_#res| 2)} assume true; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:07:03,370 INFO L290 TraceCheckUtils]: 144: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12378#(<= |fibonacci_#res| 2)} is VALID [2022-02-21 03:07:03,370 INFO L290 TraceCheckUtils]: 143: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:07:03,370 INFO L290 TraceCheckUtils]: 142: Hoare triple {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:07:03,371 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12377#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2)} is VALID [2022-02-21 03:07:03,371 INFO L290 TraceCheckUtils]: 140: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,371 INFO L290 TraceCheckUtils]: 139: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,371 INFO L290 TraceCheckUtils]: 138: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,371 INFO L290 TraceCheckUtils]: 137: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,372 INFO L272 TraceCheckUtils]: 136: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,372 INFO L290 TraceCheckUtils]: 135: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,372 INFO L290 TraceCheckUtils]: 134: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,372 INFO L290 TraceCheckUtils]: 133: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,373 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,373 INFO L290 TraceCheckUtils]: 131: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,373 INFO L290 TraceCheckUtils]: 130: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,374 INFO L290 TraceCheckUtils]: 129: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:03,374 INFO L290 TraceCheckUtils]: 128: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:03,375 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:03,375 INFO L290 TraceCheckUtils]: 126: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:03,375 INFO L290 TraceCheckUtils]: 125: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:03,375 INFO L290 TraceCheckUtils]: 124: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,375 INFO L272 TraceCheckUtils]: 123: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,375 INFO L290 TraceCheckUtils]: 122: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,376 INFO L290 TraceCheckUtils]: 121: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,376 INFO L290 TraceCheckUtils]: 120: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,376 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 118: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 117: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 116: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 115: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L272 TraceCheckUtils]: 114: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 113: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 112: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 111: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 110: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,377 INFO L290 TraceCheckUtils]: 109: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L272 TraceCheckUtils]: 108: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 107: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 106: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 105: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 104: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 103: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L272 TraceCheckUtils]: 102: Hoare triple {12896#(<= |fibonacci_#t~ret4| 2147483645)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 101: Hoare triple {12896#(<= |fibonacci_#t~ret4| 2147483645)} assume ~n - 2 >= -2147483648; {12896#(<= |fibonacci_#t~ret4| 2147483645)} is VALID [2022-02-21 03:07:03,378 INFO L290 TraceCheckUtils]: 100: Hoare triple {12896#(<= |fibonacci_#t~ret4| 2147483645)} assume ~n - 2 <= 2147483647; {12896#(<= |fibonacci_#t~ret4| 2147483645)} is VALID [2022-02-21 03:07:03,379 INFO L290 TraceCheckUtils]: 99: Hoare triple {12896#(<= |fibonacci_#t~ret4| 2147483645)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12896#(<= |fibonacci_#t~ret4| 2147483645)} is VALID [2022-02-21 03:07:03,379 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13044#(<= |fibonacci_#res| 2147483645)} {12145#true} #47#return; {12896#(<= |fibonacci_#t~ret4| 2147483645)} is VALID [2022-02-21 03:07:03,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {13044#(<= |fibonacci_#res| 2147483645)} assume true; {13044#(<= |fibonacci_#res| 2147483645)} is VALID [2022-02-21 03:07:03,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {13051#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483645)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13044#(<= |fibonacci_#res| 2147483645)} is VALID [2022-02-21 03:07:03,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {13051#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483645)} assume #t~ret4 + #t~ret5 <= 2147483647; {13051#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483645)} is VALID [2022-02-21 03:07:03,382 INFO L290 TraceCheckUtils]: 94: Hoare triple {13051#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483645)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13051#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483645)} is VALID [2022-02-21 03:07:03,383 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {13061#(<= |fibonacci_#t~ret4| 2147483644)} #49#return; {13051#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483645)} is VALID [2022-02-21 03:07:03,383 INFO L290 TraceCheckUtils]: 92: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,383 INFO L290 TraceCheckUtils]: 91: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,383 INFO L290 TraceCheckUtils]: 90: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:03,384 INFO L290 TraceCheckUtils]: 89: Hoare triple {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:03,384 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {12371#(<= |fibonacci_#t~ret4| 1)} #49#return; {12388#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:03,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:03,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:03,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,385 INFO L272 TraceCheckUtils]: 84: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {12371#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,386 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {12145#true} #47#return; {12371#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L272 TraceCheckUtils]: 75: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L290 TraceCheckUtils]: 70: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,387 INFO L272 TraceCheckUtils]: 69: Hoare triple {13061#(<= |fibonacci_#t~ret4| 2147483644)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {13061#(<= |fibonacci_#t~ret4| 2147483644)} assume ~n - 2 >= -2147483648; {13061#(<= |fibonacci_#t~ret4| 2147483644)} is VALID [2022-02-21 03:07:03,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {13061#(<= |fibonacci_#t~ret4| 2147483644)} assume ~n - 2 <= 2147483647; {13061#(<= |fibonacci_#t~ret4| 2147483644)} is VALID [2022-02-21 03:07:03,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {13061#(<= |fibonacci_#t~ret4| 2147483644)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13061#(<= |fibonacci_#t~ret4| 2147483644)} is VALID [2022-02-21 03:07:03,389 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {13149#(<= |fibonacci_#res| 2147483644)} {12145#true} #47#return; {13061#(<= |fibonacci_#t~ret4| 2147483644)} is VALID [2022-02-21 03:07:03,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {13149#(<= |fibonacci_#res| 2147483644)} assume true; {13149#(<= |fibonacci_#res| 2147483644)} is VALID [2022-02-21 03:07:03,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {13156#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483644)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13149#(<= |fibonacci_#res| 2147483644)} is VALID [2022-02-21 03:07:03,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {13156#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483644)} assume #t~ret4 + #t~ret5 <= 2147483647; {13156#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483644)} is VALID [2022-02-21 03:07:03,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {13156#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483644)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13156#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483644)} is VALID [2022-02-21 03:07:03,390 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12389#(<= |fibonacci_#res| 1)} {13166#(<= |fibonacci_#t~ret4| 2147483643)} #49#return; {13156#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483644)} is VALID [2022-02-21 03:07:03,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {12389#(<= |fibonacci_#res| 1)} assume true; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {12389#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:03,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,391 INFO L272 TraceCheckUtils]: 55: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} assume ~n - 2 >= -2147483648; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} assume ~n - 2 <= 2147483647; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,392 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13197#(<= |fibonacci_#res| 2147483643)} {12145#true} #47#return; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {13197#(<= |fibonacci_#res| 2147483643)} assume true; {13197#(<= |fibonacci_#res| 2147483643)} is VALID [2022-02-21 03:07:03,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {13204#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483643)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13197#(<= |fibonacci_#res| 2147483643)} is VALID [2022-02-21 03:07:03,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {13204#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483643)} assume #t~ret4 + #t~ret5 <= 2147483647; {13204#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483643)} is VALID [2022-02-21 03:07:03,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {13204#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483643)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13204#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483643)} is VALID [2022-02-21 03:07:03,395 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12390#(<= |fibonacci_#res| 0)} {13166#(<= |fibonacci_#t~ret4| 2147483643)} #49#return; {13204#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483643)} is VALID [2022-02-21 03:07:03,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {12390#(<= |fibonacci_#res| 0)} assume true; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:03,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {12145#true} assume ~n < 1;#res := 0; {12390#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:03,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,395 INFO L272 TraceCheckUtils]: 42: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} call #t~ret5 := fibonacci(~n - 2); {12145#true} is VALID [2022-02-21 03:07:03,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} assume ~n - 2 >= -2147483648; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} assume ~n - 2 <= 2147483647; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {13166#(<= |fibonacci_#t~ret4| 2147483643)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,396 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13197#(<= |fibonacci_#res| 2147483643)} {12145#true} #47#return; {13166#(<= |fibonacci_#t~ret4| 2147483643)} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {13197#(<= |fibonacci_#res| 2147483643)} assume true; {13197#(<= |fibonacci_#res| 2147483643)} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {12145#true} assume 1 == ~n;#res := 1; {13197#(<= |fibonacci_#res| 2147483643)} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L272 TraceCheckUtils]: 33: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L272 TraceCheckUtils]: 27: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L272 TraceCheckUtils]: 21: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,398 INFO L272 TraceCheckUtils]: 15: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L272 TraceCheckUtils]: 9: Hoare triple {12145#true} call #t~ret4 := fibonacci(~n - 1); {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {12145#true} assume ~n - 1 >= -2147483648; {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {12145#true} assume ~n - 1 <= 2147483647; {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {12145#true} assume !(1 == ~n); {12145#true} is VALID [2022-02-21 03:07:03,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {12145#true} assume !(~n < 1); {12145#true} is VALID [2022-02-21 03:07:03,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {12145#true} ~n := #in~n; {12145#true} is VALID [2022-02-21 03:07:03,400 INFO L272 TraceCheckUtils]: 3: Hoare triple {12145#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {12145#true} is VALID [2022-02-21 03:07:03,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {12145#true} assume !(main_~x~0#1 < 1); {12145#true} is VALID [2022-02-21 03:07:03,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {12145#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {12145#true} is VALID [2022-02-21 03:07:03,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {12145#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); {12145#true} is VALID [2022-02-21 03:07:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-02-21 03:07:03,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434234429] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:07:03,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:07:03,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2022-02-21 03:07:03,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486371117] [2022-02-21 03:07:03,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:07:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 149 [2022-02-21 03:07:03,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:03,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-02-21 03:07:03,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:03,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-21 03:07:03,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-21 03:07:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-02-21 03:07:03,456 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-02-21 03:07:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:03,792 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2022-02-21 03:07:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 03:07:03,792 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 149 [2022-02-21 03:07:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-02-21 03:07:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-02-21 03:07:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-02-21 03:07:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-02-21 03:07:03,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 103 transitions. [2022-02-21 03:07:03,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:03,868 INFO L225 Difference]: With dead ends: 114 [2022-02-21 03:07:03,868 INFO L226 Difference]: Without dead ends: 113 [2022-02-21 03:07:03,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2022-02-21 03:07:03,868 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:03,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 145 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:07:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-21 03:07:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-02-21 03:07:03,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:03,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-21 03:07:03,944 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-21 03:07:03,944 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-21 03:07:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:03,947 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-02-21 03:07:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-02-21 03:07:03,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:03,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:03,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) Second operand 113 states. [2022-02-21 03:07:03,948 INFO L87 Difference]: Start difference. First operand has 103 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) Second operand 113 states. [2022-02-21 03:07:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:03,951 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-02-21 03:07:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-02-21 03:07:03,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:03,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:03,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:03,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) [2022-02-21 03:07:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2022-02-21 03:07:03,954 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 149 [2022-02-21 03:07:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:03,954 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2022-02-21 03:07:03,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-02-21 03:07:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2022-02-21 03:07:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-02-21 03:07:03,956 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:03,956 INFO L514 BasicCegarLoop]: trace histogram [31, 30, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 10, 6, 1, 1, 1, 1, 1] [2022-02-21 03:07:03,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:07:04,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-21 03:07:04,175 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:07:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -99623585, now seen corresponding path program 8 times [2022-02-21 03:07:04,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:04,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553995271] [2022-02-21 03:07:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:07:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,403 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13831#true} {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,409 INFO L272 TraceCheckUtils]: 5: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,412 INFO L272 TraceCheckUtils]: 14: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,413 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13831#true} {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,415 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,419 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,420 INFO L272 TraceCheckUtils]: 5: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,424 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,425 INFO L272 TraceCheckUtils]: 20: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,426 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13831#true} {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,427 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,429 INFO L272 TraceCheckUtils]: 33: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,430 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13831#true} {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume true; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,431 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14348#(<= |fibonacci_#in~n| 3)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:07:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,440 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,443 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,444 INFO L272 TraceCheckUtils]: 14: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,446 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13831#true} {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,448 INFO L272 TraceCheckUtils]: 5: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,449 INFO L272 TraceCheckUtils]: 11: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,451 INFO L272 TraceCheckUtils]: 17: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,453 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,454 INFO L272 TraceCheckUtils]: 26: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,455 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13831#true} {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,457 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,458 INFO L272 TraceCheckUtils]: 39: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,459 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13831#true} {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume true; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,460 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14348#(<= |fibonacci_#in~n| 3)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,462 INFO L272 TraceCheckUtils]: 53: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L272 TraceCheckUtils]: 59: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 67: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L272 TraceCheckUtils]: 68: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L290 TraceCheckUtils]: 74: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L290 TraceCheckUtils]: 75: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,464 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,465 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13831#true} {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,465 INFO L290 TraceCheckUtils]: 78: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,466 INFO L290 TraceCheckUtils]: 81: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume true; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,467 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14317#(<= |fibonacci_#in~n| 4)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-02-21 03:07:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,487 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L272 TraceCheckUtils]: 14: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,492 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L272 TraceCheckUtils]: 11: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L272 TraceCheckUtils]: 20: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L272 TraceCheckUtils]: 33: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,503 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13831#true} {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,504 INFO L272 TraceCheckUtils]: 5: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,506 INFO L272 TraceCheckUtils]: 11: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,507 INFO L272 TraceCheckUtils]: 17: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,509 INFO L272 TraceCheckUtils]: 23: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,511 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,512 INFO L272 TraceCheckUtils]: 32: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,513 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13831#true} {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,515 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,516 INFO L272 TraceCheckUtils]: 45: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,517 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13831#true} {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume true; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,518 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14348#(<= |fibonacci_#in~n| 3)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,520 INFO L272 TraceCheckUtils]: 59: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L272 TraceCheckUtils]: 65: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 73: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L272 TraceCheckUtils]: 74: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,521 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,522 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,522 INFO L290 TraceCheckUtils]: 81: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,523 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13831#true} {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,523 INFO L290 TraceCheckUtils]: 84: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,524 INFO L290 TraceCheckUtils]: 86: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,524 INFO L290 TraceCheckUtils]: 87: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume true; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,525 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14317#(<= |fibonacci_#in~n| 4)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,525 INFO L290 TraceCheckUtils]: 91: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,526 INFO L272 TraceCheckUtils]: 92: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L290 TraceCheckUtils]: 95: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L290 TraceCheckUtils]: 97: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L272 TraceCheckUtils]: 98: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,526 INFO L290 TraceCheckUtils]: 99: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 100: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 103: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L272 TraceCheckUtils]: 104: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 105: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L290 TraceCheckUtils]: 110: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L290 TraceCheckUtils]: 111: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L290 TraceCheckUtils]: 112: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L272 TraceCheckUtils]: 113: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L290 TraceCheckUtils]: 114: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L290 TraceCheckUtils]: 115: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L290 TraceCheckUtils]: 116: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,528 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 118: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 119: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 120: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,529 INFO L272 TraceCheckUtils]: 126: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 127: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 128: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 129: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 130: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 134: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,530 INFO L290 TraceCheckUtils]: 135: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,531 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13831#true} {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,532 INFO L290 TraceCheckUtils]: 137: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,532 INFO L290 TraceCheckUtils]: 138: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,532 INFO L290 TraceCheckUtils]: 139: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,532 INFO L290 TraceCheckUtils]: 140: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume true; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,533 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {14247#(<= |fibonacci_#in~n| 5)} {13831#true} #47#return; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-02-21 03:07:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,712 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L272 TraceCheckUtils]: 14: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,717 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,719 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L272 TraceCheckUtils]: 11: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,721 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L272 TraceCheckUtils]: 20: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,722 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,723 INFO L272 TraceCheckUtils]: 33: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,725 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13831#true} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:07:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,775 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,781 INFO L272 TraceCheckUtils]: 5: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,782 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,783 INFO L272 TraceCheckUtils]: 14: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,784 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume true; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,785 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14655#(<= 2 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,787 INFO L272 TraceCheckUtils]: 5: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L272 TraceCheckUtils]: 11: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,788 INFO L272 TraceCheckUtils]: 17: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,789 INFO L272 TraceCheckUtils]: 26: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L272 TraceCheckUtils]: 39: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,792 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,793 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13831#true} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,794 INFO L272 TraceCheckUtils]: 53: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,795 INFO L272 TraceCheckUtils]: 59: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,796 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,797 INFO L272 TraceCheckUtils]: 68: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,797 INFO L290 TraceCheckUtils]: 69: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,798 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,799 INFO L290 TraceCheckUtils]: 75: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume true; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,800 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {14655#(<= 2 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,800 INFO L290 TraceCheckUtils]: 78: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,801 INFO L290 TraceCheckUtils]: 80: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,801 INFO L290 TraceCheckUtils]: 81: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume true; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,802 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14605#(<= 4 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-02-21 03:07:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,819 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,822 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L272 TraceCheckUtils]: 14: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,825 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:04,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L272 TraceCheckUtils]: 5: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L272 TraceCheckUtils]: 11: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L272 TraceCheckUtils]: 20: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,830 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L272 TraceCheckUtils]: 33: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,831 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,833 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13831#true} {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,834 INFO L272 TraceCheckUtils]: 5: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,836 INFO L272 TraceCheckUtils]: 11: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L272 TraceCheckUtils]: 17: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L272 TraceCheckUtils]: 23: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L272 TraceCheckUtils]: 32: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,838 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L272 TraceCheckUtils]: 45: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,841 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13831#true} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,842 INFO L272 TraceCheckUtils]: 59: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,843 INFO L290 TraceCheckUtils]: 62: Hoare triple {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,843 INFO L290 TraceCheckUtils]: 63: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,844 INFO L272 TraceCheckUtils]: 65: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,844 INFO L290 TraceCheckUtils]: 67: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,845 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,846 INFO L290 TraceCheckUtils]: 73: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,846 INFO L272 TraceCheckUtils]: 74: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,847 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume true; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,848 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {14655#(<= 2 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,849 INFO L290 TraceCheckUtils]: 84: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,849 INFO L290 TraceCheckUtils]: 85: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,849 INFO L290 TraceCheckUtils]: 86: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,849 INFO L290 TraceCheckUtils]: 87: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume true; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,850 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {14605#(<= 4 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,850 INFO L290 TraceCheckUtils]: 89: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,851 INFO L290 TraceCheckUtils]: 90: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,851 INFO L290 TraceCheckUtils]: 91: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,851 INFO L272 TraceCheckUtils]: 92: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,851 INFO L290 TraceCheckUtils]: 93: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,851 INFO L290 TraceCheckUtils]: 94: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,851 INFO L290 TraceCheckUtils]: 95: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 96: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 97: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L272 TraceCheckUtils]: 98: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 99: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 100: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 101: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 102: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,852 INFO L272 TraceCheckUtils]: 104: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 105: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 106: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 107: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 108: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 110: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 111: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L290 TraceCheckUtils]: 112: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,853 INFO L272 TraceCheckUtils]: 113: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 114: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 115: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 116: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 118: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 119: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 120: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L290 TraceCheckUtils]: 121: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,854 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 123: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 124: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 125: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L272 TraceCheckUtils]: 126: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 127: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 128: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 129: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,855 INFO L290 TraceCheckUtils]: 130: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,856 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,856 INFO L290 TraceCheckUtils]: 132: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,856 INFO L290 TraceCheckUtils]: 133: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,856 INFO L290 TraceCheckUtils]: 134: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,856 INFO L290 TraceCheckUtils]: 135: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,857 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13831#true} {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,857 INFO L290 TraceCheckUtils]: 137: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,857 INFO L290 TraceCheckUtils]: 138: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,857 INFO L290 TraceCheckUtils]: 139: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,858 INFO L290 TraceCheckUtils]: 140: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume true; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,858 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {14536#(<= 5 |fibonacci_#in~n|)} {13975#(<= fibonacci_~n 6)} #49#return; {13832#false} is VALID [2022-02-21 03:07:04,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#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); {13831#true} is VALID [2022-02-21 03:07:04,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(main_~x~0#1 < 1); {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L272 TraceCheckUtils]: 3: Hoare triple {13831#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,859 INFO L272 TraceCheckUtils]: 9: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,861 INFO L272 TraceCheckUtils]: 15: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,862 INFO L272 TraceCheckUtils]: 21: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,864 INFO L272 TraceCheckUtils]: 27: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,865 INFO L272 TraceCheckUtils]: 33: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:04,867 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,868 INFO L272 TraceCheckUtils]: 42: Hoare triple {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,869 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13831#true} {14354#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:04,871 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,872 INFO L272 TraceCheckUtils]: 55: Hoare triple {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,873 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13831#true} {14342#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume true; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:04,874 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14348#(<= |fibonacci_#in~n| 3)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,875 INFO L272 TraceCheckUtils]: 69: Hoare triple {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L272 TraceCheckUtils]: 75: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 78: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L290 TraceCheckUtils]: 79: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,876 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 82: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 83: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L272 TraceCheckUtils]: 84: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 85: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 86: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 87: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,877 INFO L290 TraceCheckUtils]: 89: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,878 INFO L290 TraceCheckUtils]: 90: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,878 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {13831#true} {14292#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,879 INFO L290 TraceCheckUtils]: 94: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,879 INFO L290 TraceCheckUtils]: 95: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,879 INFO L290 TraceCheckUtils]: 96: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,879 INFO L290 TraceCheckUtils]: 97: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume true; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:04,880 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {14317#(<= |fibonacci_#in~n| 4)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,880 INFO L290 TraceCheckUtils]: 99: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,881 INFO L290 TraceCheckUtils]: 100: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,881 INFO L290 TraceCheckUtils]: 101: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,881 INFO L272 TraceCheckUtils]: 102: Hoare triple {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,881 INFO L290 TraceCheckUtils]: 103: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,881 INFO L290 TraceCheckUtils]: 104: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,881 INFO L290 TraceCheckUtils]: 105: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,881 INFO L290 TraceCheckUtils]: 106: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 107: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L272 TraceCheckUtils]: 108: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 109: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 110: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 111: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 112: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 113: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L272 TraceCheckUtils]: 114: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 115: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,882 INFO L290 TraceCheckUtils]: 116: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 118: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 120: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 121: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 122: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L272 TraceCheckUtils]: 123: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 124: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,883 INFO L290 TraceCheckUtils]: 125: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 126: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 128: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 129: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 130: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 131: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 133: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,884 INFO L290 TraceCheckUtils]: 134: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 135: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L272 TraceCheckUtils]: 136: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 137: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 138: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 139: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 140: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 142: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,885 INFO L290 TraceCheckUtils]: 143: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,886 INFO L290 TraceCheckUtils]: 144: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,886 INFO L290 TraceCheckUtils]: 145: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,886 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {13831#true} {14202#(and (<= fibonacci_~n 5) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,886 INFO L290 TraceCheckUtils]: 147: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,887 INFO L290 TraceCheckUtils]: 148: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,887 INFO L290 TraceCheckUtils]: 149: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,887 INFO L290 TraceCheckUtils]: 150: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume true; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:04,888 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {14247#(<= |fibonacci_#in~n| 5)} {13831#true} #47#return; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:04,888 INFO L290 TraceCheckUtils]: 152: Hoare triple {13975#(<= fibonacci_~n 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:04,888 INFO L290 TraceCheckUtils]: 153: Hoare triple {13975#(<= fibonacci_~n 6)} assume ~n - 2 <= 2147483647; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:04,889 INFO L290 TraceCheckUtils]: 154: Hoare triple {13975#(<= fibonacci_~n 6)} assume ~n - 2 >= -2147483648; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:04,889 INFO L272 TraceCheckUtils]: 155: Hoare triple {13975#(<= fibonacci_~n 6)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,889 INFO L290 TraceCheckUtils]: 156: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,889 INFO L290 TraceCheckUtils]: 157: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,889 INFO L290 TraceCheckUtils]: 158: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,890 INFO L290 TraceCheckUtils]: 159: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,890 INFO L290 TraceCheckUtils]: 160: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,890 INFO L272 TraceCheckUtils]: 161: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,890 INFO L290 TraceCheckUtils]: 162: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,891 INFO L290 TraceCheckUtils]: 163: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,891 INFO L290 TraceCheckUtils]: 164: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,891 INFO L290 TraceCheckUtils]: 165: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 166: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,892 INFO L272 TraceCheckUtils]: 167: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 168: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 169: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 170: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 171: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 172: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L272 TraceCheckUtils]: 173: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 174: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,892 INFO L290 TraceCheckUtils]: 175: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 176: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 177: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 178: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L272 TraceCheckUtils]: 179: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 180: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 181: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 182: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L290 TraceCheckUtils]: 183: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,893 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 185: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 186: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 187: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L272 TraceCheckUtils]: 188: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 189: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 190: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 191: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,894 INFO L290 TraceCheckUtils]: 193: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 194: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 195: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 196: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L284 TraceCheckUtils]: 197: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 198: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 199: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 200: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L272 TraceCheckUtils]: 201: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,895 INFO L290 TraceCheckUtils]: 202: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 203: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 204: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 205: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 207: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 208: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 209: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,896 INFO L290 TraceCheckUtils]: 210: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,897 INFO L284 TraceCheckUtils]: 211: Hoare quadruple {13831#true} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,897 INFO L290 TraceCheckUtils]: 212: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,897 INFO L290 TraceCheckUtils]: 213: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,898 INFO L290 TraceCheckUtils]: 214: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,898 INFO L272 TraceCheckUtils]: 215: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,898 INFO L290 TraceCheckUtils]: 216: Hoare triple {13831#true} ~n := #in~n; {14118#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,898 INFO L290 TraceCheckUtils]: 217: Hoare triple {14118#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,899 INFO L290 TraceCheckUtils]: 218: Hoare triple {14644#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,899 INFO L290 TraceCheckUtils]: 219: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,899 INFO L290 TraceCheckUtils]: 220: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,899 INFO L272 TraceCheckUtils]: 221: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,900 INFO L290 TraceCheckUtils]: 222: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,900 INFO L290 TraceCheckUtils]: 223: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,900 INFO L290 TraceCheckUtils]: 224: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,900 INFO L290 TraceCheckUtils]: 225: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,900 INFO L284 TraceCheckUtils]: 226: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,901 INFO L290 TraceCheckUtils]: 227: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,901 INFO L290 TraceCheckUtils]: 228: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,901 INFO L290 TraceCheckUtils]: 229: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,901 INFO L272 TraceCheckUtils]: 230: Hoare triple {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,902 INFO L290 TraceCheckUtils]: 231: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,902 INFO L290 TraceCheckUtils]: 232: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,902 INFO L290 TraceCheckUtils]: 233: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,902 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {13831#true} {14645#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,903 INFO L290 TraceCheckUtils]: 235: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,903 INFO L290 TraceCheckUtils]: 236: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,903 INFO L290 TraceCheckUtils]: 237: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,903 INFO L290 TraceCheckUtils]: 238: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume true; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,904 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {14655#(<= 2 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #49#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,904 INFO L290 TraceCheckUtils]: 240: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,905 INFO L290 TraceCheckUtils]: 241: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,905 INFO L290 TraceCheckUtils]: 242: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,905 INFO L290 TraceCheckUtils]: 243: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume true; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,906 INFO L284 TraceCheckUtils]: 244: Hoare quadruple {14605#(<= 4 |fibonacci_#in~n|)} {14118#(= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,906 INFO L290 TraceCheckUtils]: 245: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,906 INFO L290 TraceCheckUtils]: 246: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,907 INFO L290 TraceCheckUtils]: 247: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:04,907 INFO L272 TraceCheckUtils]: 248: Hoare triple {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,907 INFO L290 TraceCheckUtils]: 249: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,907 INFO L290 TraceCheckUtils]: 250: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,907 INFO L290 TraceCheckUtils]: 251: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,907 INFO L290 TraceCheckUtils]: 252: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,907 INFO L290 TraceCheckUtils]: 253: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,907 INFO L272 TraceCheckUtils]: 254: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 255: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 256: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 257: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 258: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 259: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L272 TraceCheckUtils]: 260: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 261: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 262: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,908 INFO L290 TraceCheckUtils]: 263: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 264: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L284 TraceCheckUtils]: 265: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 266: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 267: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 268: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L272 TraceCheckUtils]: 269: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 270: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 271: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:04,909 INFO L290 TraceCheckUtils]: 272: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L284 TraceCheckUtils]: 273: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 274: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 275: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 276: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 277: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L284 TraceCheckUtils]: 278: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 279: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 280: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,910 INFO L290 TraceCheckUtils]: 281: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L272 TraceCheckUtils]: 282: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 283: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 284: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 285: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 286: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 288: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 289: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:04,911 INFO L290 TraceCheckUtils]: 290: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:04,912 INFO L290 TraceCheckUtils]: 291: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:04,912 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {13831#true} {14491#(and (<= 5 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #49#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,913 INFO L290 TraceCheckUtils]: 293: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,913 INFO L290 TraceCheckUtils]: 294: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,913 INFO L290 TraceCheckUtils]: 295: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,913 INFO L290 TraceCheckUtils]: 296: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume true; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:04,914 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {14536#(<= 5 |fibonacci_#in~n|)} {13975#(<= fibonacci_~n 6)} #49#return; {13832#false} is VALID [2022-02-21 03:07:04,914 INFO L290 TraceCheckUtils]: 298: Hoare triple {13832#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13832#false} is VALID [2022-02-21 03:07:04,914 INFO L290 TraceCheckUtils]: 299: Hoare triple {13832#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {13832#false} is VALID [2022-02-21 03:07:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 497 proven. 998 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2022-02-21 03:07:04,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:04,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553995271] [2022-02-21 03:07:04,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553995271] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:07:04,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505998088] [2022-02-21 03:07:04,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:07:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:04,917 INFO L229 MonitoredProcess]: Starting monitored process 13 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:07:04,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:07:05,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:07:05,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:07:05,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:07:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:05,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#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); {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(main_~x~0#1 < 1); {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L272 TraceCheckUtils]: 3: Hoare triple {13831#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,914 INFO L272 TraceCheckUtils]: 9: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} ~n := #in~n; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,915 INFO L272 TraceCheckUtils]: 15: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} ~n := #in~n; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,916 INFO L272 TraceCheckUtils]: 21: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} ~n := #in~n; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,918 INFO L272 TraceCheckUtils]: 27: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} ~n := #in~n; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,919 INFO L272 TraceCheckUtils]: 33: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {14727#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:05,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {14727#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:05,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:05,921 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {14727#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,922 INFO L272 TraceCheckUtils]: 42: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:05,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,922 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13831#true} {14359#(<= |fibonacci_#in~n| 2)} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:05,924 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {14727#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume ~n - 2 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume ~n - 2 >= -2147483648; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,925 INFO L272 TraceCheckUtils]: 55: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,925 INFO L290 TraceCheckUtils]: 58: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,925 INFO L290 TraceCheckUtils]: 59: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,925 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13831#true} {14348#(<= |fibonacci_#in~n| 3)} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume true; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:05,942 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14348#(<= |fibonacci_#in~n| 3)} {14727#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume ~n - 2 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume ~n - 2 >= -2147483648; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,943 INFO L272 TraceCheckUtils]: 69: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 73: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L272 TraceCheckUtils]: 75: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 77: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 78: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 79: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 83: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L272 TraceCheckUtils]: 84: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 85: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 86: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 87: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 90: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 91: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:05,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,948 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {13831#true} {14317#(<= |fibonacci_#in~n| 4)} #49#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,948 INFO L290 TraceCheckUtils]: 94: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,948 INFO L290 TraceCheckUtils]: 95: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume true; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:05,950 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {14317#(<= |fibonacci_#in~n| 4)} {14727#(<= |fibonacci_#in~n| fibonacci_~n)} #47#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,950 INFO L290 TraceCheckUtils]: 99: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,950 INFO L290 TraceCheckUtils]: 100: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume ~n - 2 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,950 INFO L290 TraceCheckUtils]: 101: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume ~n - 2 >= -2147483648; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,950 INFO L272 TraceCheckUtils]: 102: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,950 INFO L290 TraceCheckUtils]: 103: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 104: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 105: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 106: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 107: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L272 TraceCheckUtils]: 108: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 109: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 110: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 111: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 112: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 113: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L272 TraceCheckUtils]: 114: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 115: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,951 INFO L290 TraceCheckUtils]: 116: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 117: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 118: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 120: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 121: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 122: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L272 TraceCheckUtils]: 123: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 124: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,952 INFO L290 TraceCheckUtils]: 125: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 126: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 128: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 129: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 130: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 131: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 133: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,953 INFO L290 TraceCheckUtils]: 134: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 135: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L272 TraceCheckUtils]: 136: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 137: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 138: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 139: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 140: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 142: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,954 INFO L290 TraceCheckUtils]: 143: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,955 INFO L290 TraceCheckUtils]: 144: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:05,955 INFO L290 TraceCheckUtils]: 145: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,955 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {13831#true} {14247#(<= |fibonacci_#in~n| 5)} #49#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,956 INFO L290 TraceCheckUtils]: 147: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,956 INFO L290 TraceCheckUtils]: 148: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,956 INFO L290 TraceCheckUtils]: 149: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,956 INFO L290 TraceCheckUtils]: 150: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume true; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:05,957 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {14247#(<= |fibonacci_#in~n| 5)} {13831#true} #47#return; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:05,957 INFO L290 TraceCheckUtils]: 152: Hoare triple {13975#(<= fibonacci_~n 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:05,958 INFO L290 TraceCheckUtils]: 153: Hoare triple {13975#(<= fibonacci_~n 6)} assume ~n - 2 <= 2147483647; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:05,958 INFO L290 TraceCheckUtils]: 154: Hoare triple {13975#(<= fibonacci_~n 6)} assume ~n - 2 >= -2147483648; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:05,958 INFO L272 TraceCheckUtils]: 155: Hoare triple {13975#(<= fibonacci_~n 6)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,958 INFO L290 TraceCheckUtils]: 156: Hoare triple {13831#true} ~n := #in~n; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,959 INFO L290 TraceCheckUtils]: 157: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,959 INFO L290 TraceCheckUtils]: 158: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,959 INFO L290 TraceCheckUtils]: 159: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,960 INFO L290 TraceCheckUtils]: 160: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,960 INFO L272 TraceCheckUtils]: 161: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,960 INFO L290 TraceCheckUtils]: 162: Hoare triple {13831#true} ~n := #in~n; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,960 INFO L290 TraceCheckUtils]: 163: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,961 INFO L290 TraceCheckUtils]: 164: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,961 INFO L290 TraceCheckUtils]: 165: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,961 INFO L290 TraceCheckUtils]: 166: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,961 INFO L272 TraceCheckUtils]: 167: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,962 INFO L290 TraceCheckUtils]: 168: Hoare triple {13831#true} ~n := #in~n; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,962 INFO L290 TraceCheckUtils]: 169: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,962 INFO L290 TraceCheckUtils]: 170: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,962 INFO L290 TraceCheckUtils]: 171: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,963 INFO L290 TraceCheckUtils]: 172: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,963 INFO L272 TraceCheckUtils]: 173: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,963 INFO L290 TraceCheckUtils]: 174: Hoare triple {13831#true} ~n := #in~n; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,963 INFO L290 TraceCheckUtils]: 175: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,964 INFO L290 TraceCheckUtils]: 176: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,964 INFO L290 TraceCheckUtils]: 177: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,964 INFO L290 TraceCheckUtils]: 178: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,964 INFO L272 TraceCheckUtils]: 179: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,965 INFO L290 TraceCheckUtils]: 180: Hoare triple {13831#true} ~n := #in~n; {15166#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,965 INFO L290 TraceCheckUtils]: 181: Hoare triple {15166#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {15242#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,966 INFO L290 TraceCheckUtils]: 182: Hoare triple {15242#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {15242#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,966 INFO L290 TraceCheckUtils]: 183: Hoare triple {15242#(<= 1 |fibonacci_#in~n|)} assume true; {15242#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,967 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {15242#(<= 1 |fibonacci_#in~n|)} {15166#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,967 INFO L290 TraceCheckUtils]: 185: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,967 INFO L290 TraceCheckUtils]: 186: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,967 INFO L290 TraceCheckUtils]: 187: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,968 INFO L272 TraceCheckUtils]: 188: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,968 INFO L290 TraceCheckUtils]: 189: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,968 INFO L290 TraceCheckUtils]: 190: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:05,968 INFO L290 TraceCheckUtils]: 191: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,968 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {13831#true} {14655#(<= 2 |fibonacci_#in~n|)} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,969 INFO L290 TraceCheckUtils]: 193: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,969 INFO L290 TraceCheckUtils]: 194: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,969 INFO L290 TraceCheckUtils]: 195: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,970 INFO L290 TraceCheckUtils]: 196: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume true; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,970 INFO L284 TraceCheckUtils]: 197: Hoare quadruple {14655#(<= 2 |fibonacci_#in~n|)} {15166#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,970 INFO L290 TraceCheckUtils]: 198: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,971 INFO L290 TraceCheckUtils]: 199: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,971 INFO L290 TraceCheckUtils]: 200: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,971 INFO L272 TraceCheckUtils]: 201: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,971 INFO L290 TraceCheckUtils]: 202: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,971 INFO L290 TraceCheckUtils]: 203: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,972 INFO L290 TraceCheckUtils]: 204: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,972 INFO L290 TraceCheckUtils]: 205: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,972 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {13831#true} {15291#(<= 3 |fibonacci_#in~n|)} #49#return; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,972 INFO L290 TraceCheckUtils]: 207: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,973 INFO L290 TraceCheckUtils]: 208: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,973 INFO L290 TraceCheckUtils]: 209: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,973 INFO L290 TraceCheckUtils]: 210: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume true; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,974 INFO L284 TraceCheckUtils]: 211: Hoare quadruple {15291#(<= 3 |fibonacci_#in~n|)} {15166#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,974 INFO L290 TraceCheckUtils]: 212: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 213: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 214: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,975 INFO L272 TraceCheckUtils]: 215: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 216: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 217: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 218: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 219: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,975 INFO L290 TraceCheckUtils]: 220: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L272 TraceCheckUtils]: 221: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 222: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 223: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 224: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 225: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L284 TraceCheckUtils]: 226: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 227: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 228: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,976 INFO L290 TraceCheckUtils]: 229: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L272 TraceCheckUtils]: 230: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 231: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 232: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 233: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 235: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 236: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 237: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:05,977 INFO L290 TraceCheckUtils]: 238: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,978 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {13831#true} {14605#(<= 4 |fibonacci_#in~n|)} #49#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,978 INFO L290 TraceCheckUtils]: 240: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,978 INFO L290 TraceCheckUtils]: 241: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,979 INFO L290 TraceCheckUtils]: 242: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,979 INFO L290 TraceCheckUtils]: 243: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume true; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,980 INFO L284 TraceCheckUtils]: 244: Hoare quadruple {14605#(<= 4 |fibonacci_#in~n|)} {15166#(<= fibonacci_~n |fibonacci_#in~n|)} #47#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,980 INFO L290 TraceCheckUtils]: 245: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,980 INFO L290 TraceCheckUtils]: 246: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,980 INFO L290 TraceCheckUtils]: 247: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,981 INFO L272 TraceCheckUtils]: 248: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 249: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 250: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 251: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 252: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 253: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L272 TraceCheckUtils]: 254: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 255: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 256: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,981 INFO L290 TraceCheckUtils]: 257: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 258: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 259: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L272 TraceCheckUtils]: 260: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 261: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 262: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 263: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 264: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L284 TraceCheckUtils]: 265: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:05,982 INFO L290 TraceCheckUtils]: 266: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 267: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 268: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L272 TraceCheckUtils]: 269: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 270: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 271: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 272: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L284 TraceCheckUtils]: 273: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 274: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,983 INFO L290 TraceCheckUtils]: 275: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 276: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 277: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L284 TraceCheckUtils]: 278: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 279: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 280: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 281: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L272 TraceCheckUtils]: 282: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 283: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:05,984 INFO L290 TraceCheckUtils]: 284: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L290 TraceCheckUtils]: 285: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L290 TraceCheckUtils]: 286: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L290 TraceCheckUtils]: 288: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L290 TraceCheckUtils]: 289: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L290 TraceCheckUtils]: 290: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:05,985 INFO L290 TraceCheckUtils]: 291: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:05,986 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {13831#true} {14536#(<= 5 |fibonacci_#in~n|)} #49#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,986 INFO L290 TraceCheckUtils]: 293: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,986 INFO L290 TraceCheckUtils]: 294: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,986 INFO L290 TraceCheckUtils]: 295: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,987 INFO L290 TraceCheckUtils]: 296: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume true; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:05,987 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {14536#(<= 5 |fibonacci_#in~n|)} {13975#(<= fibonacci_~n 6)} #49#return; {13832#false} is VALID [2022-02-21 03:07:05,987 INFO L290 TraceCheckUtils]: 298: Hoare triple {13832#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13832#false} is VALID [2022-02-21 03:07:05,988 INFO L290 TraceCheckUtils]: 299: Hoare triple {13832#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {13832#false} is VALID [2022-02-21 03:07:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 555 proven. 1181 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2022-02-21 03:07:05,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:07:10,854 INFO L290 TraceCheckUtils]: 299: Hoare triple {13832#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {13832#false} is VALID [2022-02-21 03:07:10,855 INFO L290 TraceCheckUtils]: 298: Hoare triple {13832#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13832#false} is VALID [2022-02-21 03:07:10,855 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {14536#(<= 5 |fibonacci_#in~n|)} {13975#(<= fibonacci_~n 6)} #49#return; {13832#false} is VALID [2022-02-21 03:07:10,855 INFO L290 TraceCheckUtils]: 296: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume true; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,856 INFO L290 TraceCheckUtils]: 295: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,856 INFO L290 TraceCheckUtils]: 294: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,874 INFO L290 TraceCheckUtils]: 293: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,874 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {13831#true} {14536#(<= 5 |fibonacci_#in~n|)} #49#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 291: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 290: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 289: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 288: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 286: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 285: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 284: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,875 INFO L290 TraceCheckUtils]: 283: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L272 TraceCheckUtils]: 282: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 281: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 280: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 279: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L284 TraceCheckUtils]: 278: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 277: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 276: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 275: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,876 INFO L290 TraceCheckUtils]: 274: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L284 TraceCheckUtils]: 273: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L290 TraceCheckUtils]: 272: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L290 TraceCheckUtils]: 271: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L290 TraceCheckUtils]: 270: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L272 TraceCheckUtils]: 269: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L290 TraceCheckUtils]: 268: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L290 TraceCheckUtils]: 267: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L290 TraceCheckUtils]: 266: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,877 INFO L284 TraceCheckUtils]: 265: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 264: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 263: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 262: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 261: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L272 TraceCheckUtils]: 260: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 259: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 258: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 257: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,878 INFO L290 TraceCheckUtils]: 256: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L290 TraceCheckUtils]: 255: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L272 TraceCheckUtils]: 254: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L290 TraceCheckUtils]: 253: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L290 TraceCheckUtils]: 252: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L290 TraceCheckUtils]: 251: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L290 TraceCheckUtils]: 250: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L290 TraceCheckUtils]: 249: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,879 INFO L272 TraceCheckUtils]: 248: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,880 INFO L290 TraceCheckUtils]: 247: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,880 INFO L290 TraceCheckUtils]: 246: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,880 INFO L290 TraceCheckUtils]: 245: Hoare triple {14536#(<= 5 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,881 INFO L284 TraceCheckUtils]: 244: Hoare quadruple {14605#(<= 4 |fibonacci_#in~n|)} {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} #47#return; {14536#(<= 5 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,881 INFO L290 TraceCheckUtils]: 243: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume true; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,882 INFO L290 TraceCheckUtils]: 242: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,882 INFO L290 TraceCheckUtils]: 241: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,882 INFO L290 TraceCheckUtils]: 240: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,883 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {13831#true} {14605#(<= 4 |fibonacci_#in~n|)} #49#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,883 INFO L290 TraceCheckUtils]: 238: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,883 INFO L290 TraceCheckUtils]: 237: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:10,883 INFO L290 TraceCheckUtils]: 236: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,883 INFO L290 TraceCheckUtils]: 235: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,883 INFO L284 TraceCheckUtils]: 234: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:10,883 INFO L290 TraceCheckUtils]: 233: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 232: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 231: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L272 TraceCheckUtils]: 230: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 229: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 228: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 227: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L284 TraceCheckUtils]: 226: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 225: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 224: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,884 INFO L290 TraceCheckUtils]: 223: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L290 TraceCheckUtils]: 222: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L272 TraceCheckUtils]: 221: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L290 TraceCheckUtils]: 220: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L290 TraceCheckUtils]: 219: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L290 TraceCheckUtils]: 218: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L290 TraceCheckUtils]: 217: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L290 TraceCheckUtils]: 216: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,885 INFO L272 TraceCheckUtils]: 215: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,886 INFO L290 TraceCheckUtils]: 214: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,886 INFO L290 TraceCheckUtils]: 213: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,886 INFO L290 TraceCheckUtils]: 212: Hoare triple {14605#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,887 INFO L284 TraceCheckUtils]: 211: Hoare quadruple {15291#(<= 3 |fibonacci_#in~n|)} {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} #47#return; {14605#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,887 INFO L290 TraceCheckUtils]: 210: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume true; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,888 INFO L290 TraceCheckUtils]: 209: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,888 INFO L290 TraceCheckUtils]: 208: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,888 INFO L290 TraceCheckUtils]: 207: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,889 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {13831#true} {15291#(<= 3 |fibonacci_#in~n|)} #49#return; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,889 INFO L290 TraceCheckUtils]: 205: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,889 INFO L290 TraceCheckUtils]: 204: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,889 INFO L290 TraceCheckUtils]: 203: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,889 INFO L290 TraceCheckUtils]: 202: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,889 INFO L272 TraceCheckUtils]: 201: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,890 INFO L290 TraceCheckUtils]: 200: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,890 INFO L290 TraceCheckUtils]: 199: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,890 INFO L290 TraceCheckUtils]: 198: Hoare triple {15291#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,891 INFO L284 TraceCheckUtils]: 197: Hoare quadruple {14655#(<= 2 |fibonacci_#in~n|)} {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #47#return; {15291#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,891 INFO L290 TraceCheckUtils]: 196: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume true; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,892 INFO L290 TraceCheckUtils]: 195: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,892 INFO L290 TraceCheckUtils]: 194: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,892 INFO L290 TraceCheckUtils]: 193: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,893 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {13831#true} {14655#(<= 2 |fibonacci_#in~n|)} #49#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,893 INFO L290 TraceCheckUtils]: 191: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,893 INFO L290 TraceCheckUtils]: 190: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:10,893 INFO L290 TraceCheckUtils]: 189: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,893 INFO L272 TraceCheckUtils]: 188: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,893 INFO L290 TraceCheckUtils]: 187: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,894 INFO L290 TraceCheckUtils]: 186: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,894 INFO L290 TraceCheckUtils]: 185: Hoare triple {14655#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,895 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {15242#(<= 1 |fibonacci_#in~n|)} {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #47#return; {14655#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,895 INFO L290 TraceCheckUtils]: 183: Hoare triple {15242#(<= 1 |fibonacci_#in~n|)} assume true; {15242#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,895 INFO L290 TraceCheckUtils]: 182: Hoare triple {15242#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {15242#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,896 INFO L290 TraceCheckUtils]: 181: Hoare triple {15971#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {15242#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:10,896 INFO L290 TraceCheckUtils]: 180: Hoare triple {13831#true} ~n := #in~n; {15971#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:07:10,896 INFO L272 TraceCheckUtils]: 179: Hoare triple {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,897 INFO L290 TraceCheckUtils]: 178: Hoare triple {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:10,897 INFO L290 TraceCheckUtils]: 177: Hoare triple {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:10,897 INFO L290 TraceCheckUtils]: 176: Hoare triple {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:10,898 INFO L290 TraceCheckUtils]: 175: Hoare triple {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:10,898 INFO L290 TraceCheckUtils]: 174: Hoare triple {13831#true} ~n := #in~n; {15958#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:10,898 INFO L272 TraceCheckUtils]: 173: Hoare triple {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,898 INFO L290 TraceCheckUtils]: 172: Hoare triple {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 >= -2147483648; {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:07:10,899 INFO L290 TraceCheckUtils]: 171: Hoare triple {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 <= 2147483647; {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:07:10,899 INFO L290 TraceCheckUtils]: 170: Hoare triple {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(1 == ~n); {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:07:10,899 INFO L290 TraceCheckUtils]: 169: Hoare triple {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(~n < 1); {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:07:10,900 INFO L290 TraceCheckUtils]: 168: Hoare triple {13831#true} ~n := #in~n; {15915#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:07:10,900 INFO L272 TraceCheckUtils]: 167: Hoare triple {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,900 INFO L290 TraceCheckUtils]: 166: Hoare triple {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,900 INFO L290 TraceCheckUtils]: 165: Hoare triple {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,901 INFO L290 TraceCheckUtils]: 164: Hoare triple {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(1 == ~n); {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,901 INFO L290 TraceCheckUtils]: 163: Hoare triple {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(~n < 1); {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,902 INFO L290 TraceCheckUtils]: 162: Hoare triple {13831#true} ~n := #in~n; {15869#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,902 INFO L272 TraceCheckUtils]: 161: Hoare triple {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,902 INFO L290 TraceCheckUtils]: 160: Hoare triple {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,902 INFO L290 TraceCheckUtils]: 159: Hoare triple {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,903 INFO L290 TraceCheckUtils]: 158: Hoare triple {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} assume !(1 == ~n); {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,903 INFO L290 TraceCheckUtils]: 157: Hoare triple {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} assume !(~n < 1); {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,903 INFO L290 TraceCheckUtils]: 156: Hoare triple {13831#true} ~n := #in~n; {15766#(or (< fibonacci_~n 5) (<= 5 |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:10,903 INFO L272 TraceCheckUtils]: 155: Hoare triple {13975#(<= fibonacci_~n 6)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,904 INFO L290 TraceCheckUtils]: 154: Hoare triple {13975#(<= fibonacci_~n 6)} assume ~n - 2 >= -2147483648; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:10,904 INFO L290 TraceCheckUtils]: 153: Hoare triple {13975#(<= fibonacci_~n 6)} assume ~n - 2 <= 2147483647; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:10,904 INFO L290 TraceCheckUtils]: 152: Hoare triple {13975#(<= fibonacci_~n 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:10,905 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {14247#(<= |fibonacci_#in~n| 5)} {13831#true} #47#return; {13975#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:07:10,905 INFO L290 TraceCheckUtils]: 150: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume true; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,905 INFO L290 TraceCheckUtils]: 149: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,906 INFO L290 TraceCheckUtils]: 148: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,906 INFO L290 TraceCheckUtils]: 147: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,906 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {13831#true} {14247#(<= |fibonacci_#in~n| 5)} #49#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 145: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 144: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 143: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 142: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 140: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 139: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 138: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,907 INFO L290 TraceCheckUtils]: 137: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L272 TraceCheckUtils]: 136: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 135: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 134: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 133: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 131: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 130: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 129: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,908 INFO L290 TraceCheckUtils]: 128: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L290 TraceCheckUtils]: 126: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L290 TraceCheckUtils]: 125: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L290 TraceCheckUtils]: 124: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L272 TraceCheckUtils]: 123: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L290 TraceCheckUtils]: 122: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L290 TraceCheckUtils]: 121: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L290 TraceCheckUtils]: 120: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,909 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 118: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 117: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 116: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 115: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L272 TraceCheckUtils]: 114: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 112: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 111: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,910 INFO L290 TraceCheckUtils]: 110: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L290 TraceCheckUtils]: 109: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L272 TraceCheckUtils]: 108: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L290 TraceCheckUtils]: 107: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L290 TraceCheckUtils]: 106: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L290 TraceCheckUtils]: 105: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L290 TraceCheckUtils]: 104: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L290 TraceCheckUtils]: 103: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,911 INFO L272 TraceCheckUtils]: 102: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,912 INFO L290 TraceCheckUtils]: 101: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume ~n - 2 >= -2147483648; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,912 INFO L290 TraceCheckUtils]: 100: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume ~n - 2 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,912 INFO L290 TraceCheckUtils]: 99: Hoare triple {14247#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,913 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {14317#(<= |fibonacci_#in~n| 4)} {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} #47#return; {14247#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:07:10,913 INFO L290 TraceCheckUtils]: 97: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume true; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,913 INFO L290 TraceCheckUtils]: 96: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,914 INFO L290 TraceCheckUtils]: 94: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,914 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {13831#true} {14317#(<= |fibonacci_#in~n| 4)} #49#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 92: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 91: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 90: Hoare triple {13831#true} assume #t~ret4 + #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 89: Hoare triple {13831#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13831#true} {13831#true} #49#return; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 87: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 86: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L290 TraceCheckUtils]: 85: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,915 INFO L272 TraceCheckUtils]: 84: Hoare triple {13831#true} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 83: Hoare triple {13831#true} assume ~n - 2 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 82: Hoare triple {13831#true} assume ~n - 2 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {13831#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13831#true} {13831#true} #47#return; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 79: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 78: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 77: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,916 INFO L272 TraceCheckUtils]: 75: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L290 TraceCheckUtils]: 74: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L290 TraceCheckUtils]: 73: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L290 TraceCheckUtils]: 72: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L290 TraceCheckUtils]: 71: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L290 TraceCheckUtils]: 70: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L272 TraceCheckUtils]: 69: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume ~n - 2 >= -2147483648; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume ~n - 2 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {14317#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,919 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14348#(<= |fibonacci_#in~n| 3)} {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} #47#return; {14317#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:07:10,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume true; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,920 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13831#true} {14348#(<= |fibonacci_#in~n| 3)} #49#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,920 INFO L290 TraceCheckUtils]: 59: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {13831#true} assume 1 == ~n;#res := 1; {13831#true} is VALID [2022-02-21 03:07:10,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,921 INFO L272 TraceCheckUtils]: 55: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume ~n - 2 >= -2147483648; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume ~n - 2 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {14348#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,922 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14359#(<= |fibonacci_#in~n| 2)} {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #47#return; {14348#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:07:10,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume true; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,924 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13831#true} {14359#(<= |fibonacci_#in~n| 2)} #49#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-02-21 03:07:10,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {13831#true} assume ~n < 1;#res := 0; {13831#true} is VALID [2022-02-21 03:07:10,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,924 INFO L272 TraceCheckUtils]: 42: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {13831#true} is VALID [2022-02-21 03:07:10,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {14359#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,926 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14360#(<= |fibonacci_#in~n| 1)} {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #47#return; {14359#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:10,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {14360#(<= |fibonacci_#in~n| 1)} assume true; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:10,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {16411#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {14360#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:10,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {16411#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {16411#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:07:10,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {13831#true} ~n := #in~n; {16411#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:07:10,927 INFO L272 TraceCheckUtils]: 33: Hoare triple {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:10,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:10,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:10,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:10,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {13831#true} ~n := #in~n; {16401#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:10,929 INFO L272 TraceCheckUtils]: 27: Hoare triple {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 >= -2147483648; {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:07:10,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 <= 2147483647; {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:07:10,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:07:10,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:07:10,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} ~n := #in~n; {16358#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:07:10,930 INFO L272 TraceCheckUtils]: 21: Hoare triple {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume ~n - 1 >= -2147483648; {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:07:10,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume ~n - 1 <= 2147483647; {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:07:10,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume !(1 == ~n); {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:07:10,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} assume !(~n < 1); {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:07:10,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {13831#true} ~n := #in~n; {16312#(or (< 4 fibonacci_~n) (<= |fibonacci_#in~n| 4))} is VALID [2022-02-21 03:07:10,932 INFO L272 TraceCheckUtils]: 15: Hoare triple {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume ~n - 1 >= -2147483648; {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:07:10,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume ~n - 1 <= 2147483647; {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:07:10,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume !(1 == ~n); {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:07:10,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume !(~n < 1); {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:07:10,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#true} ~n := #in~n; {16209#(or (< 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:07:10,933 INFO L272 TraceCheckUtils]: 9: Hoare triple {13831#true} call #t~ret4 := fibonacci(~n - 1); {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume ~n - 1 >= -2147483648; {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} assume ~n - 1 <= 2147483647; {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {13831#true} assume !(1 == ~n); {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {13831#true} assume !(~n < 1); {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {13831#true} ~n := #in~n; {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L272 TraceCheckUtils]: 3: Hoare triple {13831#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {13831#true} assume !(main_~x~0#1 < 1); {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#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;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {13831#true} is VALID [2022-02-21 03:07:10,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {13831#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); {13831#true} is VALID [2022-02-21 03:07:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 555 proven. 1253 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2022-02-21 03:07:10,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505998088] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:07:10,936 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:07:10,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 23] total 33 [2022-02-21 03:07:10,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345137005] [2022-02-21 03:07:10,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:07:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.121212121212121) internal successors, (169), 33 states have internal predecessors, (169), 27 states have call successors, (31), 1 states have call predecessors, (31), 11 states have return successors, (42), 18 states have call predecessors, (42), 27 states have call successors, (42) Word has length 300