/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:36:09,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:36:09,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:36:09,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:36:09,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:36:09,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:36:09,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:36:09,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:36:09,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:36:09,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:36:09,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:36:09,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:36:09,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:36:09,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:36:09,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:36:09,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:36:09,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:36:09,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:36:09,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:36:10,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:36:10,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:36:10,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:36:10,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:36:10,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:36:10,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:36:10,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:36:10,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:36:10,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:36:10,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:36:10,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:36:10,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:36:10,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:36:10,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:36:10,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:36:10,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:36:10,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:36:10,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:36:10,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:36:10,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:36:10,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:36:10,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:36:10,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:36:10,025 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:36:10,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:36:10,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:36:10,026 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:36:10,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:36:10,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:36:10,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:36:10,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:36:10,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:36:10,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:36:10,028 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:36:10,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:36:10,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:36:10,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:36:10,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:36:10,029 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:36:10,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:36:10,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:36:10,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:36:10,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:36:10,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:36:10,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:36:10,030 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:36:10,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:36:10,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:36:10,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:36:10,314 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:36:10,314 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:36:10,315 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci02.c [2020-07-10 18:36:10,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd8a2ae5/bbb893e219ff41b2a869820c54eca6ec/FLAG4633edf02 [2020-07-10 18:36:10,773 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:36:10,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci02.c [2020-07-10 18:36:10,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd8a2ae5/bbb893e219ff41b2a869820c54eca6ec/FLAG4633edf02 [2020-07-10 18:36:11,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd8a2ae5/bbb893e219ff41b2a869820c54eca6ec [2020-07-10 18:36:11,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:36:11,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:36:11,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:11,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:36:11,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:36:11,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47941ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11, skipping insertion in model container [2020-07-10 18:36:11,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:36:11,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:36:11,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:11,469 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:36:11,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:11,497 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:36:11,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11 WrapperNode [2020-07-10 18:36:11,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:11,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:36:11,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:36:11,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:36:11,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... [2020-07-10 18:36:11,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:36:11,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:36:11,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:36:11,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:36:11,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:36:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:36:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:36:11,664 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-10 18:36:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:36:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:36:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:36:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-10 18:36:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:36:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:36:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:36:11,885 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:36:11,885 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:36:11,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:11 BoogieIcfgContainer [2020-07-10 18:36:11,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:36:11,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:36:11,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:36:11,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:36:11,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:36:11" (1/3) ... [2020-07-10 18:36:11,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4241d098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:11, skipping insertion in model container [2020-07-10 18:36:11,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:11" (2/3) ... [2020-07-10 18:36:11,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4241d098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:11, skipping insertion in model container [2020-07-10 18:36:11,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:11" (3/3) ... [2020-07-10 18:36:11,897 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2020-07-10 18:36:11,908 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:36:11,915 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:36:11,935 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:36:11,962 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:36:11,962 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:36:11,962 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:36:11,962 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:36:11,963 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:36:11,963 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:36:11,963 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:36:11,963 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:36:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-10 18:36:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 18:36:11,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:11,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:11,994 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:12,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2085313281, now seen corresponding path program 1 times [2020-07-10 18:36:12,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:12,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1009295473] [2020-07-10 18:36:12,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:12,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-10 18:36:12,209 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {34#true} {34#true} #42#return; {34#true} is VALID [2020-07-10 18:36:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:12,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} ~n := #in~n; {44#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:12,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {45#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:12,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#(<= |fibonacci_#in~n| 0)} #res := 0; {45#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:12,274 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#(<= |fibonacci_#in~n| 0)} assume true; {45#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:12,277 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {45#(<= |fibonacci_#in~n| 0)} {38#(<= 9 main_~x~0)} #46#return; {35#false} is VALID [2020-07-10 18:36:12,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2020-07-10 18:36:12,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-10 18:36:12,278 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #42#return; {34#true} is VALID [2020-07-10 18:36:12,279 INFO L263 TraceCheckUtils]: 3: Hoare triple {34#true} call #t~ret3 := main(); {34#true} is VALID [2020-07-10 18:36:12,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#true} ~x~0 := 9; {38#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:12,281 INFO L263 TraceCheckUtils]: 5: Hoare triple {38#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {34#true} is VALID [2020-07-10 18:36:12,282 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#true} ~n := #in~n; {44#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:12,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {45#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:12,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#(<= |fibonacci_#in~n| 0)} #res := 0; {45#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:12,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(<= |fibonacci_#in~n| 0)} assume true; {45#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:12,287 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {45#(<= |fibonacci_#in~n| 0)} {38#(<= 9 main_~x~0)} #46#return; {35#false} is VALID [2020-07-10 18:36:12,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {35#false} is VALID [2020-07-10 18:36:12,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {35#false} ~result~0 := #t~ret2; {35#false} is VALID [2020-07-10 18:36:12,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {35#false} havoc #t~ret2; {35#false} is VALID [2020-07-10 18:36:12,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {35#false} assume !(34 == ~result~0); {35#false} is VALID [2020-07-10 18:36:12,289 INFO L280 TraceCheckUtils]: 15: Hoare triple {35#false} assume !false; {35#false} is VALID [2020-07-10 18:36:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:36:12,292 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:12,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1009295473] [2020-07-10 18:36:12,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:12,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:36:12,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410227057] [2020-07-10 18:36:12,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 18:36:12,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:12,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:36:12,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:12,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:36:12,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:12,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:36:12,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:36:12,365 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-10 18:36:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:12,656 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-10 18:36:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:36:12,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 18:36:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 18:36:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 18:36:12,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-10 18:36:12,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:12,790 INFO L225 Difference]: With dead ends: 44 [2020-07-10 18:36:12,790 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 18:36:12,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 18:36:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 18:36:12,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:12,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 18:36:12,878 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 18:36:12,878 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 18:36:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:12,884 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-10 18:36:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 18:36:12,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:12,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:12,886 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 18:36:12,886 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 18:36:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:12,891 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-10 18:36:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 18:36:12,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:12,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:12,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:12,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 18:36:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-10 18:36:12,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-10 18:36:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:12,899 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-10 18:36:12,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:36:12,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2020-07-10 18:36:12,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 18:36:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 18:36:12,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:12,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:12,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:36:12,946 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash -93144392, now seen corresponding path program 1 times [2020-07-10 18:36:12,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:12,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94971399] [2020-07-10 18:36:12,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:12,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#true} assume true; {250#true} is VALID [2020-07-10 18:36:12,980 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {250#true} {250#true} #42#return; {250#true} is VALID [2020-07-10 18:36:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:13,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#true} ~n := #in~n; {261#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {261#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {261#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {261#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {262#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:13,015 INFO L280 TraceCheckUtils]: 3: Hoare triple {262#(<= |fibonacci_#in~n| 1)} #res := 1; {262#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:13,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {262#(<= |fibonacci_#in~n| 1)} assume true; {262#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:13,017 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {262#(<= |fibonacci_#in~n| 1)} {254#(<= 9 main_~x~0)} #46#return; {251#false} is VALID [2020-07-10 18:36:13,018 INFO L263 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2020-07-10 18:36:13,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2020-07-10 18:36:13,018 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #42#return; {250#true} is VALID [2020-07-10 18:36:13,019 INFO L263 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret3 := main(); {250#true} is VALID [2020-07-10 18:36:13,019 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#true} ~x~0 := 9; {254#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:13,020 INFO L263 TraceCheckUtils]: 5: Hoare triple {254#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {250#true} is VALID [2020-07-10 18:36:13,021 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#true} ~n := #in~n; {261#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,021 INFO L280 TraceCheckUtils]: 7: Hoare triple {261#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {261#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,022 INFO L280 TraceCheckUtils]: 8: Hoare triple {261#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {262#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:13,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {262#(<= |fibonacci_#in~n| 1)} #res := 1; {262#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:13,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {262#(<= |fibonacci_#in~n| 1)} assume true; {262#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:13,025 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {262#(<= |fibonacci_#in~n| 1)} {254#(<= 9 main_~x~0)} #46#return; {251#false} is VALID [2020-07-10 18:36:13,025 INFO L280 TraceCheckUtils]: 12: Hoare triple {251#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {251#false} is VALID [2020-07-10 18:36:13,025 INFO L280 TraceCheckUtils]: 13: Hoare triple {251#false} ~result~0 := #t~ret2; {251#false} is VALID [2020-07-10 18:36:13,026 INFO L280 TraceCheckUtils]: 14: Hoare triple {251#false} havoc #t~ret2; {251#false} is VALID [2020-07-10 18:36:13,026 INFO L280 TraceCheckUtils]: 15: Hoare triple {251#false} assume !(34 == ~result~0); {251#false} is VALID [2020-07-10 18:36:13,026 INFO L280 TraceCheckUtils]: 16: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-10 18:36:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:36:13,028 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:13,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [94971399] [2020-07-10 18:36:13,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:13,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:36:13,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811381539] [2020-07-10 18:36:13,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 18:36:13,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:13,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:36:13,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:13,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:36:13,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:36:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:36:13,050 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-10 18:36:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:13,231 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-10 18:36:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:36:13,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 18:36:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-10 18:36:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-10 18:36:13,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-10 18:36:13,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:13,291 INFO L225 Difference]: With dead ends: 36 [2020-07-10 18:36:13,291 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 18:36:13,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 18:36:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-10 18:36:13,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:13,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-10 18:36:13,326 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-10 18:36:13,326 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-10 18:36:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:13,330 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-10 18:36:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 18:36:13,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:13,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:13,332 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-10 18:36:13,332 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-10 18:36:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:13,336 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-10 18:36:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 18:36:13,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:13,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:13,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:13,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 18:36:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-10 18:36:13,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-10 18:36:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:13,341 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-10 18:36:13,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:36:13,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2020-07-10 18:36:13,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 18:36:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 18:36:13,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:13,386 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:13,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:36:13,387 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash 37359445, now seen corresponding path program 1 times [2020-07-10 18:36:13,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:13,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297847490] [2020-07-10 18:36:13,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:13,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-10 18:36:13,456 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {455#true} {455#true} #42#return; {455#true} is VALID [2020-07-10 18:36:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:13,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {455#true} ~n := #in~n; {494#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {494#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {495#(<= |fibonacci_#in~n| 0)} #res := 0; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {495#(<= |fibonacci_#in~n| 0)} assume true; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,563 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {495#(<= |fibonacci_#in~n| 0)} {483#(< 1 fibonacci_~n)} #38#return; {456#false} is VALID [2020-07-10 18:36:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:13,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {455#true} ~n := #in~n; {455#true} is VALID [2020-07-10 18:36:13,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {455#true} assume ~n < 1; {455#true} is VALID [2020-07-10 18:36:13,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {455#true} #res := 0; {455#true} is VALID [2020-07-10 18:36:13,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-10 18:36:13,570 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {455#true} {456#false} #40#return; {456#false} is VALID [2020-07-10 18:36:13,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {455#true} ~n := #in~n; {455#true} is VALID [2020-07-10 18:36:13,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {455#true} assume !(~n < 1); {482#(< 0 fibonacci_~n)} is VALID [2020-07-10 18:36:13,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#(< 0 fibonacci_~n)} assume !(1 == ~n); {483#(< 1 fibonacci_~n)} is VALID [2020-07-10 18:36:13,573 INFO L263 TraceCheckUtils]: 3: Hoare triple {483#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {455#true} is VALID [2020-07-10 18:36:13,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {455#true} ~n := #in~n; {494#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {494#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,576 INFO L280 TraceCheckUtils]: 6: Hoare triple {495#(<= |fibonacci_#in~n| 0)} #res := 0; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,577 INFO L280 TraceCheckUtils]: 7: Hoare triple {495#(<= |fibonacci_#in~n| 0)} assume true; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,578 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {495#(<= |fibonacci_#in~n| 0)} {483#(< 1 fibonacci_~n)} #38#return; {456#false} is VALID [2020-07-10 18:36:13,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {456#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {456#false} is VALID [2020-07-10 18:36:13,579 INFO L263 TraceCheckUtils]: 10: Hoare triple {456#false} call #t~ret1 := fibonacci(~n - 2); {455#true} is VALID [2020-07-10 18:36:13,579 INFO L280 TraceCheckUtils]: 11: Hoare triple {455#true} ~n := #in~n; {455#true} is VALID [2020-07-10 18:36:13,580 INFO L280 TraceCheckUtils]: 12: Hoare triple {455#true} assume ~n < 1; {455#true} is VALID [2020-07-10 18:36:13,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {455#true} #res := 0; {455#true} is VALID [2020-07-10 18:36:13,580 INFO L280 TraceCheckUtils]: 14: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-10 18:36:13,581 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {455#true} {456#false} #40#return; {456#false} is VALID [2020-07-10 18:36:13,581 INFO L280 TraceCheckUtils]: 16: Hoare triple {456#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {456#false} is VALID [2020-07-10 18:36:13,582 INFO L280 TraceCheckUtils]: 17: Hoare triple {456#false} #res := #t~ret0 + #t~ret1; {456#false} is VALID [2020-07-10 18:36:13,582 INFO L280 TraceCheckUtils]: 18: Hoare triple {456#false} havoc #t~ret0; {456#false} is VALID [2020-07-10 18:36:13,582 INFO L280 TraceCheckUtils]: 19: Hoare triple {456#false} havoc #t~ret1; {456#false} is VALID [2020-07-10 18:36:13,583 INFO L280 TraceCheckUtils]: 20: Hoare triple {456#false} assume true; {456#false} is VALID [2020-07-10 18:36:13,583 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {456#false} {459#(<= 9 main_~x~0)} #46#return; {456#false} is VALID [2020-07-10 18:36:13,585 INFO L263 TraceCheckUtils]: 0: Hoare triple {455#true} call ULTIMATE.init(); {455#true} is VALID [2020-07-10 18:36:13,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-10 18:36:13,586 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {455#true} {455#true} #42#return; {455#true} is VALID [2020-07-10 18:36:13,586 INFO L263 TraceCheckUtils]: 3: Hoare triple {455#true} call #t~ret3 := main(); {455#true} is VALID [2020-07-10 18:36:13,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {455#true} ~x~0 := 9; {459#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:13,588 INFO L263 TraceCheckUtils]: 5: Hoare triple {459#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {455#true} is VALID [2020-07-10 18:36:13,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {455#true} ~n := #in~n; {455#true} is VALID [2020-07-10 18:36:13,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {455#true} assume !(~n < 1); {482#(< 0 fibonacci_~n)} is VALID [2020-07-10 18:36:13,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#(< 0 fibonacci_~n)} assume !(1 == ~n); {483#(< 1 fibonacci_~n)} is VALID [2020-07-10 18:36:13,590 INFO L263 TraceCheckUtils]: 9: Hoare triple {483#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {455#true} is VALID [2020-07-10 18:36:13,591 INFO L280 TraceCheckUtils]: 10: Hoare triple {455#true} ~n := #in~n; {494#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:13,592 INFO L280 TraceCheckUtils]: 11: Hoare triple {494#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,593 INFO L280 TraceCheckUtils]: 12: Hoare triple {495#(<= |fibonacci_#in~n| 0)} #res := 0; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,594 INFO L280 TraceCheckUtils]: 13: Hoare triple {495#(<= |fibonacci_#in~n| 0)} assume true; {495#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:13,595 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {495#(<= |fibonacci_#in~n| 0)} {483#(< 1 fibonacci_~n)} #38#return; {456#false} is VALID [2020-07-10 18:36:13,595 INFO L280 TraceCheckUtils]: 15: Hoare triple {456#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {456#false} is VALID [2020-07-10 18:36:13,596 INFO L263 TraceCheckUtils]: 16: Hoare triple {456#false} call #t~ret1 := fibonacci(~n - 2); {455#true} is VALID [2020-07-10 18:36:13,596 INFO L280 TraceCheckUtils]: 17: Hoare triple {455#true} ~n := #in~n; {455#true} is VALID [2020-07-10 18:36:13,597 INFO L280 TraceCheckUtils]: 18: Hoare triple {455#true} assume ~n < 1; {455#true} is VALID [2020-07-10 18:36:13,597 INFO L280 TraceCheckUtils]: 19: Hoare triple {455#true} #res := 0; {455#true} is VALID [2020-07-10 18:36:13,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-10 18:36:13,598 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {455#true} {456#false} #40#return; {456#false} is VALID [2020-07-10 18:36:13,598 INFO L280 TraceCheckUtils]: 22: Hoare triple {456#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {456#false} is VALID [2020-07-10 18:36:13,598 INFO L280 TraceCheckUtils]: 23: Hoare triple {456#false} #res := #t~ret0 + #t~ret1; {456#false} is VALID [2020-07-10 18:36:13,599 INFO L280 TraceCheckUtils]: 24: Hoare triple {456#false} havoc #t~ret0; {456#false} is VALID [2020-07-10 18:36:13,599 INFO L280 TraceCheckUtils]: 25: Hoare triple {456#false} havoc #t~ret1; {456#false} is VALID [2020-07-10 18:36:13,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {456#false} assume true; {456#false} is VALID [2020-07-10 18:36:13,600 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {456#false} {459#(<= 9 main_~x~0)} #46#return; {456#false} is VALID [2020-07-10 18:36:13,600 INFO L280 TraceCheckUtils]: 28: Hoare triple {456#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {456#false} is VALID [2020-07-10 18:36:13,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {456#false} ~result~0 := #t~ret2; {456#false} is VALID [2020-07-10 18:36:13,601 INFO L280 TraceCheckUtils]: 30: Hoare triple {456#false} havoc #t~ret2; {456#false} is VALID [2020-07-10 18:36:13,601 INFO L280 TraceCheckUtils]: 31: Hoare triple {456#false} assume !(34 == ~result~0); {456#false} is VALID [2020-07-10 18:36:13,602 INFO L280 TraceCheckUtils]: 32: Hoare triple {456#false} assume !false; {456#false} is VALID [2020-07-10 18:36:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 18:36:13,604 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:13,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297847490] [2020-07-10 18:36:13,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:13,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 18:36:13,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668616176] [2020-07-10 18:36:13,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-10 18:36:13,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:13,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 18:36:13,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:13,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 18:36:13,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 18:36:13,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:36:13,648 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-10 18:36:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:13,950 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-10 18:36:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 18:36:13,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-10 18:36:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-10 18:36:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2020-07-10 18:36:13,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2020-07-10 18:36:14,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:14,030 INFO L225 Difference]: With dead ends: 52 [2020-07-10 18:36:14,031 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 18:36:14,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 18:36:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 18:36:14,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:14,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:14,071 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:14,072 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:14,075 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 18:36:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:14,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:14,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:14,076 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:14,076 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:14,079 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 18:36:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:14,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:14,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:14,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:14,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 18:36:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-10 18:36:14,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-10 18:36:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:14,084 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-10 18:36:14,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 18:36:14,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-10 18:36:14,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 18:36:14,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:14,129 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:14,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:36:14,130 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1599890626, now seen corresponding path program 1 times [2020-07-10 18:36:14,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:14,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1241099212] [2020-07-10 18:36:14,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} assume true; {730#true} is VALID [2020-07-10 18:36:14,234 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {730#true} {730#true} #42#return; {730#true} is VALID [2020-07-10 18:36:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} ~n := #in~n; {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#(<= |fibonacci_#in~n| 1)} #res := 1; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,304 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#(<= |fibonacci_#in~n| 1)} assume true; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,305 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {771#(<= |fibonacci_#in~n| 1)} {758#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} ~n := #in~n; {730#true} is VALID [2020-07-10 18:36:14,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {730#true} assume ~n < 1; {730#true} is VALID [2020-07-10 18:36:14,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {730#true} #res := 0; {730#true} is VALID [2020-07-10 18:36:14,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {730#true} assume true; {730#true} is VALID [2020-07-10 18:36:14,314 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {730#true} {765#(<= |fibonacci_#in~n| 2)} #40#return; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} ~n := #in~n; {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,317 INFO L263 TraceCheckUtils]: 3: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {730#true} is VALID [2020-07-10 18:36:14,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {730#true} ~n := #in~n; {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {771#(<= |fibonacci_#in~n| 1)} #res := 1; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,320 INFO L280 TraceCheckUtils]: 8: Hoare triple {771#(<= |fibonacci_#in~n| 1)} assume true; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,322 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {771#(<= |fibonacci_#in~n| 1)} {758#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,322 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,323 INFO L263 TraceCheckUtils]: 11: Hoare triple {765#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {730#true} is VALID [2020-07-10 18:36:14,323 INFO L280 TraceCheckUtils]: 12: Hoare triple {730#true} ~n := #in~n; {730#true} is VALID [2020-07-10 18:36:14,323 INFO L280 TraceCheckUtils]: 13: Hoare triple {730#true} assume ~n < 1; {730#true} is VALID [2020-07-10 18:36:14,324 INFO L280 TraceCheckUtils]: 14: Hoare triple {730#true} #res := 0; {730#true} is VALID [2020-07-10 18:36:14,324 INFO L280 TraceCheckUtils]: 15: Hoare triple {730#true} assume true; {730#true} is VALID [2020-07-10 18:36:14,325 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {730#true} {765#(<= |fibonacci_#in~n| 2)} #40#return; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,326 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {765#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {765#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,328 INFO L280 TraceCheckUtils]: 21: Hoare triple {765#(<= |fibonacci_#in~n| 2)} assume true; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,329 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {765#(<= |fibonacci_#in~n| 2)} {734#(<= 9 main_~x~0)} #46#return; {731#false} is VALID [2020-07-10 18:36:14,331 INFO L263 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2020-07-10 18:36:14,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {730#true} assume true; {730#true} is VALID [2020-07-10 18:36:14,331 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {730#true} {730#true} #42#return; {730#true} is VALID [2020-07-10 18:36:14,331 INFO L263 TraceCheckUtils]: 3: Hoare triple {730#true} call #t~ret3 := main(); {730#true} is VALID [2020-07-10 18:36:14,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {730#true} ~x~0 := 9; {734#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:14,332 INFO L263 TraceCheckUtils]: 5: Hoare triple {734#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {730#true} is VALID [2020-07-10 18:36:14,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {730#true} ~n := #in~n; {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,335 INFO L263 TraceCheckUtils]: 9: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {730#true} is VALID [2020-07-10 18:36:14,335 INFO L280 TraceCheckUtils]: 10: Hoare triple {730#true} ~n := #in~n; {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,336 INFO L280 TraceCheckUtils]: 11: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {758#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,337 INFO L280 TraceCheckUtils]: 12: Hoare triple {758#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#(<= |fibonacci_#in~n| 1)} #res := 1; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {771#(<= |fibonacci_#in~n| 1)} assume true; {771#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:14,339 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {771#(<= |fibonacci_#in~n| 1)} {758#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,340 INFO L280 TraceCheckUtils]: 16: Hoare triple {765#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,340 INFO L263 TraceCheckUtils]: 17: Hoare triple {765#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {730#true} is VALID [2020-07-10 18:36:14,340 INFO L280 TraceCheckUtils]: 18: Hoare triple {730#true} ~n := #in~n; {730#true} is VALID [2020-07-10 18:36:14,341 INFO L280 TraceCheckUtils]: 19: Hoare triple {730#true} assume ~n < 1; {730#true} is VALID [2020-07-10 18:36:14,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {730#true} #res := 0; {730#true} is VALID [2020-07-10 18:36:14,341 INFO L280 TraceCheckUtils]: 21: Hoare triple {730#true} assume true; {730#true} is VALID [2020-07-10 18:36:14,342 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {730#true} {765#(<= |fibonacci_#in~n| 2)} #40#return; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,343 INFO L280 TraceCheckUtils]: 23: Hoare triple {765#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,343 INFO L280 TraceCheckUtils]: 24: Hoare triple {765#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,344 INFO L280 TraceCheckUtils]: 25: Hoare triple {765#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,345 INFO L280 TraceCheckUtils]: 26: Hoare triple {765#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,345 INFO L280 TraceCheckUtils]: 27: Hoare triple {765#(<= |fibonacci_#in~n| 2)} assume true; {765#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:14,346 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {765#(<= |fibonacci_#in~n| 2)} {734#(<= 9 main_~x~0)} #46#return; {731#false} is VALID [2020-07-10 18:36:14,347 INFO L280 TraceCheckUtils]: 29: Hoare triple {731#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {731#false} is VALID [2020-07-10 18:36:14,347 INFO L280 TraceCheckUtils]: 30: Hoare triple {731#false} ~result~0 := #t~ret2; {731#false} is VALID [2020-07-10 18:36:14,347 INFO L280 TraceCheckUtils]: 31: Hoare triple {731#false} havoc #t~ret2; {731#false} is VALID [2020-07-10 18:36:14,347 INFO L280 TraceCheckUtils]: 32: Hoare triple {731#false} assume !(34 == ~result~0); {731#false} is VALID [2020-07-10 18:36:14,348 INFO L280 TraceCheckUtils]: 33: Hoare triple {731#false} assume !false; {731#false} is VALID [2020-07-10 18:36:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 18:36:14,349 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:14,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1241099212] [2020-07-10 18:36:14,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:14,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:36:14,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106015814] [2020-07-10 18:36:14,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-10 18:36:14,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:14,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:36:14,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:14,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:36:14,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:36:14,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:14,386 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-10 18:36:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:14,775 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-10 18:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 18:36:14,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-10 18:36:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2020-07-10 18:36:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2020-07-10 18:36:14,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2020-07-10 18:36:14,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:14,871 INFO L225 Difference]: With dead ends: 56 [2020-07-10 18:36:14,871 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 18:36:14,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-10 18:36:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 18:36:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-10 18:36:14,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:14,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2020-07-10 18:36:14,947 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2020-07-10 18:36:14,947 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2020-07-10 18:36:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:14,952 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2020-07-10 18:36:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-10 18:36:14,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:14,954 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2020-07-10 18:36:14,954 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2020-07-10 18:36:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:14,958 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2020-07-10 18:36:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-10 18:36:14,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:14,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:14,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:14,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 18:36:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-10 18:36:14,963 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-10 18:36:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:14,964 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-10 18:36:14,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:36:14,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2020-07-10 18:36:15,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-10 18:36:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 18:36:15,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:15,041 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:15,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:36:15,041 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1509057080, now seen corresponding path program 2 times [2020-07-10 18:36:15,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:15,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336317004] [2020-07-10 18:36:15,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,225 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1092#true} {1092#true} #42#return; {1092#true} is VALID [2020-07-10 18:36:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {1092#true} assume !(~n < 1); {1092#true} is VALID [2020-07-10 18:36:15,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {1092#true} assume 1 == ~n; {1092#true} is VALID [2020-07-10 18:36:15,352 INFO L280 TraceCheckUtils]: 3: Hoare triple {1092#true} #res := 1; {1092#true} is VALID [2020-07-10 18:36:15,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,353 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #38#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {1092#true} assume ~n < 1; {1092#true} is VALID [2020-07-10 18:36:15,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {1092#true} #res := 0; {1092#true} is VALID [2020-07-10 18:36:15,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,363 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #40#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#true} ~n := #in~n; {1166#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {1166#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1167#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 18:36:15,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {1167#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,368 INFO L263 TraceCheckUtils]: 3: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1092#true} is VALID [2020-07-10 18:36:15,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {1092#true} assume !(~n < 1); {1092#true} is VALID [2020-07-10 18:36:15,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {1092#true} assume 1 == ~n; {1092#true} is VALID [2020-07-10 18:36:15,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {1092#true} #res := 1; {1092#true} is VALID [2020-07-10 18:36:15,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,370 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #38#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,371 INFO L280 TraceCheckUtils]: 10: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,371 INFO L263 TraceCheckUtils]: 11: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1092#true} is VALID [2020-07-10 18:36:15,371 INFO L280 TraceCheckUtils]: 12: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,371 INFO L280 TraceCheckUtils]: 13: Hoare triple {1092#true} assume ~n < 1; {1092#true} is VALID [2020-07-10 18:36:15,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {1092#true} #res := 0; {1092#true} is VALID [2020-07-10 18:36:15,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,373 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #40#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,374 INFO L280 TraceCheckUtils]: 17: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,378 INFO L280 TraceCheckUtils]: 19: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,379 INFO L280 TraceCheckUtils]: 20: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,379 INFO L280 TraceCheckUtils]: 21: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume true; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,380 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1168#(<= 2 |fibonacci_#in~n|)} {1092#true} #38#return; {1160#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#true} ~n := #in~n; {1166#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {1166#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {1180#(<= |fibonacci_#in~n| 0)} #res := 0; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {1180#(<= |fibonacci_#in~n| 0)} assume true; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,404 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1180#(<= |fibonacci_#in~n| 0)} {1160#(<= 3 fibonacci_~n)} #40#return; {1093#false} is VALID [2020-07-10 18:36:15,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {1092#true} assume !(~n < 1); {1092#true} is VALID [2020-07-10 18:36:15,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {1092#true} assume !(1 == ~n); {1092#true} is VALID [2020-07-10 18:36:15,405 INFO L263 TraceCheckUtils]: 3: Hoare triple {1092#true} call #t~ret0 := fibonacci(~n - 1); {1092#true} is VALID [2020-07-10 18:36:15,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {1092#true} ~n := #in~n; {1166#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {1166#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1167#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 18:36:15,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {1167#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,407 INFO L263 TraceCheckUtils]: 7: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1092#true} is VALID [2020-07-10 18:36:15,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,408 INFO L280 TraceCheckUtils]: 9: Hoare triple {1092#true} assume !(~n < 1); {1092#true} is VALID [2020-07-10 18:36:15,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {1092#true} assume 1 == ~n; {1092#true} is VALID [2020-07-10 18:36:15,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {1092#true} #res := 1; {1092#true} is VALID [2020-07-10 18:36:15,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,409 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #38#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,410 INFO L280 TraceCheckUtils]: 14: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,410 INFO L263 TraceCheckUtils]: 15: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1092#true} is VALID [2020-07-10 18:36:15,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,411 INFO L280 TraceCheckUtils]: 17: Hoare triple {1092#true} assume ~n < 1; {1092#true} is VALID [2020-07-10 18:36:15,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {1092#true} #res := 0; {1092#true} is VALID [2020-07-10 18:36:15,411 INFO L280 TraceCheckUtils]: 19: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,412 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #40#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,413 INFO L280 TraceCheckUtils]: 22: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,415 INFO L280 TraceCheckUtils]: 24: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,415 INFO L280 TraceCheckUtils]: 25: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume true; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,416 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1168#(<= 2 |fibonacci_#in~n|)} {1092#true} #38#return; {1160#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:15,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {1160#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1160#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:15,417 INFO L263 TraceCheckUtils]: 28: Hoare triple {1160#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1092#true} is VALID [2020-07-10 18:36:15,418 INFO L280 TraceCheckUtils]: 29: Hoare triple {1092#true} ~n := #in~n; {1166#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {1166#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,419 INFO L280 TraceCheckUtils]: 31: Hoare triple {1180#(<= |fibonacci_#in~n| 0)} #res := 0; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,420 INFO L280 TraceCheckUtils]: 32: Hoare triple {1180#(<= |fibonacci_#in~n| 0)} assume true; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,421 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1180#(<= |fibonacci_#in~n| 0)} {1160#(<= 3 fibonacci_~n)} #40#return; {1093#false} is VALID [2020-07-10 18:36:15,422 INFO L280 TraceCheckUtils]: 34: Hoare triple {1093#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1093#false} is VALID [2020-07-10 18:36:15,422 INFO L280 TraceCheckUtils]: 35: Hoare triple {1093#false} #res := #t~ret0 + #t~ret1; {1093#false} is VALID [2020-07-10 18:36:15,422 INFO L280 TraceCheckUtils]: 36: Hoare triple {1093#false} havoc #t~ret0; {1093#false} is VALID [2020-07-10 18:36:15,422 INFO L280 TraceCheckUtils]: 37: Hoare triple {1093#false} havoc #t~ret1; {1093#false} is VALID [2020-07-10 18:36:15,423 INFO L280 TraceCheckUtils]: 38: Hoare triple {1093#false} assume true; {1093#false} is VALID [2020-07-10 18:36:15,423 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1093#false} {1096#(<= 9 main_~x~0)} #46#return; {1093#false} is VALID [2020-07-10 18:36:15,425 INFO L263 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2020-07-10 18:36:15,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1092#true} {1092#true} #42#return; {1092#true} is VALID [2020-07-10 18:36:15,426 INFO L263 TraceCheckUtils]: 3: Hoare triple {1092#true} call #t~ret3 := main(); {1092#true} is VALID [2020-07-10 18:36:15,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {1092#true} ~x~0 := 9; {1096#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:15,427 INFO L263 TraceCheckUtils]: 5: Hoare triple {1096#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {1092#true} is VALID [2020-07-10 18:36:15,427 INFO L280 TraceCheckUtils]: 6: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {1092#true} assume !(~n < 1); {1092#true} is VALID [2020-07-10 18:36:15,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#true} assume !(1 == ~n); {1092#true} is VALID [2020-07-10 18:36:15,428 INFO L263 TraceCheckUtils]: 9: Hoare triple {1092#true} call #t~ret0 := fibonacci(~n - 1); {1092#true} is VALID [2020-07-10 18:36:15,428 INFO L280 TraceCheckUtils]: 10: Hoare triple {1092#true} ~n := #in~n; {1166#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,429 INFO L280 TraceCheckUtils]: 11: Hoare triple {1166#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1167#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 18:36:15,430 INFO L280 TraceCheckUtils]: 12: Hoare triple {1167#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,430 INFO L263 TraceCheckUtils]: 13: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1092#true} is VALID [2020-07-10 18:36:15,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,431 INFO L280 TraceCheckUtils]: 15: Hoare triple {1092#true} assume !(~n < 1); {1092#true} is VALID [2020-07-10 18:36:15,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {1092#true} assume 1 == ~n; {1092#true} is VALID [2020-07-10 18:36:15,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {1092#true} #res := 1; {1092#true} is VALID [2020-07-10 18:36:15,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,432 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #38#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,433 INFO L263 TraceCheckUtils]: 21: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1092#true} is VALID [2020-07-10 18:36:15,434 INFO L280 TraceCheckUtils]: 22: Hoare triple {1092#true} ~n := #in~n; {1092#true} is VALID [2020-07-10 18:36:15,434 INFO L280 TraceCheckUtils]: 23: Hoare triple {1092#true} assume ~n < 1; {1092#true} is VALID [2020-07-10 18:36:15,434 INFO L280 TraceCheckUtils]: 24: Hoare triple {1092#true} #res := 0; {1092#true} is VALID [2020-07-10 18:36:15,434 INFO L280 TraceCheckUtils]: 25: Hoare triple {1092#true} assume true; {1092#true} is VALID [2020-07-10 18:36:15,447 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1092#true} {1168#(<= 2 |fibonacci_#in~n|)} #40#return; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,451 INFO L280 TraceCheckUtils]: 27: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,454 INFO L280 TraceCheckUtils]: 28: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,454 INFO L280 TraceCheckUtils]: 29: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,455 INFO L280 TraceCheckUtils]: 30: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,455 INFO L280 TraceCheckUtils]: 31: Hoare triple {1168#(<= 2 |fibonacci_#in~n|)} assume true; {1168#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,456 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1168#(<= 2 |fibonacci_#in~n|)} {1092#true} #38#return; {1160#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:15,457 INFO L280 TraceCheckUtils]: 33: Hoare triple {1160#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1160#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:15,457 INFO L263 TraceCheckUtils]: 34: Hoare triple {1160#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1092#true} is VALID [2020-07-10 18:36:15,457 INFO L280 TraceCheckUtils]: 35: Hoare triple {1092#true} ~n := #in~n; {1166#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,458 INFO L280 TraceCheckUtils]: 36: Hoare triple {1166#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,458 INFO L280 TraceCheckUtils]: 37: Hoare triple {1180#(<= |fibonacci_#in~n| 0)} #res := 0; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,459 INFO L280 TraceCheckUtils]: 38: Hoare triple {1180#(<= |fibonacci_#in~n| 0)} assume true; {1180#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:15,460 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1180#(<= |fibonacci_#in~n| 0)} {1160#(<= 3 fibonacci_~n)} #40#return; {1093#false} is VALID [2020-07-10 18:36:15,460 INFO L280 TraceCheckUtils]: 40: Hoare triple {1093#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1093#false} is VALID [2020-07-10 18:36:15,460 INFO L280 TraceCheckUtils]: 41: Hoare triple {1093#false} #res := #t~ret0 + #t~ret1; {1093#false} is VALID [2020-07-10 18:36:15,461 INFO L280 TraceCheckUtils]: 42: Hoare triple {1093#false} havoc #t~ret0; {1093#false} is VALID [2020-07-10 18:36:15,461 INFO L280 TraceCheckUtils]: 43: Hoare triple {1093#false} havoc #t~ret1; {1093#false} is VALID [2020-07-10 18:36:15,461 INFO L280 TraceCheckUtils]: 44: Hoare triple {1093#false} assume true; {1093#false} is VALID [2020-07-10 18:36:15,461 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1093#false} {1096#(<= 9 main_~x~0)} #46#return; {1093#false} is VALID [2020-07-10 18:36:15,462 INFO L280 TraceCheckUtils]: 46: Hoare triple {1093#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1093#false} is VALID [2020-07-10 18:36:15,462 INFO L280 TraceCheckUtils]: 47: Hoare triple {1093#false} ~result~0 := #t~ret2; {1093#false} is VALID [2020-07-10 18:36:15,462 INFO L280 TraceCheckUtils]: 48: Hoare triple {1093#false} havoc #t~ret2; {1093#false} is VALID [2020-07-10 18:36:15,462 INFO L280 TraceCheckUtils]: 49: Hoare triple {1093#false} assume !(34 == ~result~0); {1093#false} is VALID [2020-07-10 18:36:15,463 INFO L280 TraceCheckUtils]: 50: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2020-07-10 18:36:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-10 18:36:15,465 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:15,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336317004] [2020-07-10 18:36:15,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:15,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 18:36:15,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154835708] [2020-07-10 18:36:15,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-10 18:36:15,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:15,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 18:36:15,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 18:36:15,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 18:36:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 18:36:15,520 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-07-10 18:36:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:16,014 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-10 18:36:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 18:36:16,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-10 18:36:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 18:36:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2020-07-10 18:36:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 18:36:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2020-07-10 18:36:16,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 78 transitions. [2020-07-10 18:36:16,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:16,105 INFO L225 Difference]: With dead ends: 111 [2020-07-10 18:36:16,106 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 18:36:16,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-10 18:36:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 18:36:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-10 18:36:16,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:16,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 55 states. [2020-07-10 18:36:16,206 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 55 states. [2020-07-10 18:36:16,206 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 55 states. [2020-07-10 18:36:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:16,212 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2020-07-10 18:36:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2020-07-10 18:36:16,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:16,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:16,214 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 67 states. [2020-07-10 18:36:16,214 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 67 states. [2020-07-10 18:36:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:16,220 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2020-07-10 18:36:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2020-07-10 18:36:16,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:16,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:16,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:16,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 18:36:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-10 18:36:16,227 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-10 18:36:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:16,228 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-10 18:36:16,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 18:36:16,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 70 transitions. [2020-07-10 18:36:16,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-10 18:36:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:36:16,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:16,327 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:16,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 18:36:16,328 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1009539825, now seen corresponding path program 3 times [2020-07-10 18:36:16,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:16,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90691447] [2020-07-10 18:36:16,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,486 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1657#true} {1657#true} #42#return; {1657#true} is VALID [2020-07-10 18:36:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,567 INFO L280 TraceCheckUtils]: 3: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} #res := 1; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} assume true; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,569 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1746#(<= |fibonacci_#in~n| 1)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {1657#true} assume ~n < 1; {1657#true} is VALID [2020-07-10 18:36:16,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} #res := 0; {1657#true} is VALID [2020-07-10 18:36:16,575 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,576 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1657#true} {1740#(<= |fibonacci_#in~n| 2)} #40#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1657#true} is VALID [2020-07-10 18:36:16,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,579 INFO L280 TraceCheckUtils]: 6: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} #res := 1; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} assume true; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,582 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1746#(<= |fibonacci_#in~n| 1)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,583 INFO L263 TraceCheckUtils]: 11: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1657#true} is VALID [2020-07-10 18:36:16,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,583 INFO L280 TraceCheckUtils]: 13: Hoare triple {1657#true} assume ~n < 1; {1657#true} is VALID [2020-07-10 18:36:16,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {1657#true} #res := 0; {1657#true} is VALID [2020-07-10 18:36:16,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,585 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1657#true} {1740#(<= |fibonacci_#in~n| 2)} #40#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,585 INFO L280 TraceCheckUtils]: 17: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,586 INFO L280 TraceCheckUtils]: 18: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,588 INFO L280 TraceCheckUtils]: 21: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume true; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,590 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1740#(<= |fibonacci_#in~n| 2)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {1657#true} assume !(~n < 1); {1657#true} is VALID [2020-07-10 18:36:16,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {1657#true} assume 1 == ~n; {1657#true} is VALID [2020-07-10 18:36:16,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {1657#true} #res := 1; {1657#true} is VALID [2020-07-10 18:36:16,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,599 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1657#true} {1727#(<= |fibonacci_#in~n| 3)} #40#return; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,601 INFO L263 TraceCheckUtils]: 3: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1657#true} is VALID [2020-07-10 18:36:16,601 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,602 INFO L280 TraceCheckUtils]: 6: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,603 INFO L263 TraceCheckUtils]: 7: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1657#true} is VALID [2020-07-10 18:36:16,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,605 INFO L280 TraceCheckUtils]: 10: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} #res := 1; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} assume true; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,608 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1746#(<= |fibonacci_#in~n| 1)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,609 INFO L280 TraceCheckUtils]: 14: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,609 INFO L263 TraceCheckUtils]: 15: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1657#true} is VALID [2020-07-10 18:36:16,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {1657#true} assume ~n < 1; {1657#true} is VALID [2020-07-10 18:36:16,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {1657#true} #res := 0; {1657#true} is VALID [2020-07-10 18:36:16,610 INFO L280 TraceCheckUtils]: 19: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,611 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1657#true} {1740#(<= |fibonacci_#in~n| 2)} #40#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,613 INFO L280 TraceCheckUtils]: 22: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,614 INFO L280 TraceCheckUtils]: 23: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,615 INFO L280 TraceCheckUtils]: 25: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume true; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,616 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1740#(<= |fibonacci_#in~n| 2)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,617 INFO L280 TraceCheckUtils]: 27: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,617 INFO L263 TraceCheckUtils]: 28: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1657#true} is VALID [2020-07-10 18:36:16,617 INFO L280 TraceCheckUtils]: 29: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,618 INFO L280 TraceCheckUtils]: 30: Hoare triple {1657#true} assume !(~n < 1); {1657#true} is VALID [2020-07-10 18:36:16,618 INFO L280 TraceCheckUtils]: 31: Hoare triple {1657#true} assume 1 == ~n; {1657#true} is VALID [2020-07-10 18:36:16,618 INFO L280 TraceCheckUtils]: 32: Hoare triple {1657#true} #res := 1; {1657#true} is VALID [2020-07-10 18:36:16,619 INFO L280 TraceCheckUtils]: 33: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,620 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1657#true} {1727#(<= |fibonacci_#in~n| 3)} #40#return; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,620 INFO L280 TraceCheckUtils]: 35: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,621 INFO L280 TraceCheckUtils]: 36: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,622 INFO L280 TraceCheckUtils]: 37: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,622 INFO L280 TraceCheckUtils]: 38: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,623 INFO L280 TraceCheckUtils]: 39: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} assume true; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,624 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1727#(<= |fibonacci_#in~n| 3)} {1661#(<= 9 main_~x~0)} #46#return; {1658#false} is VALID [2020-07-10 18:36:16,627 INFO L263 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2020-07-10 18:36:16,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,627 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1657#true} {1657#true} #42#return; {1657#true} is VALID [2020-07-10 18:36:16,628 INFO L263 TraceCheckUtils]: 3: Hoare triple {1657#true} call #t~ret3 := main(); {1657#true} is VALID [2020-07-10 18:36:16,628 INFO L280 TraceCheckUtils]: 4: Hoare triple {1657#true} ~x~0 := 9; {1661#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:16,629 INFO L263 TraceCheckUtils]: 5: Hoare triple {1661#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {1657#true} is VALID [2020-07-10 18:36:16,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,630 INFO L280 TraceCheckUtils]: 7: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,631 INFO L263 TraceCheckUtils]: 9: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1657#true} is VALID [2020-07-10 18:36:16,632 INFO L280 TraceCheckUtils]: 10: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,633 INFO L280 TraceCheckUtils]: 11: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,633 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,634 INFO L263 TraceCheckUtils]: 13: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1657#true} is VALID [2020-07-10 18:36:16,634 INFO L280 TraceCheckUtils]: 14: Hoare triple {1657#true} ~n := #in~n; {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,635 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1703#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,635 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} #res := 1; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,637 INFO L280 TraceCheckUtils]: 18: Hoare triple {1746#(<= |fibonacci_#in~n| 1)} assume true; {1746#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,638 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1746#(<= |fibonacci_#in~n| 1)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,638 INFO L280 TraceCheckUtils]: 20: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,639 INFO L263 TraceCheckUtils]: 21: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1657#true} is VALID [2020-07-10 18:36:16,639 INFO L280 TraceCheckUtils]: 22: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,639 INFO L280 TraceCheckUtils]: 23: Hoare triple {1657#true} assume ~n < 1; {1657#true} is VALID [2020-07-10 18:36:16,639 INFO L280 TraceCheckUtils]: 24: Hoare triple {1657#true} #res := 0; {1657#true} is VALID [2020-07-10 18:36:16,640 INFO L280 TraceCheckUtils]: 25: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,641 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1657#true} {1740#(<= |fibonacci_#in~n| 2)} #40#return; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,642 INFO L280 TraceCheckUtils]: 27: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,642 INFO L280 TraceCheckUtils]: 28: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,643 INFO L280 TraceCheckUtils]: 29: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,644 INFO L280 TraceCheckUtils]: 30: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,645 INFO L280 TraceCheckUtils]: 31: Hoare triple {1740#(<= |fibonacci_#in~n| 2)} assume true; {1740#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,646 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1740#(<= |fibonacci_#in~n| 2)} {1703#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,647 INFO L280 TraceCheckUtils]: 33: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,647 INFO L263 TraceCheckUtils]: 34: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1657#true} is VALID [2020-07-10 18:36:16,647 INFO L280 TraceCheckUtils]: 35: Hoare triple {1657#true} ~n := #in~n; {1657#true} is VALID [2020-07-10 18:36:16,648 INFO L280 TraceCheckUtils]: 36: Hoare triple {1657#true} assume !(~n < 1); {1657#true} is VALID [2020-07-10 18:36:16,648 INFO L280 TraceCheckUtils]: 37: Hoare triple {1657#true} assume 1 == ~n; {1657#true} is VALID [2020-07-10 18:36:16,648 INFO L280 TraceCheckUtils]: 38: Hoare triple {1657#true} #res := 1; {1657#true} is VALID [2020-07-10 18:36:16,649 INFO L280 TraceCheckUtils]: 39: Hoare triple {1657#true} assume true; {1657#true} is VALID [2020-07-10 18:36:16,650 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1657#true} {1727#(<= |fibonacci_#in~n| 3)} #40#return; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,650 INFO L280 TraceCheckUtils]: 41: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,651 INFO L280 TraceCheckUtils]: 42: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,652 INFO L280 TraceCheckUtils]: 43: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,652 INFO L280 TraceCheckUtils]: 44: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,653 INFO L280 TraceCheckUtils]: 45: Hoare triple {1727#(<= |fibonacci_#in~n| 3)} assume true; {1727#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:16,654 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1727#(<= |fibonacci_#in~n| 3)} {1661#(<= 9 main_~x~0)} #46#return; {1658#false} is VALID [2020-07-10 18:36:16,654 INFO L280 TraceCheckUtils]: 47: Hoare triple {1658#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1658#false} is VALID [2020-07-10 18:36:16,654 INFO L280 TraceCheckUtils]: 48: Hoare triple {1658#false} ~result~0 := #t~ret2; {1658#false} is VALID [2020-07-10 18:36:16,654 INFO L280 TraceCheckUtils]: 49: Hoare triple {1658#false} havoc #t~ret2; {1658#false} is VALID [2020-07-10 18:36:16,655 INFO L280 TraceCheckUtils]: 50: Hoare triple {1658#false} assume !(34 == ~result~0); {1658#false} is VALID [2020-07-10 18:36:16,655 INFO L280 TraceCheckUtils]: 51: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2020-07-10 18:36:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 18:36:16,658 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:16,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90691447] [2020-07-10 18:36:16,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:16,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 18:36:16,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027736660] [2020-07-10 18:36:16,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-07-10 18:36:16,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:16,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 18:36:16,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:16,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 18:36:16,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 18:36:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:36:16,711 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-07-10 18:36:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:17,202 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-10 18:36:17,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 18:36:17,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-07-10 18:36:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2020-07-10 18:36:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2020-07-10 18:36:17,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2020-07-10 18:36:17,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:17,284 INFO L225 Difference]: With dead ends: 89 [2020-07-10 18:36:17,284 INFO L226 Difference]: Without dead ends: 83 [2020-07-10 18:36:17,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-10 18:36:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-10 18:36:17,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:17,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 77 states. [2020-07-10 18:36:17,417 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 77 states. [2020-07-10 18:36:17,417 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 77 states. [2020-07-10 18:36:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:17,423 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2020-07-10 18:36:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2020-07-10 18:36:17,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:17,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:17,424 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 83 states. [2020-07-10 18:36:17,424 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 83 states. [2020-07-10 18:36:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:17,430 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2020-07-10 18:36:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2020-07-10 18:36:17,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:17,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:17,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:17,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 18:36:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-10 18:36:17,436 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-10 18:36:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:17,437 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-10 18:36:17,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 18:36:17,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 103 transitions. [2020-07-10 18:36:17,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-10 18:36:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-10 18:36:17,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:17,573 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:17,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 18:36:17,573 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:17,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:17,574 INFO L82 PathProgramCache]: Analyzing trace with hash -858055544, now seen corresponding path program 4 times [2020-07-10 18:36:17,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:17,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589240365] [2020-07-10 18:36:17,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:17,740 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2256#true} {2256#true} #42#return; {2256#true} is VALID [2020-07-10 18:36:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,866 INFO L280 TraceCheckUtils]: 3: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} #res := 1; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} assume true; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,868 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2517#(<= |fibonacci_#in~n| 1)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:17,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:17,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:17,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:17,875 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2256#true} {2511#(<= |fibonacci_#in~n| 2)} #40#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,877 INFO L263 TraceCheckUtils]: 3: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:17,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,879 INFO L280 TraceCheckUtils]: 6: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} #res := 1; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} assume true; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,881 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2517#(<= |fibonacci_#in~n| 1)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,883 INFO L263 TraceCheckUtils]: 11: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:17,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:17,883 INFO L280 TraceCheckUtils]: 13: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:17,884 INFO L280 TraceCheckUtils]: 14: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:17,884 INFO L280 TraceCheckUtils]: 15: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:17,885 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2256#true} {2511#(<= |fibonacci_#in~n| 2)} #40#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,886 INFO L280 TraceCheckUtils]: 17: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,886 INFO L280 TraceCheckUtils]: 18: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,887 INFO L280 TraceCheckUtils]: 19: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,888 INFO L280 TraceCheckUtils]: 20: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,889 INFO L280 TraceCheckUtils]: 21: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume true; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,890 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2511#(<= |fibonacci_#in~n| 2)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:17,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:17,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:17,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:17,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:17,898 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2256#true} {2498#(<= |fibonacci_#in~n| 3)} #40#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,901 INFO L263 TraceCheckUtils]: 3: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:17,901 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,902 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,903 INFO L263 TraceCheckUtils]: 7: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:17,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,905 INFO L280 TraceCheckUtils]: 10: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} #res := 1; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} assume true; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:17,909 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2517#(<= |fibonacci_#in~n| 1)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,910 INFO L263 TraceCheckUtils]: 15: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:17,910 INFO L280 TraceCheckUtils]: 16: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:17,910 INFO L280 TraceCheckUtils]: 17: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:17,911 INFO L280 TraceCheckUtils]: 18: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:17,911 INFO L280 TraceCheckUtils]: 19: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:17,912 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2256#true} {2511#(<= |fibonacci_#in~n| 2)} #40#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,912 INFO L280 TraceCheckUtils]: 21: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,924 INFO L280 TraceCheckUtils]: 22: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,931 INFO L280 TraceCheckUtils]: 23: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,931 INFO L280 TraceCheckUtils]: 24: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,932 INFO L280 TraceCheckUtils]: 25: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume true; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:17,934 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2511#(<= |fibonacci_#in~n| 2)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,934 INFO L280 TraceCheckUtils]: 27: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,935 INFO L263 TraceCheckUtils]: 28: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:17,935 INFO L280 TraceCheckUtils]: 29: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:17,935 INFO L280 TraceCheckUtils]: 30: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:17,936 INFO L280 TraceCheckUtils]: 31: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:17,936 INFO L280 TraceCheckUtils]: 32: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:17,936 INFO L280 TraceCheckUtils]: 33: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:17,937 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2256#true} {2498#(<= |fibonacci_#in~n| 3)} #40#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,938 INFO L280 TraceCheckUtils]: 35: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,938 INFO L280 TraceCheckUtils]: 36: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,939 INFO L280 TraceCheckUtils]: 37: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,939 INFO L280 TraceCheckUtils]: 38: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,940 INFO L280 TraceCheckUtils]: 39: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume true; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:17,941 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2498#(<= |fibonacci_#in~n| 3)} {2256#true} #38#return; {2414#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,073 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,074 INFO L280 TraceCheckUtils]: 3: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,074 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,075 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #38#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,081 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #40#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,084 INFO L263 TraceCheckUtils]: 3: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,084 INFO L280 TraceCheckUtils]: 5: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,085 INFO L280 TraceCheckUtils]: 7: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,086 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #38#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,086 INFO L280 TraceCheckUtils]: 10: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,087 INFO L263 TraceCheckUtils]: 11: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,087 INFO L280 TraceCheckUtils]: 12: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,087 INFO L280 TraceCheckUtils]: 13: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,088 INFO L280 TraceCheckUtils]: 15: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,089 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #40#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,089 INFO L280 TraceCheckUtils]: 17: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,090 INFO L280 TraceCheckUtils]: 18: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,091 INFO L280 TraceCheckUtils]: 20: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,091 INFO L280 TraceCheckUtils]: 21: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume true; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,092 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2596#(<= 1 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,100 INFO L280 TraceCheckUtils]: 3: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,100 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,101 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2256#true} {2589#(<= 2 |fibonacci_#in~n|)} #40#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,105 INFO L263 TraceCheckUtils]: 3: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,106 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,107 INFO L280 TraceCheckUtils]: 6: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,107 INFO L263 TraceCheckUtils]: 7: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,107 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,107 INFO L280 TraceCheckUtils]: 9: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,109 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #38#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,110 INFO L280 TraceCheckUtils]: 14: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,110 INFO L263 TraceCheckUtils]: 15: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,110 INFO L280 TraceCheckUtils]: 16: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,111 INFO L280 TraceCheckUtils]: 18: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,111 INFO L280 TraceCheckUtils]: 19: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,112 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #40#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,112 INFO L280 TraceCheckUtils]: 21: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,113 INFO L280 TraceCheckUtils]: 22: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,113 INFO L280 TraceCheckUtils]: 23: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,114 INFO L280 TraceCheckUtils]: 24: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,114 INFO L280 TraceCheckUtils]: 25: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume true; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,115 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2596#(<= 1 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,116 INFO L280 TraceCheckUtils]: 27: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,116 INFO L263 TraceCheckUtils]: 28: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,116 INFO L280 TraceCheckUtils]: 29: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,117 INFO L280 TraceCheckUtils]: 30: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,117 INFO L280 TraceCheckUtils]: 31: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,117 INFO L280 TraceCheckUtils]: 32: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,117 INFO L280 TraceCheckUtils]: 33: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,118 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2256#true} {2589#(<= 2 |fibonacci_#in~n|)} #40#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,119 INFO L280 TraceCheckUtils]: 35: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,119 INFO L280 TraceCheckUtils]: 36: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,120 INFO L280 TraceCheckUtils]: 37: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,120 INFO L280 TraceCheckUtils]: 38: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,121 INFO L280 TraceCheckUtils]: 39: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume true; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,122 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2589#(<= 2 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:18,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,131 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,131 INFO L280 TraceCheckUtils]: 3: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,131 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,132 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2256#true} {2559#(<= 3 |fibonacci_#in~n|)} #40#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,134 INFO L263 TraceCheckUtils]: 3: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,135 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,136 INFO L263 TraceCheckUtils]: 7: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,137 INFO L280 TraceCheckUtils]: 9: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,137 INFO L280 TraceCheckUtils]: 10: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,138 INFO L263 TraceCheckUtils]: 11: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,138 INFO L280 TraceCheckUtils]: 12: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,138 INFO L280 TraceCheckUtils]: 13: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,138 INFO L280 TraceCheckUtils]: 14: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,139 INFO L280 TraceCheckUtils]: 16: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,140 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #38#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,140 INFO L280 TraceCheckUtils]: 18: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,140 INFO L263 TraceCheckUtils]: 19: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,140 INFO L280 TraceCheckUtils]: 20: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,141 INFO L280 TraceCheckUtils]: 21: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,141 INFO L280 TraceCheckUtils]: 22: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,141 INFO L280 TraceCheckUtils]: 23: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,142 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #40#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,143 INFO L280 TraceCheckUtils]: 25: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,143 INFO L280 TraceCheckUtils]: 26: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,144 INFO L280 TraceCheckUtils]: 27: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,144 INFO L280 TraceCheckUtils]: 28: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,145 INFO L280 TraceCheckUtils]: 29: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume true; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,146 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2596#(<= 1 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,146 INFO L280 TraceCheckUtils]: 31: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,147 INFO L263 TraceCheckUtils]: 32: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,147 INFO L280 TraceCheckUtils]: 33: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,147 INFO L280 TraceCheckUtils]: 34: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,147 INFO L280 TraceCheckUtils]: 35: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,148 INFO L280 TraceCheckUtils]: 36: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,148 INFO L280 TraceCheckUtils]: 37: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,149 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2256#true} {2589#(<= 2 |fibonacci_#in~n|)} #40#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,149 INFO L280 TraceCheckUtils]: 39: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,150 INFO L280 TraceCheckUtils]: 40: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,150 INFO L280 TraceCheckUtils]: 41: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,151 INFO L280 TraceCheckUtils]: 42: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,151 INFO L280 TraceCheckUtils]: 43: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume true; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,152 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2589#(<= 2 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,153 INFO L280 TraceCheckUtils]: 45: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,153 INFO L263 TraceCheckUtils]: 46: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,153 INFO L280 TraceCheckUtils]: 47: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,153 INFO L280 TraceCheckUtils]: 48: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,153 INFO L280 TraceCheckUtils]: 49: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,154 INFO L280 TraceCheckUtils]: 50: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,154 INFO L280 TraceCheckUtils]: 51: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,156 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2256#true} {2559#(<= 3 |fibonacci_#in~n|)} #40#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,156 INFO L280 TraceCheckUtils]: 53: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,157 INFO L280 TraceCheckUtils]: 54: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,157 INFO L280 TraceCheckUtils]: 55: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,158 INFO L280 TraceCheckUtils]: 56: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,158 INFO L280 TraceCheckUtils]: 57: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume true; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,159 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2559#(<= 3 |fibonacci_#in~n|)} {2414#(<= fibonacci_~n 4)} #40#return; {2257#false} is VALID [2020-07-10 18:36:18,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {2256#true} assume !(1 == ~n); {2256#true} is VALID [2020-07-10 18:36:18,165 INFO L263 TraceCheckUtils]: 3: Hoare triple {2256#true} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,167 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,168 INFO L263 TraceCheckUtils]: 7: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,168 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,169 INFO L263 TraceCheckUtils]: 11: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,170 INFO L280 TraceCheckUtils]: 13: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,171 INFO L280 TraceCheckUtils]: 14: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:18,171 INFO L280 TraceCheckUtils]: 15: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} #res := 1; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:18,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} assume true; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:18,173 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2517#(<= |fibonacci_#in~n| 1)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,174 INFO L263 TraceCheckUtils]: 19: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,175 INFO L280 TraceCheckUtils]: 21: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,176 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2256#true} {2511#(<= |fibonacci_#in~n| 2)} #40#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,176 INFO L280 TraceCheckUtils]: 25: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,177 INFO L280 TraceCheckUtils]: 26: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,177 INFO L280 TraceCheckUtils]: 27: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,178 INFO L280 TraceCheckUtils]: 28: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,178 INFO L280 TraceCheckUtils]: 29: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume true; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,179 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2511#(<= |fibonacci_#in~n| 2)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,180 INFO L280 TraceCheckUtils]: 31: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,180 INFO L263 TraceCheckUtils]: 32: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,180 INFO L280 TraceCheckUtils]: 33: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,181 INFO L280 TraceCheckUtils]: 34: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,181 INFO L280 TraceCheckUtils]: 35: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,181 INFO L280 TraceCheckUtils]: 36: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,181 INFO L280 TraceCheckUtils]: 37: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,182 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2256#true} {2498#(<= |fibonacci_#in~n| 3)} #40#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,182 INFO L280 TraceCheckUtils]: 39: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,183 INFO L280 TraceCheckUtils]: 40: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,183 INFO L280 TraceCheckUtils]: 41: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,184 INFO L280 TraceCheckUtils]: 42: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,185 INFO L280 TraceCheckUtils]: 43: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume true; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,186 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2498#(<= |fibonacci_#in~n| 3)} {2256#true} #38#return; {2414#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:18,186 INFO L280 TraceCheckUtils]: 45: Hoare triple {2414#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2414#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:18,187 INFO L263 TraceCheckUtils]: 46: Hoare triple {2414#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,187 INFO L280 TraceCheckUtils]: 47: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,188 INFO L280 TraceCheckUtils]: 48: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,188 INFO L280 TraceCheckUtils]: 49: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,189 INFO L263 TraceCheckUtils]: 50: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,189 INFO L280 TraceCheckUtils]: 51: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,190 INFO L280 TraceCheckUtils]: 52: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,190 INFO L280 TraceCheckUtils]: 53: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,190 INFO L263 TraceCheckUtils]: 54: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,191 INFO L280 TraceCheckUtils]: 55: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,191 INFO L280 TraceCheckUtils]: 56: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,192 INFO L280 TraceCheckUtils]: 57: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,192 INFO L263 TraceCheckUtils]: 58: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,192 INFO L280 TraceCheckUtils]: 59: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,193 INFO L280 TraceCheckUtils]: 60: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,193 INFO L280 TraceCheckUtils]: 61: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,193 INFO L280 TraceCheckUtils]: 62: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,193 INFO L280 TraceCheckUtils]: 63: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,194 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #38#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,195 INFO L280 TraceCheckUtils]: 65: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,195 INFO L263 TraceCheckUtils]: 66: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,195 INFO L280 TraceCheckUtils]: 67: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,195 INFO L280 TraceCheckUtils]: 68: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,195 INFO L280 TraceCheckUtils]: 69: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,196 INFO L280 TraceCheckUtils]: 70: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,196 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #40#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,197 INFO L280 TraceCheckUtils]: 72: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,197 INFO L280 TraceCheckUtils]: 73: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,198 INFO L280 TraceCheckUtils]: 74: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,198 INFO L280 TraceCheckUtils]: 75: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,199 INFO L280 TraceCheckUtils]: 76: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume true; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,200 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2596#(<= 1 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,200 INFO L280 TraceCheckUtils]: 78: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,201 INFO L263 TraceCheckUtils]: 79: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,201 INFO L280 TraceCheckUtils]: 80: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,201 INFO L280 TraceCheckUtils]: 81: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,201 INFO L280 TraceCheckUtils]: 82: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,201 INFO L280 TraceCheckUtils]: 83: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,202 INFO L280 TraceCheckUtils]: 84: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,202 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2256#true} {2589#(<= 2 |fibonacci_#in~n|)} #40#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,203 INFO L280 TraceCheckUtils]: 86: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,203 INFO L280 TraceCheckUtils]: 87: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,204 INFO L280 TraceCheckUtils]: 88: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,204 INFO L280 TraceCheckUtils]: 89: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,205 INFO L280 TraceCheckUtils]: 90: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume true; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,206 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2589#(<= 2 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,206 INFO L280 TraceCheckUtils]: 92: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,207 INFO L263 TraceCheckUtils]: 93: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,207 INFO L280 TraceCheckUtils]: 94: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,207 INFO L280 TraceCheckUtils]: 95: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,207 INFO L280 TraceCheckUtils]: 96: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,207 INFO L280 TraceCheckUtils]: 97: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,208 INFO L280 TraceCheckUtils]: 98: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,208 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2256#true} {2559#(<= 3 |fibonacci_#in~n|)} #40#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,209 INFO L280 TraceCheckUtils]: 100: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,210 INFO L280 TraceCheckUtils]: 101: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,210 INFO L280 TraceCheckUtils]: 102: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,211 INFO L280 TraceCheckUtils]: 103: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,211 INFO L280 TraceCheckUtils]: 104: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume true; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,212 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2559#(<= 3 |fibonacci_#in~n|)} {2414#(<= fibonacci_~n 4)} #40#return; {2257#false} is VALID [2020-07-10 18:36:18,213 INFO L280 TraceCheckUtils]: 106: Hoare triple {2257#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2257#false} is VALID [2020-07-10 18:36:18,213 INFO L280 TraceCheckUtils]: 107: Hoare triple {2257#false} #res := #t~ret0 + #t~ret1; {2257#false} is VALID [2020-07-10 18:36:18,213 INFO L280 TraceCheckUtils]: 108: Hoare triple {2257#false} havoc #t~ret0; {2257#false} is VALID [2020-07-10 18:36:18,213 INFO L280 TraceCheckUtils]: 109: Hoare triple {2257#false} havoc #t~ret1; {2257#false} is VALID [2020-07-10 18:36:18,213 INFO L280 TraceCheckUtils]: 110: Hoare triple {2257#false} assume true; {2257#false} is VALID [2020-07-10 18:36:18,213 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2257#false} {2260#(<= 9 main_~x~0)} #46#return; {2257#false} is VALID [2020-07-10 18:36:18,229 INFO L263 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2020-07-10 18:36:18,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,230 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2256#true} {2256#true} #42#return; {2256#true} is VALID [2020-07-10 18:36:18,230 INFO L263 TraceCheckUtils]: 3: Hoare triple {2256#true} call #t~ret3 := main(); {2256#true} is VALID [2020-07-10 18:36:18,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#true} ~x~0 := 9; {2260#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:18,235 INFO L263 TraceCheckUtils]: 5: Hoare triple {2260#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {2256#true} is VALID [2020-07-10 18:36:18,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(1 == ~n); {2256#true} is VALID [2020-07-10 18:36:18,236 INFO L263 TraceCheckUtils]: 9: Hoare triple {2256#true} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,237 INFO L280 TraceCheckUtils]: 11: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,237 INFO L280 TraceCheckUtils]: 12: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,237 INFO L263 TraceCheckUtils]: 13: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,238 INFO L280 TraceCheckUtils]: 14: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,238 INFO L280 TraceCheckUtils]: 15: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,239 INFO L280 TraceCheckUtils]: 16: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,239 INFO L263 TraceCheckUtils]: 17: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,240 INFO L280 TraceCheckUtils]: 18: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,240 INFO L280 TraceCheckUtils]: 19: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,241 INFO L280 TraceCheckUtils]: 20: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:18,242 INFO L280 TraceCheckUtils]: 21: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} #res := 1; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:18,242 INFO L280 TraceCheckUtils]: 22: Hoare triple {2517#(<= |fibonacci_#in~n| 1)} assume true; {2517#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:18,244 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2517#(<= |fibonacci_#in~n| 1)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,244 INFO L280 TraceCheckUtils]: 24: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,244 INFO L263 TraceCheckUtils]: 25: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,245 INFO L280 TraceCheckUtils]: 26: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,245 INFO L280 TraceCheckUtils]: 27: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,245 INFO L280 TraceCheckUtils]: 28: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,245 INFO L280 TraceCheckUtils]: 29: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,247 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2256#true} {2511#(<= |fibonacci_#in~n| 2)} #40#return; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,248 INFO L280 TraceCheckUtils]: 31: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,248 INFO L280 TraceCheckUtils]: 32: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,249 INFO L280 TraceCheckUtils]: 33: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,249 INFO L280 TraceCheckUtils]: 34: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,250 INFO L280 TraceCheckUtils]: 35: Hoare triple {2511#(<= |fibonacci_#in~n| 2)} assume true; {2511#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:18,251 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2511#(<= |fibonacci_#in~n| 2)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,252 INFO L280 TraceCheckUtils]: 37: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,252 INFO L263 TraceCheckUtils]: 38: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,252 INFO L280 TraceCheckUtils]: 39: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,252 INFO L280 TraceCheckUtils]: 40: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,252 INFO L280 TraceCheckUtils]: 41: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,253 INFO L280 TraceCheckUtils]: 42: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,253 INFO L280 TraceCheckUtils]: 43: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,254 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2256#true} {2498#(<= |fibonacci_#in~n| 3)} #40#return; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,254 INFO L280 TraceCheckUtils]: 45: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,254 INFO L280 TraceCheckUtils]: 46: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,255 INFO L280 TraceCheckUtils]: 47: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,256 INFO L280 TraceCheckUtils]: 48: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,256 INFO L280 TraceCheckUtils]: 49: Hoare triple {2498#(<= |fibonacci_#in~n| 3)} assume true; {2498#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:18,257 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2498#(<= |fibonacci_#in~n| 3)} {2256#true} #38#return; {2414#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:18,258 INFO L280 TraceCheckUtils]: 51: Hoare triple {2414#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2414#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:18,258 INFO L263 TraceCheckUtils]: 52: Hoare triple {2414#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,259 INFO L280 TraceCheckUtils]: 53: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,259 INFO L280 TraceCheckUtils]: 54: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,260 INFO L280 TraceCheckUtils]: 55: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,260 INFO L263 TraceCheckUtils]: 56: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,261 INFO L280 TraceCheckUtils]: 57: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,261 INFO L280 TraceCheckUtils]: 58: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,262 INFO L280 TraceCheckUtils]: 59: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,262 INFO L263 TraceCheckUtils]: 60: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,263 INFO L280 TraceCheckUtils]: 61: Hoare triple {2256#true} ~n := #in~n; {2474#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,263 INFO L280 TraceCheckUtils]: 62: Hoare triple {2474#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,264 INFO L280 TraceCheckUtils]: 63: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,264 INFO L263 TraceCheckUtils]: 64: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2256#true} is VALID [2020-07-10 18:36:18,264 INFO L280 TraceCheckUtils]: 65: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,265 INFO L280 TraceCheckUtils]: 66: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,265 INFO L280 TraceCheckUtils]: 67: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,265 INFO L280 TraceCheckUtils]: 68: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,265 INFO L280 TraceCheckUtils]: 69: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,278 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #38#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,279 INFO L280 TraceCheckUtils]: 71: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,280 INFO L263 TraceCheckUtils]: 72: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,280 INFO L280 TraceCheckUtils]: 73: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,280 INFO L280 TraceCheckUtils]: 74: Hoare triple {2256#true} assume ~n < 1; {2256#true} is VALID [2020-07-10 18:36:18,280 INFO L280 TraceCheckUtils]: 75: Hoare triple {2256#true} #res := 0; {2256#true} is VALID [2020-07-10 18:36:18,280 INFO L280 TraceCheckUtils]: 76: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,283 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2256#true} {2596#(<= 1 |fibonacci_#in~n|)} #40#return; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,283 INFO L280 TraceCheckUtils]: 78: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,284 INFO L280 TraceCheckUtils]: 79: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,284 INFO L280 TraceCheckUtils]: 80: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,285 INFO L280 TraceCheckUtils]: 81: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,285 INFO L280 TraceCheckUtils]: 82: Hoare triple {2596#(<= 1 |fibonacci_#in~n|)} assume true; {2596#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,287 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {2596#(<= 1 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,287 INFO L280 TraceCheckUtils]: 84: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,287 INFO L263 TraceCheckUtils]: 85: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,288 INFO L280 TraceCheckUtils]: 86: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,288 INFO L280 TraceCheckUtils]: 87: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,288 INFO L280 TraceCheckUtils]: 88: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,288 INFO L280 TraceCheckUtils]: 89: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,288 INFO L280 TraceCheckUtils]: 90: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,289 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2256#true} {2589#(<= 2 |fibonacci_#in~n|)} #40#return; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,290 INFO L280 TraceCheckUtils]: 92: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,290 INFO L280 TraceCheckUtils]: 93: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,291 INFO L280 TraceCheckUtils]: 94: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,291 INFO L280 TraceCheckUtils]: 95: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,292 INFO L280 TraceCheckUtils]: 96: Hoare triple {2589#(<= 2 |fibonacci_#in~n|)} assume true; {2589#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,293 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {2589#(<= 2 |fibonacci_#in~n|)} {2474#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,293 INFO L280 TraceCheckUtils]: 98: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,293 INFO L263 TraceCheckUtils]: 99: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2256#true} is VALID [2020-07-10 18:36:18,294 INFO L280 TraceCheckUtils]: 100: Hoare triple {2256#true} ~n := #in~n; {2256#true} is VALID [2020-07-10 18:36:18,294 INFO L280 TraceCheckUtils]: 101: Hoare triple {2256#true} assume !(~n < 1); {2256#true} is VALID [2020-07-10 18:36:18,294 INFO L280 TraceCheckUtils]: 102: Hoare triple {2256#true} assume 1 == ~n; {2256#true} is VALID [2020-07-10 18:36:18,294 INFO L280 TraceCheckUtils]: 103: Hoare triple {2256#true} #res := 1; {2256#true} is VALID [2020-07-10 18:36:18,294 INFO L280 TraceCheckUtils]: 104: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-10 18:36:18,295 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2256#true} {2559#(<= 3 |fibonacci_#in~n|)} #40#return; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,296 INFO L280 TraceCheckUtils]: 106: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,296 INFO L280 TraceCheckUtils]: 107: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,297 INFO L280 TraceCheckUtils]: 108: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,297 INFO L280 TraceCheckUtils]: 109: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,298 INFO L280 TraceCheckUtils]: 110: Hoare triple {2559#(<= 3 |fibonacci_#in~n|)} assume true; {2559#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,299 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2559#(<= 3 |fibonacci_#in~n|)} {2414#(<= fibonacci_~n 4)} #40#return; {2257#false} is VALID [2020-07-10 18:36:18,299 INFO L280 TraceCheckUtils]: 112: Hoare triple {2257#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2257#false} is VALID [2020-07-10 18:36:18,299 INFO L280 TraceCheckUtils]: 113: Hoare triple {2257#false} #res := #t~ret0 + #t~ret1; {2257#false} is VALID [2020-07-10 18:36:18,299 INFO L280 TraceCheckUtils]: 114: Hoare triple {2257#false} havoc #t~ret0; {2257#false} is VALID [2020-07-10 18:36:18,299 INFO L280 TraceCheckUtils]: 115: Hoare triple {2257#false} havoc #t~ret1; {2257#false} is VALID [2020-07-10 18:36:18,300 INFO L280 TraceCheckUtils]: 116: Hoare triple {2257#false} assume true; {2257#false} is VALID [2020-07-10 18:36:18,300 INFO L275 TraceCheckUtils]: 117: Hoare quadruple {2257#false} {2260#(<= 9 main_~x~0)} #46#return; {2257#false} is VALID [2020-07-10 18:36:18,300 INFO L280 TraceCheckUtils]: 118: Hoare triple {2257#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2257#false} is VALID [2020-07-10 18:36:18,300 INFO L280 TraceCheckUtils]: 119: Hoare triple {2257#false} ~result~0 := #t~ret2; {2257#false} is VALID [2020-07-10 18:36:18,300 INFO L280 TraceCheckUtils]: 120: Hoare triple {2257#false} havoc #t~ret2; {2257#false} is VALID [2020-07-10 18:36:18,300 INFO L280 TraceCheckUtils]: 121: Hoare triple {2257#false} assume !(34 == ~result~0); {2257#false} is VALID [2020-07-10 18:36:18,301 INFO L280 TraceCheckUtils]: 122: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2020-07-10 18:36:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-07-10 18:36:18,311 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:18,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589240365] [2020-07-10 18:36:18,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:18,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 18:36:18,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758400605] [2020-07-10 18:36:18,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-07-10 18:36:18,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:18,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 18:36:18,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 18:36:18,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 18:36:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 18:36:18,415 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-07-10 18:36:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:19,288 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-10 18:36:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 18:36:19,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-07-10 18:36:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 18:36:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 124 transitions. [2020-07-10 18:36:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 18:36:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 124 transitions. [2020-07-10 18:36:19,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 124 transitions. [2020-07-10 18:36:19,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:19,477 INFO L225 Difference]: With dead ends: 142 [2020-07-10 18:36:19,477 INFO L226 Difference]: Without dead ends: 73 [2020-07-10 18:36:19,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-07-10 18:36:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-10 18:36:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-10 18:36:19,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:19,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 70 states. [2020-07-10 18:36:19,618 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 70 states. [2020-07-10 18:36:19,618 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 70 states. [2020-07-10 18:36:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:19,622 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2020-07-10 18:36:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2020-07-10 18:36:19,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:19,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:19,623 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 73 states. [2020-07-10 18:36:19,623 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 73 states. [2020-07-10 18:36:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:19,627 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2020-07-10 18:36:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2020-07-10 18:36:19,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:19,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:19,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:19,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 18:36:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-07-10 18:36:19,631 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-07-10 18:36:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:19,632 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-07-10 18:36:19,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 18:36:19,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 83 transitions. [2020-07-10 18:36:19,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-10 18:36:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-10 18:36:19,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:19,742 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:19,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 18:36:19,742 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash -145654990, now seen corresponding path program 5 times [2020-07-10 18:36:19,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:19,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399793767] [2020-07-10 18:36:19,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:19,934 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3206#true} {3206#true} #42#return; {3206#true} is VALID [2020-07-10 18:36:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,130 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,135 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,136 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3206#true} {3666#(<= |fibonacci_#in~n| 2)} #40#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,138 INFO L263 TraceCheckUtils]: 3: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,142 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,142 INFO L263 TraceCheckUtils]: 11: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,143 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,143 INFO L280 TraceCheckUtils]: 15: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,144 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3206#true} {3666#(<= |fibonacci_#in~n| 2)} #40#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,144 INFO L280 TraceCheckUtils]: 17: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,145 INFO L280 TraceCheckUtils]: 18: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,145 INFO L280 TraceCheckUtils]: 19: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,145 INFO L280 TraceCheckUtils]: 20: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,146 INFO L280 TraceCheckUtils]: 21: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume true; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,147 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3666#(<= |fibonacci_#in~n| 2)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,156 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,157 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,157 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3206#true} {3653#(<= |fibonacci_#in~n| 3)} #40#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,159 INFO L263 TraceCheckUtils]: 3: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,161 INFO L263 TraceCheckUtils]: 7: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,163 INFO L280 TraceCheckUtils]: 12: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,164 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,164 INFO L263 TraceCheckUtils]: 15: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,164 INFO L280 TraceCheckUtils]: 16: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,164 INFO L280 TraceCheckUtils]: 17: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,165 INFO L280 TraceCheckUtils]: 18: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,165 INFO L280 TraceCheckUtils]: 19: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,165 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3206#true} {3666#(<= |fibonacci_#in~n| 2)} #40#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,166 INFO L280 TraceCheckUtils]: 21: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,166 INFO L280 TraceCheckUtils]: 22: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,167 INFO L280 TraceCheckUtils]: 23: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,168 INFO L280 TraceCheckUtils]: 24: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,168 INFO L280 TraceCheckUtils]: 25: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume true; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,169 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3666#(<= |fibonacci_#in~n| 2)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,169 INFO L280 TraceCheckUtils]: 27: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,169 INFO L263 TraceCheckUtils]: 28: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,169 INFO L280 TraceCheckUtils]: 29: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,170 INFO L280 TraceCheckUtils]: 30: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,170 INFO L280 TraceCheckUtils]: 31: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,170 INFO L280 TraceCheckUtils]: 32: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,170 INFO L280 TraceCheckUtils]: 33: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,171 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3206#true} {3653#(<= |fibonacci_#in~n| 3)} #40#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,171 INFO L280 TraceCheckUtils]: 35: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,172 INFO L280 TraceCheckUtils]: 36: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,173 INFO L280 TraceCheckUtils]: 37: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,173 INFO L280 TraceCheckUtils]: 38: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,174 INFO L280 TraceCheckUtils]: 39: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume true; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,175 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3653#(<= |fibonacci_#in~n| 3)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,193 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,193 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,198 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,199 INFO L263 TraceCheckUtils]: 3: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,199 INFO L280 TraceCheckUtils]: 7: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,200 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,200 INFO L263 TraceCheckUtils]: 11: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,201 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,202 INFO L280 TraceCheckUtils]: 17: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,202 INFO L280 TraceCheckUtils]: 19: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,202 INFO L280 TraceCheckUtils]: 20: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,204 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3206#true} {3606#(<= |fibonacci_#in~n| 4)} #40#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,206 INFO L263 TraceCheckUtils]: 3: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,206 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,207 INFO L280 TraceCheckUtils]: 6: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,208 INFO L263 TraceCheckUtils]: 7: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,210 INFO L263 TraceCheckUtils]: 11: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,212 INFO L280 TraceCheckUtils]: 15: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,212 INFO L280 TraceCheckUtils]: 16: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,214 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,214 INFO L280 TraceCheckUtils]: 18: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,215 INFO L263 TraceCheckUtils]: 19: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,215 INFO L280 TraceCheckUtils]: 21: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,215 INFO L280 TraceCheckUtils]: 22: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,215 INFO L280 TraceCheckUtils]: 23: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,216 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3206#true} {3666#(<= |fibonacci_#in~n| 2)} #40#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,217 INFO L280 TraceCheckUtils]: 25: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,217 INFO L280 TraceCheckUtils]: 26: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,218 INFO L280 TraceCheckUtils]: 27: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,219 INFO L280 TraceCheckUtils]: 28: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,219 INFO L280 TraceCheckUtils]: 29: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume true; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,220 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3666#(<= |fibonacci_#in~n| 2)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,221 INFO L280 TraceCheckUtils]: 31: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,221 INFO L263 TraceCheckUtils]: 32: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,221 INFO L280 TraceCheckUtils]: 33: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,222 INFO L280 TraceCheckUtils]: 34: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,222 INFO L280 TraceCheckUtils]: 35: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,222 INFO L280 TraceCheckUtils]: 36: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,222 INFO L280 TraceCheckUtils]: 37: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,223 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3206#true} {3653#(<= |fibonacci_#in~n| 3)} #40#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,224 INFO L280 TraceCheckUtils]: 39: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,224 INFO L280 TraceCheckUtils]: 40: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,225 INFO L280 TraceCheckUtils]: 41: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,225 INFO L280 TraceCheckUtils]: 42: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,226 INFO L280 TraceCheckUtils]: 43: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume true; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,227 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3653#(<= |fibonacci_#in~n| 3)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,228 INFO L280 TraceCheckUtils]: 45: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,228 INFO L263 TraceCheckUtils]: 46: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,228 INFO L280 TraceCheckUtils]: 47: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,229 INFO L280 TraceCheckUtils]: 48: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,229 INFO L280 TraceCheckUtils]: 49: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,229 INFO L263 TraceCheckUtils]: 50: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,229 INFO L280 TraceCheckUtils]: 51: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,229 INFO L280 TraceCheckUtils]: 52: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,230 INFO L280 TraceCheckUtils]: 53: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,230 INFO L280 TraceCheckUtils]: 54: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,230 INFO L280 TraceCheckUtils]: 55: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,230 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,230 INFO L280 TraceCheckUtils]: 57: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,231 INFO L263 TraceCheckUtils]: 58: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,231 INFO L280 TraceCheckUtils]: 59: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,231 INFO L280 TraceCheckUtils]: 60: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,231 INFO L280 TraceCheckUtils]: 61: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,231 INFO L280 TraceCheckUtils]: 62: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,232 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,232 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,232 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,232 INFO L280 TraceCheckUtils]: 66: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,232 INFO L280 TraceCheckUtils]: 67: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,233 INFO L280 TraceCheckUtils]: 68: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,234 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3206#true} {3606#(<= |fibonacci_#in~n| 4)} #40#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,234 INFO L280 TraceCheckUtils]: 70: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,235 INFO L280 TraceCheckUtils]: 71: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,235 INFO L280 TraceCheckUtils]: 72: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,236 INFO L280 TraceCheckUtils]: 73: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,236 INFO L280 TraceCheckUtils]: 74: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume true; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,237 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3606#(<= |fibonacci_#in~n| 4)} {3206#true} #38#return; {3469#(<= fibonacci_~n 5)} is VALID [2020-07-10 18:36:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,378 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,380 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,387 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,389 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,392 INFO L263 TraceCheckUtils]: 3: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,395 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,396 INFO L280 TraceCheckUtils]: 10: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,397 INFO L263 TraceCheckUtils]: 11: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,397 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,398 INFO L280 TraceCheckUtils]: 13: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,398 INFO L280 TraceCheckUtils]: 14: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,398 INFO L280 TraceCheckUtils]: 15: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,400 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,400 INFO L280 TraceCheckUtils]: 17: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,401 INFO L280 TraceCheckUtils]: 18: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,402 INFO L280 TraceCheckUtils]: 19: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,402 INFO L280 TraceCheckUtils]: 20: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,403 INFO L280 TraceCheckUtils]: 21: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume true; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,404 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3862#(<= 1 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,412 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,413 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3206#true} {3855#(<= 2 |fibonacci_#in~n|)} #40#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,416 INFO L263 TraceCheckUtils]: 3: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,418 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,420 INFO L263 TraceCheckUtils]: 7: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,421 INFO L280 TraceCheckUtils]: 9: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,421 INFO L280 TraceCheckUtils]: 10: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,421 INFO L280 TraceCheckUtils]: 11: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,422 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,423 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,424 INFO L280 TraceCheckUtils]: 14: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,424 INFO L263 TraceCheckUtils]: 15: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,425 INFO L280 TraceCheckUtils]: 16: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,425 INFO L280 TraceCheckUtils]: 17: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,426 INFO L280 TraceCheckUtils]: 18: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,426 INFO L280 TraceCheckUtils]: 19: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,428 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,429 INFO L280 TraceCheckUtils]: 21: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,430 INFO L280 TraceCheckUtils]: 22: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,430 INFO L280 TraceCheckUtils]: 23: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,431 INFO L280 TraceCheckUtils]: 24: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,445 INFO L280 TraceCheckUtils]: 25: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume true; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,447 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3862#(<= 1 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,449 INFO L280 TraceCheckUtils]: 27: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,450 INFO L263 TraceCheckUtils]: 28: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,450 INFO L280 TraceCheckUtils]: 29: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,450 INFO L280 TraceCheckUtils]: 30: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,450 INFO L280 TraceCheckUtils]: 31: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,451 INFO L280 TraceCheckUtils]: 32: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,451 INFO L280 TraceCheckUtils]: 33: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,452 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3206#true} {3855#(<= 2 |fibonacci_#in~n|)} #40#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,452 INFO L280 TraceCheckUtils]: 35: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,453 INFO L280 TraceCheckUtils]: 36: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,454 INFO L280 TraceCheckUtils]: 37: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,454 INFO L280 TraceCheckUtils]: 38: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,455 INFO L280 TraceCheckUtils]: 39: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume true; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,456 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3855#(<= 2 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,470 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,470 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,475 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,476 INFO L263 TraceCheckUtils]: 3: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,477 INFO L280 TraceCheckUtils]: 5: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,478 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,478 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,479 INFO L263 TraceCheckUtils]: 11: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,479 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,480 INFO L280 TraceCheckUtils]: 13: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,480 INFO L280 TraceCheckUtils]: 14: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,480 INFO L280 TraceCheckUtils]: 15: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,481 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,481 INFO L280 TraceCheckUtils]: 17: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,482 INFO L280 TraceCheckUtils]: 20: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,484 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3206#true} {3808#(<= 3 |fibonacci_#in~n|)} #40#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,489 INFO L263 TraceCheckUtils]: 7: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,491 INFO L280 TraceCheckUtils]: 10: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,491 INFO L263 TraceCheckUtils]: 11: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,492 INFO L280 TraceCheckUtils]: 14: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,493 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,494 INFO L263 TraceCheckUtils]: 19: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,494 INFO L280 TraceCheckUtils]: 21: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,496 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,497 INFO L280 TraceCheckUtils]: 26: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,498 INFO L280 TraceCheckUtils]: 27: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,499 INFO L280 TraceCheckUtils]: 28: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,499 INFO L280 TraceCheckUtils]: 29: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume true; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,501 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3862#(<= 1 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,502 INFO L280 TraceCheckUtils]: 31: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,502 INFO L263 TraceCheckUtils]: 32: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,502 INFO L280 TraceCheckUtils]: 34: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,503 INFO L280 TraceCheckUtils]: 35: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,503 INFO L280 TraceCheckUtils]: 36: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,503 INFO L280 TraceCheckUtils]: 37: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,505 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3206#true} {3855#(<= 2 |fibonacci_#in~n|)} #40#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,506 INFO L280 TraceCheckUtils]: 39: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,506 INFO L280 TraceCheckUtils]: 40: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,507 INFO L280 TraceCheckUtils]: 41: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,508 INFO L280 TraceCheckUtils]: 42: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,509 INFO L280 TraceCheckUtils]: 43: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume true; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,510 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3855#(<= 2 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,511 INFO L280 TraceCheckUtils]: 45: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,511 INFO L263 TraceCheckUtils]: 46: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,512 INFO L280 TraceCheckUtils]: 47: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,512 INFO L280 TraceCheckUtils]: 48: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,512 INFO L280 TraceCheckUtils]: 49: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,513 INFO L263 TraceCheckUtils]: 50: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,513 INFO L280 TraceCheckUtils]: 51: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,514 INFO L280 TraceCheckUtils]: 52: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,514 INFO L280 TraceCheckUtils]: 53: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,514 INFO L280 TraceCheckUtils]: 54: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,515 INFO L280 TraceCheckUtils]: 55: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,515 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,515 INFO L280 TraceCheckUtils]: 57: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,516 INFO L263 TraceCheckUtils]: 58: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,516 INFO L280 TraceCheckUtils]: 59: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,516 INFO L280 TraceCheckUtils]: 60: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,516 INFO L280 TraceCheckUtils]: 61: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,517 INFO L280 TraceCheckUtils]: 62: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,517 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,517 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,517 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,517 INFO L280 TraceCheckUtils]: 66: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,518 INFO L280 TraceCheckUtils]: 67: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,518 INFO L280 TraceCheckUtils]: 68: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,519 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3206#true} {3808#(<= 3 |fibonacci_#in~n|)} #40#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,519 INFO L280 TraceCheckUtils]: 70: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,520 INFO L280 TraceCheckUtils]: 71: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,521 INFO L280 TraceCheckUtils]: 72: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,521 INFO L280 TraceCheckUtils]: 73: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,522 INFO L280 TraceCheckUtils]: 74: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume true; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,523 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3808#(<= 3 |fibonacci_#in~n|)} {3206#true} #38#return; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,546 INFO L280 TraceCheckUtils]: 3: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,546 INFO L280 TraceCheckUtils]: 4: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,548 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3760#(<= 4 fibonacci_~n)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,549 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,549 INFO L263 TraceCheckUtils]: 3: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,550 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,551 INFO L280 TraceCheckUtils]: 6: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,551 INFO L263 TraceCheckUtils]: 7: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,552 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,553 INFO L280 TraceCheckUtils]: 9: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,553 INFO L263 TraceCheckUtils]: 11: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,554 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,555 INFO L280 TraceCheckUtils]: 13: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,555 INFO L280 TraceCheckUtils]: 14: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,555 INFO L263 TraceCheckUtils]: 15: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,556 INFO L280 TraceCheckUtils]: 16: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,556 INFO L280 TraceCheckUtils]: 18: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,557 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,558 INFO L263 TraceCheckUtils]: 23: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,558 INFO L280 TraceCheckUtils]: 24: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,558 INFO L280 TraceCheckUtils]: 25: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,559 INFO L280 TraceCheckUtils]: 26: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,559 INFO L280 TraceCheckUtils]: 27: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,560 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,562 INFO L280 TraceCheckUtils]: 30: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,563 INFO L280 TraceCheckUtils]: 31: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,563 INFO L280 TraceCheckUtils]: 32: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,564 INFO L280 TraceCheckUtils]: 33: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume true; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,565 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3862#(<= 1 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,566 INFO L280 TraceCheckUtils]: 35: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,567 INFO L263 TraceCheckUtils]: 36: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,567 INFO L280 TraceCheckUtils]: 37: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,567 INFO L280 TraceCheckUtils]: 38: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,568 INFO L280 TraceCheckUtils]: 39: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,568 INFO L280 TraceCheckUtils]: 40: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,568 INFO L280 TraceCheckUtils]: 41: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,569 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3206#true} {3855#(<= 2 |fibonacci_#in~n|)} #40#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,570 INFO L280 TraceCheckUtils]: 43: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,571 INFO L280 TraceCheckUtils]: 44: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,571 INFO L280 TraceCheckUtils]: 45: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,572 INFO L280 TraceCheckUtils]: 46: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,573 INFO L280 TraceCheckUtils]: 47: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume true; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,575 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3855#(<= 2 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,576 INFO L280 TraceCheckUtils]: 49: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,576 INFO L263 TraceCheckUtils]: 50: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,577 INFO L280 TraceCheckUtils]: 51: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,577 INFO L280 TraceCheckUtils]: 52: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,577 INFO L280 TraceCheckUtils]: 53: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,577 INFO L263 TraceCheckUtils]: 54: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,578 INFO L280 TraceCheckUtils]: 55: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,578 INFO L280 TraceCheckUtils]: 56: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,578 INFO L280 TraceCheckUtils]: 57: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,578 INFO L280 TraceCheckUtils]: 58: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,578 INFO L280 TraceCheckUtils]: 59: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,579 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,579 INFO L280 TraceCheckUtils]: 61: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,579 INFO L263 TraceCheckUtils]: 62: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,579 INFO L280 TraceCheckUtils]: 63: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,579 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,580 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,580 INFO L280 TraceCheckUtils]: 66: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,580 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,580 INFO L280 TraceCheckUtils]: 68: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,581 INFO L280 TraceCheckUtils]: 69: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,581 INFO L280 TraceCheckUtils]: 70: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,581 INFO L280 TraceCheckUtils]: 71: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,581 INFO L280 TraceCheckUtils]: 72: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,582 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3206#true} {3808#(<= 3 |fibonacci_#in~n|)} #40#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,583 INFO L280 TraceCheckUtils]: 74: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,583 INFO L280 TraceCheckUtils]: 75: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,584 INFO L280 TraceCheckUtils]: 76: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,584 INFO L280 TraceCheckUtils]: 77: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,585 INFO L280 TraceCheckUtils]: 78: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume true; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,586 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3808#(<= 3 |fibonacci_#in~n|)} {3206#true} #38#return; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,587 INFO L280 TraceCheckUtils]: 80: Hoare triple {3760#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,587 INFO L263 TraceCheckUtils]: 81: Hoare triple {3760#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,588 INFO L280 TraceCheckUtils]: 82: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,588 INFO L280 TraceCheckUtils]: 83: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,589 INFO L280 TraceCheckUtils]: 84: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,589 INFO L280 TraceCheckUtils]: 85: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,590 INFO L280 TraceCheckUtils]: 86: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,591 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3760#(<= 4 fibonacci_~n)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,591 INFO L280 TraceCheckUtils]: 88: Hoare triple {3207#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3207#false} is VALID [2020-07-10 18:36:20,591 INFO L280 TraceCheckUtils]: 89: Hoare triple {3207#false} #res := #t~ret0 + #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,592 INFO L280 TraceCheckUtils]: 90: Hoare triple {3207#false} havoc #t~ret0; {3207#false} is VALID [2020-07-10 18:36:20,592 INFO L280 TraceCheckUtils]: 91: Hoare triple {3207#false} havoc #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,592 INFO L280 TraceCheckUtils]: 92: Hoare triple {3207#false} assume true; {3207#false} is VALID [2020-07-10 18:36:20,592 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3207#false} {3469#(<= fibonacci_~n 5)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,600 INFO L263 TraceCheckUtils]: 3: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,600 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,601 INFO L280 TraceCheckUtils]: 5: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,601 INFO L280 TraceCheckUtils]: 6: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,602 INFO L263 TraceCheckUtils]: 7: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,604 INFO L263 TraceCheckUtils]: 11: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,604 INFO L280 TraceCheckUtils]: 12: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,606 INFO L263 TraceCheckUtils]: 15: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,608 INFO L280 TraceCheckUtils]: 18: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,609 INFO L280 TraceCheckUtils]: 20: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,611 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,612 INFO L263 TraceCheckUtils]: 23: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,612 INFO L280 TraceCheckUtils]: 24: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,613 INFO L280 TraceCheckUtils]: 25: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,613 INFO L280 TraceCheckUtils]: 26: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,613 INFO L280 TraceCheckUtils]: 27: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,614 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3206#true} {3666#(<= |fibonacci_#in~n| 2)} #40#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,615 INFO L280 TraceCheckUtils]: 29: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,616 INFO L280 TraceCheckUtils]: 30: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,617 INFO L280 TraceCheckUtils]: 31: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,618 INFO L280 TraceCheckUtils]: 32: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,618 INFO L280 TraceCheckUtils]: 33: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume true; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,620 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3666#(<= |fibonacci_#in~n| 2)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,621 INFO L280 TraceCheckUtils]: 35: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,621 INFO L263 TraceCheckUtils]: 36: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,622 INFO L280 TraceCheckUtils]: 37: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,622 INFO L280 TraceCheckUtils]: 38: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,622 INFO L280 TraceCheckUtils]: 39: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,623 INFO L280 TraceCheckUtils]: 40: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,623 INFO L280 TraceCheckUtils]: 41: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,624 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3206#true} {3653#(<= |fibonacci_#in~n| 3)} #40#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,625 INFO L280 TraceCheckUtils]: 43: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,626 INFO L280 TraceCheckUtils]: 44: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,626 INFO L280 TraceCheckUtils]: 45: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,627 INFO L280 TraceCheckUtils]: 46: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,628 INFO L280 TraceCheckUtils]: 47: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume true; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,630 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3653#(<= |fibonacci_#in~n| 3)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,631 INFO L280 TraceCheckUtils]: 49: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,631 INFO L263 TraceCheckUtils]: 50: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,631 INFO L280 TraceCheckUtils]: 51: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,632 INFO L280 TraceCheckUtils]: 52: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,632 INFO L280 TraceCheckUtils]: 53: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,632 INFO L263 TraceCheckUtils]: 54: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,633 INFO L280 TraceCheckUtils]: 55: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,633 INFO L280 TraceCheckUtils]: 56: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,633 INFO L280 TraceCheckUtils]: 57: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,634 INFO L280 TraceCheckUtils]: 58: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,634 INFO L280 TraceCheckUtils]: 59: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,634 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,635 INFO L280 TraceCheckUtils]: 61: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,635 INFO L263 TraceCheckUtils]: 62: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,635 INFO L280 TraceCheckUtils]: 63: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,636 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,636 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,636 INFO L280 TraceCheckUtils]: 66: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,637 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,637 INFO L280 TraceCheckUtils]: 68: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,637 INFO L280 TraceCheckUtils]: 69: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,638 INFO L280 TraceCheckUtils]: 70: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,638 INFO L280 TraceCheckUtils]: 71: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,638 INFO L280 TraceCheckUtils]: 72: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,639 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3206#true} {3606#(<= |fibonacci_#in~n| 4)} #40#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,640 INFO L280 TraceCheckUtils]: 74: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,640 INFO L280 TraceCheckUtils]: 75: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,641 INFO L280 TraceCheckUtils]: 76: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,641 INFO L280 TraceCheckUtils]: 77: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,642 INFO L280 TraceCheckUtils]: 78: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume true; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,643 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3606#(<= |fibonacci_#in~n| 4)} {3206#true} #38#return; {3469#(<= fibonacci_~n 5)} is VALID [2020-07-10 18:36:20,643 INFO L280 TraceCheckUtils]: 80: Hoare triple {3469#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3469#(<= fibonacci_~n 5)} is VALID [2020-07-10 18:36:20,644 INFO L263 TraceCheckUtils]: 81: Hoare triple {3469#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,644 INFO L280 TraceCheckUtils]: 82: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,644 INFO L280 TraceCheckUtils]: 83: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,644 INFO L280 TraceCheckUtils]: 84: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,644 INFO L263 TraceCheckUtils]: 85: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,645 INFO L280 TraceCheckUtils]: 86: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,645 INFO L280 TraceCheckUtils]: 87: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,646 INFO L280 TraceCheckUtils]: 88: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,646 INFO L263 TraceCheckUtils]: 89: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,647 INFO L280 TraceCheckUtils]: 90: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,647 INFO L280 TraceCheckUtils]: 91: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,648 INFO L280 TraceCheckUtils]: 92: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,648 INFO L263 TraceCheckUtils]: 93: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,648 INFO L280 TraceCheckUtils]: 94: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,649 INFO L280 TraceCheckUtils]: 95: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,649 INFO L280 TraceCheckUtils]: 96: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,650 INFO L263 TraceCheckUtils]: 97: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,650 INFO L280 TraceCheckUtils]: 98: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,650 INFO L280 TraceCheckUtils]: 99: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,650 INFO L280 TraceCheckUtils]: 100: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,650 INFO L280 TraceCheckUtils]: 101: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,651 INFO L280 TraceCheckUtils]: 102: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,651 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,652 INFO L280 TraceCheckUtils]: 104: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,652 INFO L263 TraceCheckUtils]: 105: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,652 INFO L280 TraceCheckUtils]: 106: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,653 INFO L280 TraceCheckUtils]: 107: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,653 INFO L280 TraceCheckUtils]: 108: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,653 INFO L280 TraceCheckUtils]: 109: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,654 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,654 INFO L280 TraceCheckUtils]: 111: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,655 INFO L280 TraceCheckUtils]: 112: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,655 INFO L280 TraceCheckUtils]: 113: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,656 INFO L280 TraceCheckUtils]: 114: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,657 INFO L280 TraceCheckUtils]: 115: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume true; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,658 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {3862#(<= 1 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,658 INFO L280 TraceCheckUtils]: 117: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,659 INFO L263 TraceCheckUtils]: 118: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,659 INFO L280 TraceCheckUtils]: 119: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,659 INFO L280 TraceCheckUtils]: 120: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,659 INFO L280 TraceCheckUtils]: 121: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,660 INFO L280 TraceCheckUtils]: 122: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,660 INFO L280 TraceCheckUtils]: 123: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,661 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3206#true} {3855#(<= 2 |fibonacci_#in~n|)} #40#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,661 INFO L280 TraceCheckUtils]: 125: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,662 INFO L280 TraceCheckUtils]: 126: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,662 INFO L280 TraceCheckUtils]: 127: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,663 INFO L280 TraceCheckUtils]: 128: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,664 INFO L280 TraceCheckUtils]: 129: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume true; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,665 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {3855#(<= 2 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,666 INFO L280 TraceCheckUtils]: 131: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,666 INFO L263 TraceCheckUtils]: 132: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,666 INFO L280 TraceCheckUtils]: 133: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,666 INFO L280 TraceCheckUtils]: 134: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,666 INFO L280 TraceCheckUtils]: 135: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,667 INFO L263 TraceCheckUtils]: 136: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,667 INFO L280 TraceCheckUtils]: 137: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,667 INFO L280 TraceCheckUtils]: 138: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,667 INFO L280 TraceCheckUtils]: 139: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,667 INFO L280 TraceCheckUtils]: 140: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,668 INFO L280 TraceCheckUtils]: 141: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,668 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,668 INFO L280 TraceCheckUtils]: 143: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,668 INFO L263 TraceCheckUtils]: 144: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 145: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 146: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 147: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 148: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,669 INFO L275 TraceCheckUtils]: 149: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 150: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 151: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 152: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 153: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 154: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,671 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3206#true} {3808#(<= 3 |fibonacci_#in~n|)} #40#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,672 INFO L280 TraceCheckUtils]: 156: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,673 INFO L280 TraceCheckUtils]: 157: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,673 INFO L280 TraceCheckUtils]: 158: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,674 INFO L280 TraceCheckUtils]: 159: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,674 INFO L280 TraceCheckUtils]: 160: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume true; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,675 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {3808#(<= 3 |fibonacci_#in~n|)} {3206#true} #38#return; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,676 INFO L280 TraceCheckUtils]: 162: Hoare triple {3760#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,676 INFO L263 TraceCheckUtils]: 163: Hoare triple {3760#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,677 INFO L280 TraceCheckUtils]: 164: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,677 INFO L280 TraceCheckUtils]: 165: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,680 INFO L280 TraceCheckUtils]: 166: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,680 INFO L280 TraceCheckUtils]: 167: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,686 INFO L280 TraceCheckUtils]: 168: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,688 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3760#(<= 4 fibonacci_~n)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,688 INFO L280 TraceCheckUtils]: 170: Hoare triple {3207#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3207#false} is VALID [2020-07-10 18:36:20,688 INFO L280 TraceCheckUtils]: 171: Hoare triple {3207#false} #res := #t~ret0 + #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,689 INFO L280 TraceCheckUtils]: 172: Hoare triple {3207#false} havoc #t~ret0; {3207#false} is VALID [2020-07-10 18:36:20,689 INFO L280 TraceCheckUtils]: 173: Hoare triple {3207#false} havoc #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,689 INFO L280 TraceCheckUtils]: 174: Hoare triple {3207#false} assume true; {3207#false} is VALID [2020-07-10 18:36:20,689 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3207#false} {3469#(<= fibonacci_~n 5)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,690 INFO L280 TraceCheckUtils]: 176: Hoare triple {3207#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3207#false} is VALID [2020-07-10 18:36:20,690 INFO L280 TraceCheckUtils]: 177: Hoare triple {3207#false} #res := #t~ret0 + #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,690 INFO L280 TraceCheckUtils]: 178: Hoare triple {3207#false} havoc #t~ret0; {3207#false} is VALID [2020-07-10 18:36:20,691 INFO L280 TraceCheckUtils]: 179: Hoare triple {3207#false} havoc #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,691 INFO L280 TraceCheckUtils]: 180: Hoare triple {3207#false} assume true; {3207#false} is VALID [2020-07-10 18:36:20,691 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {3207#false} {3210#(<= 9 main_~x~0)} #46#return; {3207#false} is VALID [2020-07-10 18:36:20,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {3206#true} call ULTIMATE.init(); {3206#true} is VALID [2020-07-10 18:36:20,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3206#true} {3206#true} #42#return; {3206#true} is VALID [2020-07-10 18:36:20,722 INFO L263 TraceCheckUtils]: 3: Hoare triple {3206#true} call #t~ret3 := main(); {3206#true} is VALID [2020-07-10 18:36:20,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {3206#true} ~x~0 := 9; {3210#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:20,723 INFO L263 TraceCheckUtils]: 5: Hoare triple {3210#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {3206#true} is VALID [2020-07-10 18:36:20,723 INFO L280 TraceCheckUtils]: 6: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,724 INFO L263 TraceCheckUtils]: 9: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,725 INFO L263 TraceCheckUtils]: 13: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,726 INFO L280 TraceCheckUtils]: 14: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,726 INFO L280 TraceCheckUtils]: 15: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,727 INFO L280 TraceCheckUtils]: 16: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,727 INFO L263 TraceCheckUtils]: 17: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,727 INFO L280 TraceCheckUtils]: 18: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,728 INFO L280 TraceCheckUtils]: 19: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,729 INFO L263 TraceCheckUtils]: 21: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,729 INFO L280 TraceCheckUtils]: 22: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,730 INFO L280 TraceCheckUtils]: 23: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,730 INFO L280 TraceCheckUtils]: 24: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,731 INFO L280 TraceCheckUtils]: 26: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,732 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,733 INFO L280 TraceCheckUtils]: 28: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,733 INFO L263 TraceCheckUtils]: 29: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,733 INFO L280 TraceCheckUtils]: 30: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,733 INFO L280 TraceCheckUtils]: 31: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,734 INFO L280 TraceCheckUtils]: 32: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,734 INFO L280 TraceCheckUtils]: 33: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,735 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3206#true} {3666#(<= |fibonacci_#in~n| 2)} #40#return; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,735 INFO L280 TraceCheckUtils]: 35: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,736 INFO L280 TraceCheckUtils]: 36: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,736 INFO L280 TraceCheckUtils]: 37: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,737 INFO L280 TraceCheckUtils]: 38: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,737 INFO L280 TraceCheckUtils]: 39: Hoare triple {3666#(<= |fibonacci_#in~n| 2)} assume true; {3666#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,738 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3666#(<= |fibonacci_#in~n| 2)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,739 INFO L280 TraceCheckUtils]: 41: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,739 INFO L263 TraceCheckUtils]: 42: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,739 INFO L280 TraceCheckUtils]: 43: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,739 INFO L280 TraceCheckUtils]: 44: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,739 INFO L280 TraceCheckUtils]: 45: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,740 INFO L280 TraceCheckUtils]: 46: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,740 INFO L280 TraceCheckUtils]: 47: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,741 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3206#true} {3653#(<= |fibonacci_#in~n| 3)} #40#return; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,741 INFO L280 TraceCheckUtils]: 49: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,742 INFO L280 TraceCheckUtils]: 50: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,742 INFO L280 TraceCheckUtils]: 51: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,743 INFO L280 TraceCheckUtils]: 52: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,743 INFO L280 TraceCheckUtils]: 53: Hoare triple {3653#(<= |fibonacci_#in~n| 3)} assume true; {3653#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,744 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {3653#(<= |fibonacci_#in~n| 3)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,745 INFO L280 TraceCheckUtils]: 55: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,745 INFO L263 TraceCheckUtils]: 56: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,745 INFO L280 TraceCheckUtils]: 57: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,745 INFO L280 TraceCheckUtils]: 58: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,745 INFO L280 TraceCheckUtils]: 59: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,746 INFO L263 TraceCheckUtils]: 60: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,746 INFO L280 TraceCheckUtils]: 61: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,746 INFO L280 TraceCheckUtils]: 62: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,746 INFO L280 TraceCheckUtils]: 63: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,746 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,747 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,747 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,747 INFO L280 TraceCheckUtils]: 67: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,747 INFO L263 TraceCheckUtils]: 68: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,747 INFO L280 TraceCheckUtils]: 69: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,747 INFO L280 TraceCheckUtils]: 70: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,748 INFO L280 TraceCheckUtils]: 71: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,748 INFO L280 TraceCheckUtils]: 72: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,748 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,748 INFO L280 TraceCheckUtils]: 74: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,748 INFO L280 TraceCheckUtils]: 75: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,749 INFO L280 TraceCheckUtils]: 76: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,749 INFO L280 TraceCheckUtils]: 77: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,749 INFO L280 TraceCheckUtils]: 78: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,750 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3206#true} {3606#(<= |fibonacci_#in~n| 4)} #40#return; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,750 INFO L280 TraceCheckUtils]: 80: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,751 INFO L280 TraceCheckUtils]: 81: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,751 INFO L280 TraceCheckUtils]: 82: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,752 INFO L280 TraceCheckUtils]: 83: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,752 INFO L280 TraceCheckUtils]: 84: Hoare triple {3606#(<= |fibonacci_#in~n| 4)} assume true; {3606#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:20,753 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {3606#(<= |fibonacci_#in~n| 4)} {3206#true} #38#return; {3469#(<= fibonacci_~n 5)} is VALID [2020-07-10 18:36:20,754 INFO L280 TraceCheckUtils]: 86: Hoare triple {3469#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3469#(<= fibonacci_~n 5)} is VALID [2020-07-10 18:36:20,754 INFO L263 TraceCheckUtils]: 87: Hoare triple {3469#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,754 INFO L280 TraceCheckUtils]: 88: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,754 INFO L280 TraceCheckUtils]: 89: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,754 INFO L280 TraceCheckUtils]: 90: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,755 INFO L263 TraceCheckUtils]: 91: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,755 INFO L280 TraceCheckUtils]: 92: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,756 INFO L280 TraceCheckUtils]: 93: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,756 INFO L280 TraceCheckUtils]: 94: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,756 INFO L263 TraceCheckUtils]: 95: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,757 INFO L280 TraceCheckUtils]: 96: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,757 INFO L280 TraceCheckUtils]: 97: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,758 INFO L280 TraceCheckUtils]: 98: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,758 INFO L263 TraceCheckUtils]: 99: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,758 INFO L280 TraceCheckUtils]: 100: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,759 INFO L280 TraceCheckUtils]: 101: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,760 INFO L280 TraceCheckUtils]: 102: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,760 INFO L263 TraceCheckUtils]: 103: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,760 INFO L280 TraceCheckUtils]: 104: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,760 INFO L280 TraceCheckUtils]: 105: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,760 INFO L280 TraceCheckUtils]: 106: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,761 INFO L280 TraceCheckUtils]: 107: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,761 INFO L280 TraceCheckUtils]: 108: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,761 INFO L275 TraceCheckUtils]: 109: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #38#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,762 INFO L280 TraceCheckUtils]: 110: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,762 INFO L263 TraceCheckUtils]: 111: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,762 INFO L280 TraceCheckUtils]: 112: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,763 INFO L280 TraceCheckUtils]: 113: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,763 INFO L280 TraceCheckUtils]: 114: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,763 INFO L280 TraceCheckUtils]: 115: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,764 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {3206#true} {3862#(<= 1 |fibonacci_#in~n|)} #40#return; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,764 INFO L280 TraceCheckUtils]: 117: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,765 INFO L280 TraceCheckUtils]: 118: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,765 INFO L280 TraceCheckUtils]: 119: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,766 INFO L280 TraceCheckUtils]: 120: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,766 INFO L280 TraceCheckUtils]: 121: Hoare triple {3862#(<= 1 |fibonacci_#in~n|)} assume true; {3862#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,767 INFO L275 TraceCheckUtils]: 122: Hoare quadruple {3862#(<= 1 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,768 INFO L280 TraceCheckUtils]: 123: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,768 INFO L263 TraceCheckUtils]: 124: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,768 INFO L280 TraceCheckUtils]: 125: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,769 INFO L280 TraceCheckUtils]: 126: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,769 INFO L280 TraceCheckUtils]: 127: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,769 INFO L280 TraceCheckUtils]: 128: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,769 INFO L280 TraceCheckUtils]: 129: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,770 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {3206#true} {3855#(<= 2 |fibonacci_#in~n|)} #40#return; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,771 INFO L280 TraceCheckUtils]: 131: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,771 INFO L280 TraceCheckUtils]: 132: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,772 INFO L280 TraceCheckUtils]: 133: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,772 INFO L280 TraceCheckUtils]: 134: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,773 INFO L280 TraceCheckUtils]: 135: Hoare triple {3855#(<= 2 |fibonacci_#in~n|)} assume true; {3855#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,774 INFO L275 TraceCheckUtils]: 136: Hoare quadruple {3855#(<= 2 |fibonacci_#in~n|)} {3564#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,775 INFO L280 TraceCheckUtils]: 137: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,775 INFO L263 TraceCheckUtils]: 138: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,775 INFO L280 TraceCheckUtils]: 139: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,776 INFO L280 TraceCheckUtils]: 140: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,776 INFO L280 TraceCheckUtils]: 141: Hoare triple {3206#true} assume !(1 == ~n); {3206#true} is VALID [2020-07-10 18:36:20,776 INFO L263 TraceCheckUtils]: 142: Hoare triple {3206#true} call #t~ret0 := fibonacci(~n - 1); {3206#true} is VALID [2020-07-10 18:36:20,776 INFO L280 TraceCheckUtils]: 143: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,776 INFO L280 TraceCheckUtils]: 144: Hoare triple {3206#true} assume !(~n < 1); {3206#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 145: Hoare triple {3206#true} assume 1 == ~n; {3206#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 146: Hoare triple {3206#true} #res := 1; {3206#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 147: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,777 INFO L275 TraceCheckUtils]: 148: Hoare quadruple {3206#true} {3206#true} #38#return; {3206#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 149: Hoare triple {3206#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,778 INFO L263 TraceCheckUtils]: 150: Hoare triple {3206#true} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,778 INFO L280 TraceCheckUtils]: 151: Hoare triple {3206#true} ~n := #in~n; {3206#true} is VALID [2020-07-10 18:36:20,778 INFO L280 TraceCheckUtils]: 152: Hoare triple {3206#true} assume ~n < 1; {3206#true} is VALID [2020-07-10 18:36:20,778 INFO L280 TraceCheckUtils]: 153: Hoare triple {3206#true} #res := 0; {3206#true} is VALID [2020-07-10 18:36:20,778 INFO L280 TraceCheckUtils]: 154: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,779 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3206#true} {3206#true} #40#return; {3206#true} is VALID [2020-07-10 18:36:20,779 INFO L280 TraceCheckUtils]: 156: Hoare triple {3206#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#true} is VALID [2020-07-10 18:36:20,779 INFO L280 TraceCheckUtils]: 157: Hoare triple {3206#true} #res := #t~ret0 + #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,779 INFO L280 TraceCheckUtils]: 158: Hoare triple {3206#true} havoc #t~ret0; {3206#true} is VALID [2020-07-10 18:36:20,779 INFO L280 TraceCheckUtils]: 159: Hoare triple {3206#true} havoc #t~ret1; {3206#true} is VALID [2020-07-10 18:36:20,780 INFO L280 TraceCheckUtils]: 160: Hoare triple {3206#true} assume true; {3206#true} is VALID [2020-07-10 18:36:20,781 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {3206#true} {3808#(<= 3 |fibonacci_#in~n|)} #40#return; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,781 INFO L280 TraceCheckUtils]: 162: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,782 INFO L280 TraceCheckUtils]: 163: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,782 INFO L280 TraceCheckUtils]: 164: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,783 INFO L280 TraceCheckUtils]: 165: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,783 INFO L280 TraceCheckUtils]: 166: Hoare triple {3808#(<= 3 |fibonacci_#in~n|)} assume true; {3808#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,784 INFO L275 TraceCheckUtils]: 167: Hoare quadruple {3808#(<= 3 |fibonacci_#in~n|)} {3206#true} #38#return; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,785 INFO L280 TraceCheckUtils]: 168: Hoare triple {3760#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3760#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:20,785 INFO L263 TraceCheckUtils]: 169: Hoare triple {3760#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3206#true} is VALID [2020-07-10 18:36:20,786 INFO L280 TraceCheckUtils]: 170: Hoare triple {3206#true} ~n := #in~n; {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,786 INFO L280 TraceCheckUtils]: 171: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3564#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,787 INFO L280 TraceCheckUtils]: 172: Hoare triple {3564#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,787 INFO L280 TraceCheckUtils]: 173: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} #res := 1; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,788 INFO L280 TraceCheckUtils]: 174: Hoare triple {3672#(<= |fibonacci_#in~n| 1)} assume true; {3672#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,789 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3672#(<= |fibonacci_#in~n| 1)} {3760#(<= 4 fibonacci_~n)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,789 INFO L280 TraceCheckUtils]: 176: Hoare triple {3207#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3207#false} is VALID [2020-07-10 18:36:20,789 INFO L280 TraceCheckUtils]: 177: Hoare triple {3207#false} #res := #t~ret0 + #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,789 INFO L280 TraceCheckUtils]: 178: Hoare triple {3207#false} havoc #t~ret0; {3207#false} is VALID [2020-07-10 18:36:20,790 INFO L280 TraceCheckUtils]: 179: Hoare triple {3207#false} havoc #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,790 INFO L280 TraceCheckUtils]: 180: Hoare triple {3207#false} assume true; {3207#false} is VALID [2020-07-10 18:36:20,790 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {3207#false} {3469#(<= fibonacci_~n 5)} #40#return; {3207#false} is VALID [2020-07-10 18:36:20,790 INFO L280 TraceCheckUtils]: 182: Hoare triple {3207#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3207#false} is VALID [2020-07-10 18:36:20,790 INFO L280 TraceCheckUtils]: 183: Hoare triple {3207#false} #res := #t~ret0 + #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,791 INFO L280 TraceCheckUtils]: 184: Hoare triple {3207#false} havoc #t~ret0; {3207#false} is VALID [2020-07-10 18:36:20,791 INFO L280 TraceCheckUtils]: 185: Hoare triple {3207#false} havoc #t~ret1; {3207#false} is VALID [2020-07-10 18:36:20,791 INFO L280 TraceCheckUtils]: 186: Hoare triple {3207#false} assume true; {3207#false} is VALID [2020-07-10 18:36:20,791 INFO L275 TraceCheckUtils]: 187: Hoare quadruple {3207#false} {3210#(<= 9 main_~x~0)} #46#return; {3207#false} is VALID [2020-07-10 18:36:20,791 INFO L280 TraceCheckUtils]: 188: Hoare triple {3207#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3207#false} is VALID [2020-07-10 18:36:20,791 INFO L280 TraceCheckUtils]: 189: Hoare triple {3207#false} ~result~0 := #t~ret2; {3207#false} is VALID [2020-07-10 18:36:20,792 INFO L280 TraceCheckUtils]: 190: Hoare triple {3207#false} havoc #t~ret2; {3207#false} is VALID [2020-07-10 18:36:20,792 INFO L280 TraceCheckUtils]: 191: Hoare triple {3207#false} assume !(34 == ~result~0); {3207#false} is VALID [2020-07-10 18:36:20,792 INFO L280 TraceCheckUtils]: 192: Hoare triple {3207#false} assume !false; {3207#false} is VALID [2020-07-10 18:36:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 48 proven. 97 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-07-10 18:36:20,823 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:20,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399793767] [2020-07-10 18:36:20,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:20,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 18:36:20,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992197616] [2020-07-10 18:36:20,827 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-07-10 18:36:20,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:20,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 18:36:20,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:20,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 18:36:20,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 18:36:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-10 18:36:20,986 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-07-10 18:36:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:22,346 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-07-10 18:36:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-10 18:36:22,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-07-10 18:36:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 18:36:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2020-07-10 18:36:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 18:36:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 137 transitions. [2020-07-10 18:36:22,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 137 transitions. [2020-07-10 18:36:22,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:22,563 INFO L225 Difference]: With dead ends: 149 [2020-07-10 18:36:22,563 INFO L226 Difference]: Without dead ends: 92 [2020-07-10 18:36:22,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-07-10 18:36:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-10 18:36:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-07-10 18:36:22,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:22,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 85 states. [2020-07-10 18:36:22,729 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 85 states. [2020-07-10 18:36:22,729 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 85 states. [2020-07-10 18:36:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:22,734 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2020-07-10 18:36:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2020-07-10 18:36:22,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:22,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:22,735 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 92 states. [2020-07-10 18:36:22,735 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 92 states. [2020-07-10 18:36:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:22,740 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2020-07-10 18:36:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2020-07-10 18:36:22,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:22,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:22,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:22,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 18:36:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-07-10 18:36:22,745 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-07-10 18:36:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:22,745 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-07-10 18:36:22,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 18:36:22,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 101 transitions. [2020-07-10 18:36:22,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-07-10 18:36:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-10 18:36:22,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:22,880 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:22,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 18:36:22,880 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash -217722271, now seen corresponding path program 6 times [2020-07-10 18:36:22,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:22,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748063048] [2020-07-10 18:36:22,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,133 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4571#true} {4571#true} #42#return; {4571#true} is VALID [2020-07-10 18:36:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,378 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,386 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,387 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,389 INFO L263 TraceCheckUtils]: 3: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,392 INFO L280 TraceCheckUtils]: 8: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,394 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,395 INFO L263 TraceCheckUtils]: 11: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,398 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,399 INFO L280 TraceCheckUtils]: 17: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,400 INFO L280 TraceCheckUtils]: 18: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,401 INFO L280 TraceCheckUtils]: 19: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,402 INFO L280 TraceCheckUtils]: 20: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,402 INFO L280 TraceCheckUtils]: 21: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume true; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,404 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {5219#(<= |fibonacci_#in~n| 2)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,411 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,413 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {5206#(<= |fibonacci_#in~n| 3)} #40#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,416 INFO L263 TraceCheckUtils]: 3: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,418 INFO L280 TraceCheckUtils]: 6: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,419 INFO L263 TraceCheckUtils]: 7: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,421 INFO L280 TraceCheckUtils]: 10: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,422 INFO L280 TraceCheckUtils]: 11: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,423 INFO L280 TraceCheckUtils]: 12: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,425 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,426 INFO L280 TraceCheckUtils]: 14: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,426 INFO L263 TraceCheckUtils]: 15: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,426 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,427 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,428 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,429 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,430 INFO L280 TraceCheckUtils]: 21: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,431 INFO L280 TraceCheckUtils]: 22: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,432 INFO L280 TraceCheckUtils]: 24: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,433 INFO L280 TraceCheckUtils]: 25: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume true; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,435 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {5219#(<= |fibonacci_#in~n| 2)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,436 INFO L280 TraceCheckUtils]: 27: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,436 INFO L263 TraceCheckUtils]: 28: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,437 INFO L280 TraceCheckUtils]: 29: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,437 INFO L280 TraceCheckUtils]: 30: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,437 INFO L280 TraceCheckUtils]: 31: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,438 INFO L280 TraceCheckUtils]: 32: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,438 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,439 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4571#true} {5206#(<= |fibonacci_#in~n| 3)} #40#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,440 INFO L280 TraceCheckUtils]: 35: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,440 INFO L280 TraceCheckUtils]: 36: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,441 INFO L280 TraceCheckUtils]: 37: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,442 INFO L280 TraceCheckUtils]: 38: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,443 INFO L280 TraceCheckUtils]: 39: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume true; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,445 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {5206#(<= |fibonacci_#in~n| 3)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,460 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,461 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,469 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,471 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,471 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,472 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,472 INFO L280 TraceCheckUtils]: 7: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,473 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,473 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,474 INFO L263 TraceCheckUtils]: 11: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,474 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,475 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,475 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,475 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,476 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,476 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,477 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,477 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,479 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4571#true} {5159#(<= |fibonacci_#in~n| 4)} #40#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,482 INFO L263 TraceCheckUtils]: 3: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,485 INFO L263 TraceCheckUtils]: 7: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,488 INFO L263 TraceCheckUtils]: 11: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,490 INFO L280 TraceCheckUtils]: 13: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,494 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,495 INFO L280 TraceCheckUtils]: 18: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,495 INFO L263 TraceCheckUtils]: 19: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,496 INFO L280 TraceCheckUtils]: 22: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,496 INFO L280 TraceCheckUtils]: 23: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,497 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,499 INFO L280 TraceCheckUtils]: 26: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,500 INFO L280 TraceCheckUtils]: 27: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,501 INFO L280 TraceCheckUtils]: 28: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,502 INFO L280 TraceCheckUtils]: 29: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume true; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,503 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {5219#(<= |fibonacci_#in~n| 2)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,504 INFO L280 TraceCheckUtils]: 31: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,504 INFO L263 TraceCheckUtils]: 32: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,504 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,504 INFO L280 TraceCheckUtils]: 34: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,504 INFO L280 TraceCheckUtils]: 35: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,505 INFO L280 TraceCheckUtils]: 36: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,505 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,506 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4571#true} {5206#(<= |fibonacci_#in~n| 3)} #40#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,506 INFO L280 TraceCheckUtils]: 39: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,507 INFO L280 TraceCheckUtils]: 40: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,507 INFO L280 TraceCheckUtils]: 41: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,508 INFO L280 TraceCheckUtils]: 42: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,509 INFO L280 TraceCheckUtils]: 43: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume true; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,510 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5206#(<= |fibonacci_#in~n| 3)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,510 INFO L280 TraceCheckUtils]: 45: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,511 INFO L263 TraceCheckUtils]: 46: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,511 INFO L280 TraceCheckUtils]: 47: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,511 INFO L280 TraceCheckUtils]: 48: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,511 INFO L280 TraceCheckUtils]: 49: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,512 INFO L263 TraceCheckUtils]: 50: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,512 INFO L280 TraceCheckUtils]: 51: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,512 INFO L280 TraceCheckUtils]: 52: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,512 INFO L280 TraceCheckUtils]: 53: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,512 INFO L280 TraceCheckUtils]: 54: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,513 INFO L280 TraceCheckUtils]: 55: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,513 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,513 INFO L280 TraceCheckUtils]: 57: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,513 INFO L263 TraceCheckUtils]: 58: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,513 INFO L280 TraceCheckUtils]: 59: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,514 INFO L280 TraceCheckUtils]: 60: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,514 INFO L280 TraceCheckUtils]: 61: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,514 INFO L280 TraceCheckUtils]: 62: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,514 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,514 INFO L280 TraceCheckUtils]: 64: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,515 INFO L280 TraceCheckUtils]: 65: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,515 INFO L280 TraceCheckUtils]: 66: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,515 INFO L280 TraceCheckUtils]: 67: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,515 INFO L280 TraceCheckUtils]: 68: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,517 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4571#true} {5159#(<= |fibonacci_#in~n| 4)} #40#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,518 INFO L280 TraceCheckUtils]: 70: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,519 INFO L280 TraceCheckUtils]: 71: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,520 INFO L280 TraceCheckUtils]: 72: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,520 INFO L280 TraceCheckUtils]: 73: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,521 INFO L280 TraceCheckUtils]: 74: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume true; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,523 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {5159#(<= |fibonacci_#in~n| 4)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,558 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,563 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,563 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,566 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,568 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,568 INFO L263 TraceCheckUtils]: 11: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,569 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,570 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,570 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,571 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,577 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,578 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,578 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,579 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,580 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,581 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,581 INFO L263 TraceCheckUtils]: 7: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,583 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,584 INFO L263 TraceCheckUtils]: 15: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,584 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,585 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,585 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,586 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,586 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,586 INFO L280 TraceCheckUtils]: 22: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,587 INFO L280 TraceCheckUtils]: 23: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,587 INFO L280 TraceCheckUtils]: 24: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,587 INFO L280 TraceCheckUtils]: 25: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,588 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,588 INFO L280 TraceCheckUtils]: 27: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,588 INFO L263 TraceCheckUtils]: 28: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,589 INFO L280 TraceCheckUtils]: 29: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,589 INFO L280 TraceCheckUtils]: 30: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,589 INFO L280 TraceCheckUtils]: 31: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,590 INFO L280 TraceCheckUtils]: 32: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,590 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,590 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,591 INFO L280 TraceCheckUtils]: 35: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,591 INFO L280 TraceCheckUtils]: 36: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,591 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,592 INFO L280 TraceCheckUtils]: 38: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,592 INFO L280 TraceCheckUtils]: 39: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,593 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4571#true} {5076#(<= |fibonacci_#in~n| 5)} #40#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,598 INFO L263 TraceCheckUtils]: 3: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,599 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,600 INFO L280 TraceCheckUtils]: 5: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,601 INFO L280 TraceCheckUtils]: 6: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,601 INFO L263 TraceCheckUtils]: 7: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,604 INFO L263 TraceCheckUtils]: 11: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,607 INFO L263 TraceCheckUtils]: 15: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,608 INFO L280 TraceCheckUtils]: 17: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,610 INFO L280 TraceCheckUtils]: 19: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,613 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,614 INFO L280 TraceCheckUtils]: 22: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,614 INFO L263 TraceCheckUtils]: 23: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,615 INFO L280 TraceCheckUtils]: 25: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,615 INFO L280 TraceCheckUtils]: 26: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,615 INFO L280 TraceCheckUtils]: 27: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,616 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,617 INFO L280 TraceCheckUtils]: 29: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,618 INFO L280 TraceCheckUtils]: 30: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,619 INFO L280 TraceCheckUtils]: 31: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,620 INFO L280 TraceCheckUtils]: 32: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,620 INFO L280 TraceCheckUtils]: 33: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume true; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,622 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5219#(<= |fibonacci_#in~n| 2)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,623 INFO L280 TraceCheckUtils]: 35: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,623 INFO L263 TraceCheckUtils]: 36: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,623 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,624 INFO L280 TraceCheckUtils]: 38: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,624 INFO L280 TraceCheckUtils]: 39: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,624 INFO L280 TraceCheckUtils]: 40: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,625 INFO L280 TraceCheckUtils]: 41: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,626 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4571#true} {5206#(<= |fibonacci_#in~n| 3)} #40#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,627 INFO L280 TraceCheckUtils]: 43: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,627 INFO L280 TraceCheckUtils]: 44: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,628 INFO L280 TraceCheckUtils]: 45: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,628 INFO L280 TraceCheckUtils]: 46: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,629 INFO L280 TraceCheckUtils]: 47: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume true; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,630 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5206#(<= |fibonacci_#in~n| 3)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,631 INFO L280 TraceCheckUtils]: 49: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,631 INFO L263 TraceCheckUtils]: 50: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,631 INFO L280 TraceCheckUtils]: 51: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,631 INFO L280 TraceCheckUtils]: 52: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,631 INFO L280 TraceCheckUtils]: 53: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,632 INFO L263 TraceCheckUtils]: 54: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,632 INFO L280 TraceCheckUtils]: 55: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,632 INFO L280 TraceCheckUtils]: 56: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,632 INFO L280 TraceCheckUtils]: 57: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,632 INFO L280 TraceCheckUtils]: 58: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,633 INFO L280 TraceCheckUtils]: 59: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,633 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,633 INFO L280 TraceCheckUtils]: 61: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,634 INFO L263 TraceCheckUtils]: 62: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,634 INFO L280 TraceCheckUtils]: 63: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,634 INFO L280 TraceCheckUtils]: 64: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,635 INFO L280 TraceCheckUtils]: 65: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,635 INFO L280 TraceCheckUtils]: 66: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,635 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,636 INFO L280 TraceCheckUtils]: 68: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,636 INFO L280 TraceCheckUtils]: 69: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,636 INFO L280 TraceCheckUtils]: 70: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,637 INFO L280 TraceCheckUtils]: 71: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,637 INFO L280 TraceCheckUtils]: 72: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,638 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {4571#true} {5159#(<= |fibonacci_#in~n| 4)} #40#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,639 INFO L280 TraceCheckUtils]: 74: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,640 INFO L280 TraceCheckUtils]: 75: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,641 INFO L280 TraceCheckUtils]: 76: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,642 INFO L280 TraceCheckUtils]: 77: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,643 INFO L280 TraceCheckUtils]: 78: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume true; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,644 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {5159#(<= |fibonacci_#in~n| 4)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,645 INFO L280 TraceCheckUtils]: 80: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,646 INFO L263 TraceCheckUtils]: 81: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,646 INFO L280 TraceCheckUtils]: 82: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,646 INFO L280 TraceCheckUtils]: 83: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,647 INFO L280 TraceCheckUtils]: 84: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,647 INFO L263 TraceCheckUtils]: 85: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,647 INFO L280 TraceCheckUtils]: 86: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,647 INFO L280 TraceCheckUtils]: 87: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,648 INFO L280 TraceCheckUtils]: 88: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,648 INFO L263 TraceCheckUtils]: 89: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,648 INFO L280 TraceCheckUtils]: 90: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,649 INFO L280 TraceCheckUtils]: 91: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,649 INFO L280 TraceCheckUtils]: 92: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,649 INFO L280 TraceCheckUtils]: 93: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,650 INFO L280 TraceCheckUtils]: 94: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,650 INFO L275 TraceCheckUtils]: 95: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,651 INFO L280 TraceCheckUtils]: 96: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,651 INFO L263 TraceCheckUtils]: 97: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,651 INFO L280 TraceCheckUtils]: 98: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,651 INFO L280 TraceCheckUtils]: 99: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,652 INFO L280 TraceCheckUtils]: 100: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,652 INFO L280 TraceCheckUtils]: 101: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,652 INFO L275 TraceCheckUtils]: 102: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,653 INFO L280 TraceCheckUtils]: 103: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,653 INFO L280 TraceCheckUtils]: 104: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,653 INFO L280 TraceCheckUtils]: 105: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,654 INFO L280 TraceCheckUtils]: 106: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,654 INFO L280 TraceCheckUtils]: 107: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,654 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,655 INFO L280 TraceCheckUtils]: 109: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,655 INFO L263 TraceCheckUtils]: 110: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,655 INFO L280 TraceCheckUtils]: 111: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,656 INFO L280 TraceCheckUtils]: 112: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,656 INFO L280 TraceCheckUtils]: 113: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,656 INFO L280 TraceCheckUtils]: 114: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,657 INFO L280 TraceCheckUtils]: 115: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,657 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,657 INFO L280 TraceCheckUtils]: 117: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,658 INFO L280 TraceCheckUtils]: 118: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,658 INFO L280 TraceCheckUtils]: 119: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,658 INFO L280 TraceCheckUtils]: 120: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,659 INFO L280 TraceCheckUtils]: 121: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,660 INFO L275 TraceCheckUtils]: 122: Hoare quadruple {4571#true} {5076#(<= |fibonacci_#in~n| 5)} #40#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,661 INFO L280 TraceCheckUtils]: 123: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,662 INFO L280 TraceCheckUtils]: 124: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} #res := #t~ret0 + #t~ret1; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,662 INFO L280 TraceCheckUtils]: 125: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} havoc #t~ret0; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,663 INFO L280 TraceCheckUtils]: 126: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} havoc #t~ret1; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,664 INFO L280 TraceCheckUtils]: 127: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume true; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,666 INFO L275 TraceCheckUtils]: 128: Hoare quadruple {5076#(<= |fibonacci_#in~n| 5)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,740 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,745 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,746 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,747 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,748 INFO L280 TraceCheckUtils]: 7: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,749 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,749 INFO L263 TraceCheckUtils]: 11: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,749 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,750 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,750 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,750 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,750 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,751 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,751 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,751 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,752 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,756 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,756 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,757 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,757 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,758 INFO L263 TraceCheckUtils]: 7: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,758 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,758 INFO L280 TraceCheckUtils]: 11: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,759 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,759 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,759 INFO L263 TraceCheckUtils]: 15: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,760 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,760 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,760 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,761 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,761 INFO L280 TraceCheckUtils]: 22: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,761 INFO L280 TraceCheckUtils]: 23: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,761 INFO L280 TraceCheckUtils]: 25: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,762 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,762 INFO L263 TraceCheckUtils]: 28: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,762 INFO L280 TraceCheckUtils]: 29: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,762 INFO L280 TraceCheckUtils]: 30: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,763 INFO L280 TraceCheckUtils]: 31: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,763 INFO L280 TraceCheckUtils]: 32: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,763 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,763 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,763 INFO L280 TraceCheckUtils]: 35: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,764 INFO L280 TraceCheckUtils]: 36: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,764 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,764 INFO L280 TraceCheckUtils]: 38: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,764 INFO L280 TraceCheckUtils]: 39: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,765 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,779 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:23,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,785 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,786 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,787 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,788 INFO L263 TraceCheckUtils]: 11: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,788 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,788 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,788 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,788 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,789 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,789 INFO L280 TraceCheckUtils]: 17: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,789 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,789 INFO L280 TraceCheckUtils]: 19: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,790 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,790 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,790 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,791 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,791 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,791 INFO L280 TraceCheckUtils]: 5: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,792 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,792 INFO L263 TraceCheckUtils]: 7: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,792 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,792 INFO L280 TraceCheckUtils]: 9: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,792 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,793 INFO L263 TraceCheckUtils]: 11: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,793 INFO L280 TraceCheckUtils]: 13: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,793 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,793 INFO L280 TraceCheckUtils]: 15: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,794 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,794 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,794 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,794 INFO L263 TraceCheckUtils]: 19: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,794 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,795 INFO L280 TraceCheckUtils]: 21: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,795 INFO L280 TraceCheckUtils]: 22: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,795 INFO L280 TraceCheckUtils]: 23: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,795 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,795 INFO L280 TraceCheckUtils]: 25: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,796 INFO L280 TraceCheckUtils]: 26: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,796 INFO L280 TraceCheckUtils]: 27: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,796 INFO L280 TraceCheckUtils]: 28: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,796 INFO L280 TraceCheckUtils]: 29: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,796 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,797 INFO L280 TraceCheckUtils]: 31: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,797 INFO L263 TraceCheckUtils]: 32: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,797 INFO L280 TraceCheckUtils]: 33: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,797 INFO L280 TraceCheckUtils]: 34: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,797 INFO L280 TraceCheckUtils]: 35: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,798 INFO L280 TraceCheckUtils]: 36: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,798 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,798 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,798 INFO L280 TraceCheckUtils]: 39: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,798 INFO L280 TraceCheckUtils]: 40: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,799 INFO L280 TraceCheckUtils]: 41: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,799 INFO L280 TraceCheckUtils]: 42: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,799 INFO L280 TraceCheckUtils]: 43: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,799 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,800 INFO L280 TraceCheckUtils]: 45: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,800 INFO L263 TraceCheckUtils]: 46: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,800 INFO L280 TraceCheckUtils]: 47: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,800 INFO L280 TraceCheckUtils]: 48: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,800 INFO L280 TraceCheckUtils]: 49: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,801 INFO L263 TraceCheckUtils]: 50: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,801 INFO L280 TraceCheckUtils]: 51: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,801 INFO L280 TraceCheckUtils]: 52: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,801 INFO L280 TraceCheckUtils]: 53: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,801 INFO L280 TraceCheckUtils]: 54: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,802 INFO L280 TraceCheckUtils]: 55: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,802 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,802 INFO L280 TraceCheckUtils]: 57: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,802 INFO L263 TraceCheckUtils]: 58: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,802 INFO L280 TraceCheckUtils]: 59: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,803 INFO L280 TraceCheckUtils]: 60: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,803 INFO L280 TraceCheckUtils]: 61: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,803 INFO L280 TraceCheckUtils]: 62: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,803 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,803 INFO L280 TraceCheckUtils]: 64: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,804 INFO L280 TraceCheckUtils]: 65: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,804 INFO L280 TraceCheckUtils]: 66: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,804 INFO L280 TraceCheckUtils]: 67: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,804 INFO L280 TraceCheckUtils]: 68: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,804 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,805 INFO L280 TraceCheckUtils]: 70: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,805 INFO L280 TraceCheckUtils]: 71: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,805 INFO L280 TraceCheckUtils]: 72: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,805 INFO L280 TraceCheckUtils]: 73: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,805 INFO L280 TraceCheckUtils]: 74: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,806 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4571#true} {4923#(<= |fibonacci_#in~n| 6)} #40#return; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,811 INFO L263 TraceCheckUtils]: 3: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,814 INFO L263 TraceCheckUtils]: 7: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,816 INFO L263 TraceCheckUtils]: 11: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,817 INFO L280 TraceCheckUtils]: 13: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,818 INFO L263 TraceCheckUtils]: 15: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,818 INFO L280 TraceCheckUtils]: 16: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,820 INFO L263 TraceCheckUtils]: 19: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,820 INFO L280 TraceCheckUtils]: 20: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,821 INFO L280 TraceCheckUtils]: 21: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,822 INFO L280 TraceCheckUtils]: 22: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,822 INFO L280 TraceCheckUtils]: 23: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,823 INFO L280 TraceCheckUtils]: 24: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,824 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,824 INFO L280 TraceCheckUtils]: 26: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,825 INFO L263 TraceCheckUtils]: 27: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,825 INFO L280 TraceCheckUtils]: 28: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,825 INFO L280 TraceCheckUtils]: 29: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,825 INFO L280 TraceCheckUtils]: 30: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,826 INFO L280 TraceCheckUtils]: 31: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,826 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,827 INFO L280 TraceCheckUtils]: 33: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,827 INFO L280 TraceCheckUtils]: 34: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,828 INFO L280 TraceCheckUtils]: 35: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,828 INFO L280 TraceCheckUtils]: 36: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,829 INFO L280 TraceCheckUtils]: 37: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume true; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,830 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {5219#(<= |fibonacci_#in~n| 2)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,831 INFO L280 TraceCheckUtils]: 39: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,831 INFO L263 TraceCheckUtils]: 40: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,831 INFO L280 TraceCheckUtils]: 41: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,831 INFO L280 TraceCheckUtils]: 42: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,831 INFO L280 TraceCheckUtils]: 43: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,832 INFO L280 TraceCheckUtils]: 44: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,832 INFO L280 TraceCheckUtils]: 45: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,833 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4571#true} {5206#(<= |fibonacci_#in~n| 3)} #40#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,833 INFO L280 TraceCheckUtils]: 47: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,834 INFO L280 TraceCheckUtils]: 48: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,834 INFO L280 TraceCheckUtils]: 49: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,835 INFO L280 TraceCheckUtils]: 50: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,835 INFO L280 TraceCheckUtils]: 51: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume true; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,837 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {5206#(<= |fibonacci_#in~n| 3)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,837 INFO L280 TraceCheckUtils]: 53: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,837 INFO L263 TraceCheckUtils]: 54: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,837 INFO L280 TraceCheckUtils]: 55: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,838 INFO L280 TraceCheckUtils]: 56: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,838 INFO L280 TraceCheckUtils]: 57: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,838 INFO L263 TraceCheckUtils]: 58: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,838 INFO L280 TraceCheckUtils]: 59: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,838 INFO L280 TraceCheckUtils]: 60: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,839 INFO L280 TraceCheckUtils]: 61: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,839 INFO L280 TraceCheckUtils]: 62: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,839 INFO L280 TraceCheckUtils]: 63: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,839 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,839 INFO L280 TraceCheckUtils]: 65: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,839 INFO L263 TraceCheckUtils]: 66: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,840 INFO L280 TraceCheckUtils]: 67: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,840 INFO L280 TraceCheckUtils]: 68: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,840 INFO L280 TraceCheckUtils]: 69: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,840 INFO L280 TraceCheckUtils]: 70: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,840 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,841 INFO L280 TraceCheckUtils]: 72: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,841 INFO L280 TraceCheckUtils]: 73: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,841 INFO L280 TraceCheckUtils]: 74: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,841 INFO L280 TraceCheckUtils]: 75: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,841 INFO L280 TraceCheckUtils]: 76: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,842 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {4571#true} {5159#(<= |fibonacci_#in~n| 4)} #40#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,843 INFO L280 TraceCheckUtils]: 78: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,843 INFO L280 TraceCheckUtils]: 79: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,844 INFO L280 TraceCheckUtils]: 80: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,844 INFO L280 TraceCheckUtils]: 81: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,845 INFO L280 TraceCheckUtils]: 82: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume true; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,846 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {5159#(<= |fibonacci_#in~n| 4)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,846 INFO L280 TraceCheckUtils]: 84: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,846 INFO L263 TraceCheckUtils]: 85: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,847 INFO L280 TraceCheckUtils]: 86: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,847 INFO L280 TraceCheckUtils]: 87: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,847 INFO L280 TraceCheckUtils]: 88: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,847 INFO L263 TraceCheckUtils]: 89: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,847 INFO L280 TraceCheckUtils]: 90: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,847 INFO L280 TraceCheckUtils]: 91: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,848 INFO L280 TraceCheckUtils]: 92: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,848 INFO L263 TraceCheckUtils]: 93: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,848 INFO L280 TraceCheckUtils]: 94: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,848 INFO L280 TraceCheckUtils]: 95: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,848 INFO L280 TraceCheckUtils]: 96: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,849 INFO L280 TraceCheckUtils]: 97: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,849 INFO L280 TraceCheckUtils]: 98: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,849 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,849 INFO L280 TraceCheckUtils]: 100: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,849 INFO L263 TraceCheckUtils]: 101: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,850 INFO L280 TraceCheckUtils]: 102: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,850 INFO L280 TraceCheckUtils]: 103: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,850 INFO L280 TraceCheckUtils]: 104: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,850 INFO L280 TraceCheckUtils]: 105: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,850 INFO L275 TraceCheckUtils]: 106: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,850 INFO L280 TraceCheckUtils]: 107: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,851 INFO L280 TraceCheckUtils]: 108: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,851 INFO L280 TraceCheckUtils]: 109: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,851 INFO L280 TraceCheckUtils]: 110: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,851 INFO L280 TraceCheckUtils]: 111: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,851 INFO L275 TraceCheckUtils]: 112: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,852 INFO L280 TraceCheckUtils]: 113: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,852 INFO L263 TraceCheckUtils]: 114: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,852 INFO L280 TraceCheckUtils]: 115: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,852 INFO L280 TraceCheckUtils]: 116: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,852 INFO L280 TraceCheckUtils]: 117: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,852 INFO L280 TraceCheckUtils]: 118: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,853 INFO L280 TraceCheckUtils]: 119: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,853 INFO L275 TraceCheckUtils]: 120: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,853 INFO L280 TraceCheckUtils]: 121: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,853 INFO L280 TraceCheckUtils]: 122: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,853 INFO L280 TraceCheckUtils]: 123: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,854 INFO L280 TraceCheckUtils]: 124: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,854 INFO L280 TraceCheckUtils]: 125: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,855 INFO L275 TraceCheckUtils]: 126: Hoare quadruple {4571#true} {5076#(<= |fibonacci_#in~n| 5)} #40#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,855 INFO L280 TraceCheckUtils]: 127: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,856 INFO L280 TraceCheckUtils]: 128: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} #res := #t~ret0 + #t~ret1; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,856 INFO L280 TraceCheckUtils]: 129: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} havoc #t~ret0; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,857 INFO L280 TraceCheckUtils]: 130: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} havoc #t~ret1; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,857 INFO L280 TraceCheckUtils]: 131: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume true; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,858 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {5076#(<= |fibonacci_#in~n| 5)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,859 INFO L280 TraceCheckUtils]: 133: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,859 INFO L263 TraceCheckUtils]: 134: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,859 INFO L280 TraceCheckUtils]: 135: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,859 INFO L280 TraceCheckUtils]: 136: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,860 INFO L280 TraceCheckUtils]: 137: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,860 INFO L263 TraceCheckUtils]: 138: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,860 INFO L280 TraceCheckUtils]: 139: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,860 INFO L280 TraceCheckUtils]: 140: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,860 INFO L280 TraceCheckUtils]: 141: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,860 INFO L263 TraceCheckUtils]: 142: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,861 INFO L280 TraceCheckUtils]: 143: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,861 INFO L280 TraceCheckUtils]: 144: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,861 INFO L280 TraceCheckUtils]: 145: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,861 INFO L263 TraceCheckUtils]: 146: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,861 INFO L280 TraceCheckUtils]: 147: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,862 INFO L280 TraceCheckUtils]: 148: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,862 INFO L280 TraceCheckUtils]: 149: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,862 INFO L280 TraceCheckUtils]: 150: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,862 INFO L280 TraceCheckUtils]: 151: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,862 INFO L275 TraceCheckUtils]: 152: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,862 INFO L280 TraceCheckUtils]: 153: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,863 INFO L263 TraceCheckUtils]: 154: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,863 INFO L280 TraceCheckUtils]: 155: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,863 INFO L280 TraceCheckUtils]: 156: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,863 INFO L280 TraceCheckUtils]: 157: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,863 INFO L280 TraceCheckUtils]: 158: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,864 INFO L275 TraceCheckUtils]: 159: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,864 INFO L280 TraceCheckUtils]: 160: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,864 INFO L280 TraceCheckUtils]: 161: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,864 INFO L280 TraceCheckUtils]: 162: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,864 INFO L280 TraceCheckUtils]: 163: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,864 INFO L280 TraceCheckUtils]: 164: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,865 INFO L275 TraceCheckUtils]: 165: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,865 INFO L280 TraceCheckUtils]: 166: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,865 INFO L263 TraceCheckUtils]: 167: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,865 INFO L280 TraceCheckUtils]: 168: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,865 INFO L280 TraceCheckUtils]: 169: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,866 INFO L280 TraceCheckUtils]: 170: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,866 INFO L280 TraceCheckUtils]: 171: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,866 INFO L280 TraceCheckUtils]: 172: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,866 INFO L275 TraceCheckUtils]: 173: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,866 INFO L280 TraceCheckUtils]: 174: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,867 INFO L280 TraceCheckUtils]: 175: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,867 INFO L280 TraceCheckUtils]: 176: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,867 INFO L280 TraceCheckUtils]: 177: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,867 INFO L280 TraceCheckUtils]: 178: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,867 INFO L275 TraceCheckUtils]: 179: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,867 INFO L280 TraceCheckUtils]: 180: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,868 INFO L263 TraceCheckUtils]: 181: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,868 INFO L280 TraceCheckUtils]: 182: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,868 INFO L280 TraceCheckUtils]: 183: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,868 INFO L280 TraceCheckUtils]: 184: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,868 INFO L263 TraceCheckUtils]: 185: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,869 INFO L280 TraceCheckUtils]: 186: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,869 INFO L280 TraceCheckUtils]: 187: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,869 INFO L280 TraceCheckUtils]: 188: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,869 INFO L280 TraceCheckUtils]: 189: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,869 INFO L280 TraceCheckUtils]: 190: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,870 INFO L275 TraceCheckUtils]: 191: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,870 INFO L280 TraceCheckUtils]: 192: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,870 INFO L263 TraceCheckUtils]: 193: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,870 INFO L280 TraceCheckUtils]: 194: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,870 INFO L280 TraceCheckUtils]: 195: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,871 INFO L280 TraceCheckUtils]: 196: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,871 INFO L280 TraceCheckUtils]: 197: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,871 INFO L275 TraceCheckUtils]: 198: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,871 INFO L280 TraceCheckUtils]: 199: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,872 INFO L280 TraceCheckUtils]: 200: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,872 INFO L280 TraceCheckUtils]: 201: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,872 INFO L280 TraceCheckUtils]: 202: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,872 INFO L280 TraceCheckUtils]: 203: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,872 INFO L275 TraceCheckUtils]: 204: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,873 INFO L280 TraceCheckUtils]: 205: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,873 INFO L280 TraceCheckUtils]: 206: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,873 INFO L280 TraceCheckUtils]: 207: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,873 INFO L280 TraceCheckUtils]: 208: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,873 INFO L280 TraceCheckUtils]: 209: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,874 INFO L275 TraceCheckUtils]: 210: Hoare quadruple {4571#true} {4923#(<= |fibonacci_#in~n| 6)} #40#return; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,875 INFO L280 TraceCheckUtils]: 211: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,876 INFO L280 TraceCheckUtils]: 212: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} #res := #t~ret0 + #t~ret1; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,876 INFO L280 TraceCheckUtils]: 213: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} havoc #t~ret0; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,877 INFO L280 TraceCheckUtils]: 214: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} havoc #t~ret1; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,877 INFO L280 TraceCheckUtils]: 215: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} assume true; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,878 INFO L275 TraceCheckUtils]: 216: Hoare quadruple {4923#(<= |fibonacci_#in~n| 6)} {4575#(<= 9 main_~x~0)} #46#return; {4572#false} is VALID [2020-07-10 18:36:23,907 INFO L263 TraceCheckUtils]: 0: Hoare triple {4571#true} call ULTIMATE.init(); {4571#true} is VALID [2020-07-10 18:36:23,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,908 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4571#true} {4571#true} #42#return; {4571#true} is VALID [2020-07-10 18:36:23,908 INFO L263 TraceCheckUtils]: 3: Hoare triple {4571#true} call #t~ret3 := main(); {4571#true} is VALID [2020-07-10 18:36:23,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {4571#true} ~x~0 := 9; {4575#(<= 9 main_~x~0)} is VALID [2020-07-10 18:36:23,909 INFO L263 TraceCheckUtils]: 5: Hoare triple {4575#(<= 9 main_~x~0)} call #t~ret2 := fibonacci(~x~0); {4571#true} is VALID [2020-07-10 18:36:23,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,911 INFO L280 TraceCheckUtils]: 8: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,911 INFO L263 TraceCheckUtils]: 9: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,913 INFO L280 TraceCheckUtils]: 12: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,914 INFO L263 TraceCheckUtils]: 13: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,914 INFO L280 TraceCheckUtils]: 14: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,915 INFO L280 TraceCheckUtils]: 16: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,915 INFO L263 TraceCheckUtils]: 17: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,916 INFO L280 TraceCheckUtils]: 18: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,916 INFO L280 TraceCheckUtils]: 19: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,917 INFO L280 TraceCheckUtils]: 20: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,917 INFO L263 TraceCheckUtils]: 21: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,918 INFO L280 TraceCheckUtils]: 22: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,918 INFO L280 TraceCheckUtils]: 23: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,919 INFO L280 TraceCheckUtils]: 24: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,919 INFO L263 TraceCheckUtils]: 25: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,919 INFO L280 TraceCheckUtils]: 26: Hoare triple {4571#true} ~n := #in~n; {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,920 INFO L280 TraceCheckUtils]: 27: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4793#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:23,920 INFO L280 TraceCheckUtils]: 28: Hoare triple {4793#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,921 INFO L280 TraceCheckUtils]: 29: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} #res := 1; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,921 INFO L280 TraceCheckUtils]: 30: Hoare triple {5225#(<= |fibonacci_#in~n| 1)} assume true; {5225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:23,923 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {5225#(<= |fibonacci_#in~n| 1)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,923 INFO L280 TraceCheckUtils]: 32: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,923 INFO L263 TraceCheckUtils]: 33: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,923 INFO L280 TraceCheckUtils]: 34: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,924 INFO L280 TraceCheckUtils]: 35: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,924 INFO L280 TraceCheckUtils]: 36: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,924 INFO L280 TraceCheckUtils]: 37: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,925 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4571#true} {5219#(<= |fibonacci_#in~n| 2)} #40#return; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,925 INFO L280 TraceCheckUtils]: 39: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,926 INFO L280 TraceCheckUtils]: 40: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,926 INFO L280 TraceCheckUtils]: 41: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,927 INFO L280 TraceCheckUtils]: 42: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,927 INFO L280 TraceCheckUtils]: 43: Hoare triple {5219#(<= |fibonacci_#in~n| 2)} assume true; {5219#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:23,929 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5219#(<= |fibonacci_#in~n| 2)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,929 INFO L280 TraceCheckUtils]: 45: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,929 INFO L263 TraceCheckUtils]: 46: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,929 INFO L280 TraceCheckUtils]: 47: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,930 INFO L280 TraceCheckUtils]: 48: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,930 INFO L280 TraceCheckUtils]: 49: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,930 INFO L280 TraceCheckUtils]: 50: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,930 INFO L280 TraceCheckUtils]: 51: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,931 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4571#true} {5206#(<= |fibonacci_#in~n| 3)} #40#return; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,932 INFO L280 TraceCheckUtils]: 53: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,932 INFO L280 TraceCheckUtils]: 54: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,933 INFO L280 TraceCheckUtils]: 55: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,933 INFO L280 TraceCheckUtils]: 56: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,934 INFO L280 TraceCheckUtils]: 57: Hoare triple {5206#(<= |fibonacci_#in~n| 3)} assume true; {5206#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:23,935 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {5206#(<= |fibonacci_#in~n| 3)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,935 INFO L280 TraceCheckUtils]: 59: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,935 INFO L263 TraceCheckUtils]: 60: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,936 INFO L280 TraceCheckUtils]: 61: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,936 INFO L280 TraceCheckUtils]: 62: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,936 INFO L280 TraceCheckUtils]: 63: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,936 INFO L263 TraceCheckUtils]: 64: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,936 INFO L280 TraceCheckUtils]: 65: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,936 INFO L280 TraceCheckUtils]: 66: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,937 INFO L280 TraceCheckUtils]: 67: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,937 INFO L280 TraceCheckUtils]: 68: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,937 INFO L280 TraceCheckUtils]: 69: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,937 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,937 INFO L280 TraceCheckUtils]: 71: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,938 INFO L263 TraceCheckUtils]: 72: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,938 INFO L280 TraceCheckUtils]: 73: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,938 INFO L280 TraceCheckUtils]: 74: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,938 INFO L280 TraceCheckUtils]: 75: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,938 INFO L280 TraceCheckUtils]: 76: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,938 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,939 INFO L280 TraceCheckUtils]: 78: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,939 INFO L280 TraceCheckUtils]: 79: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,939 INFO L280 TraceCheckUtils]: 80: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,939 INFO L280 TraceCheckUtils]: 81: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,940 INFO L280 TraceCheckUtils]: 82: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,941 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {4571#true} {5159#(<= |fibonacci_#in~n| 4)} #40#return; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,941 INFO L280 TraceCheckUtils]: 84: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,942 INFO L280 TraceCheckUtils]: 85: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,942 INFO L280 TraceCheckUtils]: 86: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,943 INFO L280 TraceCheckUtils]: 87: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,944 INFO L280 TraceCheckUtils]: 88: Hoare triple {5159#(<= |fibonacci_#in~n| 4)} assume true; {5159#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:23,945 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {5159#(<= |fibonacci_#in~n| 4)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,946 INFO L280 TraceCheckUtils]: 90: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,946 INFO L263 TraceCheckUtils]: 91: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,946 INFO L280 TraceCheckUtils]: 92: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,946 INFO L280 TraceCheckUtils]: 93: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,946 INFO L280 TraceCheckUtils]: 94: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,947 INFO L263 TraceCheckUtils]: 95: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,947 INFO L280 TraceCheckUtils]: 96: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,947 INFO L280 TraceCheckUtils]: 97: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,947 INFO L280 TraceCheckUtils]: 98: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,947 INFO L263 TraceCheckUtils]: 99: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,948 INFO L280 TraceCheckUtils]: 100: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,948 INFO L280 TraceCheckUtils]: 101: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,948 INFO L280 TraceCheckUtils]: 102: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,948 INFO L280 TraceCheckUtils]: 103: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,948 INFO L280 TraceCheckUtils]: 104: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,949 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,949 INFO L280 TraceCheckUtils]: 106: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,949 INFO L263 TraceCheckUtils]: 107: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,949 INFO L280 TraceCheckUtils]: 108: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,949 INFO L280 TraceCheckUtils]: 109: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,950 INFO L280 TraceCheckUtils]: 110: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,950 INFO L280 TraceCheckUtils]: 111: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,950 INFO L275 TraceCheckUtils]: 112: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,950 INFO L280 TraceCheckUtils]: 113: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,950 INFO L280 TraceCheckUtils]: 114: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,950 INFO L280 TraceCheckUtils]: 115: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,951 INFO L280 TraceCheckUtils]: 116: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,951 INFO L280 TraceCheckUtils]: 117: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,951 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,951 INFO L280 TraceCheckUtils]: 119: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,951 INFO L263 TraceCheckUtils]: 120: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,951 INFO L280 TraceCheckUtils]: 121: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,952 INFO L280 TraceCheckUtils]: 122: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,952 INFO L280 TraceCheckUtils]: 123: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,952 INFO L280 TraceCheckUtils]: 124: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,952 INFO L280 TraceCheckUtils]: 125: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,952 INFO L275 TraceCheckUtils]: 126: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,953 INFO L280 TraceCheckUtils]: 127: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,953 INFO L280 TraceCheckUtils]: 128: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,953 INFO L280 TraceCheckUtils]: 129: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,953 INFO L280 TraceCheckUtils]: 130: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,953 INFO L280 TraceCheckUtils]: 131: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,954 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {4571#true} {5076#(<= |fibonacci_#in~n| 5)} #40#return; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,955 INFO L280 TraceCheckUtils]: 133: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,955 INFO L280 TraceCheckUtils]: 134: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} #res := #t~ret0 + #t~ret1; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,956 INFO L280 TraceCheckUtils]: 135: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} havoc #t~ret0; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,956 INFO L280 TraceCheckUtils]: 136: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} havoc #t~ret1; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,957 INFO L280 TraceCheckUtils]: 137: Hoare triple {5076#(<= |fibonacci_#in~n| 5)} assume true; {5076#(<= |fibonacci_#in~n| 5)} is VALID [2020-07-10 18:36:23,958 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {5076#(<= |fibonacci_#in~n| 5)} {4793#(= fibonacci_~n |fibonacci_#in~n|)} #38#return; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,958 INFO L280 TraceCheckUtils]: 139: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,959 INFO L263 TraceCheckUtils]: 140: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,959 INFO L280 TraceCheckUtils]: 141: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,959 INFO L280 TraceCheckUtils]: 142: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,959 INFO L280 TraceCheckUtils]: 143: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,959 INFO L263 TraceCheckUtils]: 144: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,960 INFO L280 TraceCheckUtils]: 145: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,960 INFO L280 TraceCheckUtils]: 146: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,960 INFO L280 TraceCheckUtils]: 147: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,960 INFO L263 TraceCheckUtils]: 148: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,960 INFO L280 TraceCheckUtils]: 149: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,961 INFO L280 TraceCheckUtils]: 150: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,961 INFO L280 TraceCheckUtils]: 151: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,961 INFO L263 TraceCheckUtils]: 152: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,961 INFO L280 TraceCheckUtils]: 153: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,961 INFO L280 TraceCheckUtils]: 154: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,962 INFO L280 TraceCheckUtils]: 155: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,962 INFO L280 TraceCheckUtils]: 156: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,962 INFO L280 TraceCheckUtils]: 157: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,962 INFO L275 TraceCheckUtils]: 158: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,962 INFO L280 TraceCheckUtils]: 159: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,962 INFO L263 TraceCheckUtils]: 160: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,963 INFO L280 TraceCheckUtils]: 161: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,963 INFO L280 TraceCheckUtils]: 162: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,963 INFO L280 TraceCheckUtils]: 163: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,963 INFO L280 TraceCheckUtils]: 164: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,963 INFO L275 TraceCheckUtils]: 165: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,964 INFO L280 TraceCheckUtils]: 166: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,964 INFO L280 TraceCheckUtils]: 167: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,964 INFO L280 TraceCheckUtils]: 168: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,964 INFO L280 TraceCheckUtils]: 169: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,964 INFO L280 TraceCheckUtils]: 170: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,964 INFO L275 TraceCheckUtils]: 171: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,965 INFO L280 TraceCheckUtils]: 172: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,965 INFO L263 TraceCheckUtils]: 173: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,965 INFO L280 TraceCheckUtils]: 174: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,965 INFO L280 TraceCheckUtils]: 175: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,965 INFO L280 TraceCheckUtils]: 176: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,965 INFO L280 TraceCheckUtils]: 177: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,966 INFO L280 TraceCheckUtils]: 178: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,966 INFO L275 TraceCheckUtils]: 179: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,966 INFO L280 TraceCheckUtils]: 180: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,966 INFO L280 TraceCheckUtils]: 181: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,966 INFO L280 TraceCheckUtils]: 182: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,967 INFO L280 TraceCheckUtils]: 183: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,967 INFO L280 TraceCheckUtils]: 184: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,967 INFO L275 TraceCheckUtils]: 185: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,967 INFO L280 TraceCheckUtils]: 186: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,967 INFO L263 TraceCheckUtils]: 187: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,967 INFO L280 TraceCheckUtils]: 188: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,968 INFO L280 TraceCheckUtils]: 189: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,968 INFO L280 TraceCheckUtils]: 190: Hoare triple {4571#true} assume !(1 == ~n); {4571#true} is VALID [2020-07-10 18:36:23,968 INFO L263 TraceCheckUtils]: 191: Hoare triple {4571#true} call #t~ret0 := fibonacci(~n - 1); {4571#true} is VALID [2020-07-10 18:36:23,968 INFO L280 TraceCheckUtils]: 192: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,968 INFO L280 TraceCheckUtils]: 193: Hoare triple {4571#true} assume !(~n < 1); {4571#true} is VALID [2020-07-10 18:36:23,968 INFO L280 TraceCheckUtils]: 194: Hoare triple {4571#true} assume 1 == ~n; {4571#true} is VALID [2020-07-10 18:36:23,969 INFO L280 TraceCheckUtils]: 195: Hoare triple {4571#true} #res := 1; {4571#true} is VALID [2020-07-10 18:36:23,969 INFO L280 TraceCheckUtils]: 196: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,969 INFO L275 TraceCheckUtils]: 197: Hoare quadruple {4571#true} {4571#true} #38#return; {4571#true} is VALID [2020-07-10 18:36:23,969 INFO L280 TraceCheckUtils]: 198: Hoare triple {4571#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,969 INFO L263 TraceCheckUtils]: 199: Hoare triple {4571#true} call #t~ret1 := fibonacci(~n - 2); {4571#true} is VALID [2020-07-10 18:36:23,969 INFO L280 TraceCheckUtils]: 200: Hoare triple {4571#true} ~n := #in~n; {4571#true} is VALID [2020-07-10 18:36:23,970 INFO L280 TraceCheckUtils]: 201: Hoare triple {4571#true} assume ~n < 1; {4571#true} is VALID [2020-07-10 18:36:23,970 INFO L280 TraceCheckUtils]: 202: Hoare triple {4571#true} #res := 0; {4571#true} is VALID [2020-07-10 18:36:23,970 INFO L280 TraceCheckUtils]: 203: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,970 INFO L275 TraceCheckUtils]: 204: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,970 INFO L280 TraceCheckUtils]: 205: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,971 INFO L280 TraceCheckUtils]: 206: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,971 INFO L280 TraceCheckUtils]: 207: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,971 INFO L280 TraceCheckUtils]: 208: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,971 INFO L280 TraceCheckUtils]: 209: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,971 INFO L275 TraceCheckUtils]: 210: Hoare quadruple {4571#true} {4571#true} #40#return; {4571#true} is VALID [2020-07-10 18:36:23,971 INFO L280 TraceCheckUtils]: 211: Hoare triple {4571#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4571#true} is VALID [2020-07-10 18:36:23,972 INFO L280 TraceCheckUtils]: 212: Hoare triple {4571#true} #res := #t~ret0 + #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,972 INFO L280 TraceCheckUtils]: 213: Hoare triple {4571#true} havoc #t~ret0; {4571#true} is VALID [2020-07-10 18:36:23,972 INFO L280 TraceCheckUtils]: 214: Hoare triple {4571#true} havoc #t~ret1; {4571#true} is VALID [2020-07-10 18:36:23,972 INFO L280 TraceCheckUtils]: 215: Hoare triple {4571#true} assume true; {4571#true} is VALID [2020-07-10 18:36:23,973 INFO L275 TraceCheckUtils]: 216: Hoare quadruple {4571#true} {4923#(<= |fibonacci_#in~n| 6)} #40#return; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,974 INFO L280 TraceCheckUtils]: 217: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,974 INFO L280 TraceCheckUtils]: 218: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} #res := #t~ret0 + #t~ret1; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,975 INFO L280 TraceCheckUtils]: 219: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} havoc #t~ret0; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,975 INFO L280 TraceCheckUtils]: 220: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} havoc #t~ret1; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,976 INFO L280 TraceCheckUtils]: 221: Hoare triple {4923#(<= |fibonacci_#in~n| 6)} assume true; {4923#(<= |fibonacci_#in~n| 6)} is VALID [2020-07-10 18:36:23,977 INFO L275 TraceCheckUtils]: 222: Hoare quadruple {4923#(<= |fibonacci_#in~n| 6)} {4575#(<= 9 main_~x~0)} #46#return; {4572#false} is VALID [2020-07-10 18:36:23,977 INFO L280 TraceCheckUtils]: 223: Hoare triple {4572#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4572#false} is VALID [2020-07-10 18:36:23,977 INFO L280 TraceCheckUtils]: 224: Hoare triple {4572#false} ~result~0 := #t~ret2; {4572#false} is VALID [2020-07-10 18:36:23,977 INFO L280 TraceCheckUtils]: 225: Hoare triple {4572#false} havoc #t~ret2; {4572#false} is VALID [2020-07-10 18:36:23,977 INFO L280 TraceCheckUtils]: 226: Hoare triple {4572#false} assume !(34 == ~result~0); {4572#false} is VALID [2020-07-10 18:36:23,978 INFO L280 TraceCheckUtils]: 227: Hoare triple {4572#false} assume !false; {4572#false} is VALID [2020-07-10 18:36:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2020-07-10 18:36:24,009 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:24,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748063048] [2020-07-10 18:36:24,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:24,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 18:36:24,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666173584] [2020-07-10 18:36:24,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2020-07-10 18:36:24,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:24,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 18:36:24,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:24,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 18:36:24,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 18:36:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:24,102 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 10 states. [2020-07-10 18:36:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:25,248 INFO L93 Difference]: Finished difference Result 248 states and 324 transitions. [2020-07-10 18:36:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 18:36:25,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2020-07-10 18:36:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:36:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2020-07-10 18:36:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:36:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2020-07-10 18:36:25,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 123 transitions. [2020-07-10 18:36:25,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:25,405 INFO L225 Difference]: With dead ends: 248 [2020-07-10 18:36:25,405 INFO L226 Difference]: Without dead ends: 242 [2020-07-10 18:36:25,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-10 18:36:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-10 18:36:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2020-07-10 18:36:25,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:25,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand 218 states. [2020-07-10 18:36:25,923 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 218 states. [2020-07-10 18:36:25,923 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 218 states. [2020-07-10 18:36:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:25,940 INFO L93 Difference]: Finished difference Result 242 states and 317 transitions. [2020-07-10 18:36:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 317 transitions. [2020-07-10 18:36:25,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:25,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:25,943 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 242 states. [2020-07-10 18:36:25,943 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 242 states. [2020-07-10 18:36:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:25,959 INFO L93 Difference]: Finished difference Result 242 states and 317 transitions. [2020-07-10 18:36:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 317 transitions. [2020-07-10 18:36:25,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:25,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:25,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:25,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-10 18:36:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 288 transitions. [2020-07-10 18:36:25,984 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 288 transitions. Word has length 228 [2020-07-10 18:36:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:25,985 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 288 transitions. [2020-07-10 18:36:25,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 18:36:25,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 218 states and 288 transitions. [2020-07-10 18:36:26,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 288 transitions. [2020-07-10 18:36:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2020-07-10 18:36:26,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:26,363 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:26,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 18:36:26,364 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1841895806, now seen corresponding path program 7 times [2020-07-10 18:36:26,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:26,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628440570] [2020-07-10 18:36:26,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 163 to 317 [2020-07-10 18:36:26,609 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.constructCopy(TransFormulaBuilder.java:503) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.fastupr.FastUPRFormulaBuilder.buildTransFormula(FastUPRFormulaBuilder.java:121) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.fastupr.FastUPRCore.getResult(FastUPRCore.java:428) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.Accelerator.fastUprAcceleration(Accelerator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.Accelerator.accelerateLoop(Accelerator.java:82) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:219) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 18:36:26,615 INFO L168 Benchmark]: Toolchain (without parser) took 15392.80 ms. Allocated memory was 136.8 MB in the beginning and 433.6 MB in the end (delta: 296.7 MB). Free memory was 101.7 MB in the beginning and 234.0 MB in the end (delta: -132.4 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,616 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.24 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 91.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,617 INFO L168 Benchmark]: Boogie Preprocessor took 22.37 ms. Allocated memory is still 136.8 MB. Free memory was 91.5 MB in the beginning and 90.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,617 INFO L168 Benchmark]: RCFGBuilder took 368.06 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.1 MB in the beginning and 162.8 MB in the end (delta: -72.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,618 INFO L168 Benchmark]: TraceAbstraction took 14722.33 ms. Allocated memory was 200.3 MB in the beginning and 433.6 MB in the end (delta: 233.3 MB). Free memory was 162.2 MB in the beginning and 234.0 MB in the end (delta: -71.9 MB). Peak memory consumption was 161.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,621 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.24 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 91.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.37 ms. Allocated memory is still 136.8 MB. Free memory was 91.5 MB in the beginning and 90.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.06 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.1 MB in the beginning and 162.8 MB in the end (delta: -72.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14722.33 ms. Allocated memory was 200.3 MB in the beginning and 433.6 MB in the end (delta: 233.3 MB). Free memory was 162.2 MB in the beginning and 234.0 MB in the end (delta: -71.9 MB). Peak memory consumption was 161.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:98) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...