/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/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:54:56,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:54:56,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:54:56,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:54:56,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:54:56,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:54:56,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:54:56,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:54:56,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:54:56,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:54:56,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:54:56,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:54:56,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:54:56,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:54:56,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:54:56,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:54:56,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:54:56,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:54:56,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:54:56,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:54:56,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:54:56,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:54:56,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:54:56,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:54:56,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:54:56,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:54:56,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:54:56,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:54:56,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:54:56,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:54:56,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:54:56,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:54:56,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:54:56,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:54:56,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:54:56,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:54:56,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:54:56,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:54:56,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:54:56,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:54:56,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:54:56,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:54:56,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:54:56,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:54:56,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:54:56,309 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:54:56,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:54:56,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:54:56,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:54:56,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:54:56,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:54:56,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:54:56,312 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:54:56,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:54:56,312 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:54:56,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:54:56,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:54:56,313 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:54:56,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:54:56,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:54:56,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:54:56,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:54:56,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:54:56,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:54:56,315 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:54:56,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:54:56,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:54:56,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:54:56,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:54:56,624 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:54:56,624 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-08 15:54:56,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55b90907/1a1f9c91ba9b4f1d9d4fb34c00fc7811/FLAGe1d5ef750 [2020-07-08 15:54:57,071 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:54:57,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-08 15:54:57,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55b90907/1a1f9c91ba9b4f1d9d4fb34c00fc7811/FLAGe1d5ef750 [2020-07-08 15:54:57,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55b90907/1a1f9c91ba9b4f1d9d4fb34c00fc7811 [2020-07-08 15:54:57,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:54:57,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:54:57,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:57,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:54:57,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:54:57,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d89557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57, skipping insertion in model container [2020-07-08 15:54:57,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:54:57,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:54:57,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:57,728 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:54:57,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:57,760 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:54:57,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57 WrapperNode [2020-07-08 15:54:57,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:57,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:54:57,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:54:57,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:54:57,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (1/1) ... [2020-07-08 15:54:57,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:54:57,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:54:57,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:54:57,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:54:57,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (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-08 15:54:57,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:54:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:54:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-08 15:54:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:54:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:54:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 15:54:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-08 15:54:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:54:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:54:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:54:58,257 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:54:58,258 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 15:54:58,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:58 BoogieIcfgContainer [2020-07-08 15:54:58,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:54:58,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:54:58,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:54:58,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:54:58,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:54:57" (1/3) ... [2020-07-08 15:54:58,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d284bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:58, skipping insertion in model container [2020-07-08 15:54:58,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:57" (2/3) ... [2020-07-08 15:54:58,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d284bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:58, skipping insertion in model container [2020-07-08 15:54:58,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:58" (3/3) ... [2020-07-08 15:54:58,286 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-08 15:54:58,297 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:54:58,304 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:54:58,316 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:54:58,337 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:54:58,337 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:54:58,337 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:54:58,337 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:54:58,337 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:54:58,338 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:54:58,338 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:54:58,338 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:54:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-08 15:54:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 15:54:58,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:58,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:54:58,361 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-08 15:54:58,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:58,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [588335310] [2020-07-08 15:54:58,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:58,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-08 15:54:58,559 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-08 15:54:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:58,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:58,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:58,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:58,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:58,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-08 15:54:58,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-08 15:54:58,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-08 15:54:58,622 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-08 15:54:58,623 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret4 := main(); {36#true} is VALID [2020-07-08 15:54:58,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#true} is VALID [2020-07-08 15:54:58,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~x~0 := #t~nondet2; {36#true} is VALID [2020-07-08 15:54:58,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet2; {36#true} is VALID [2020-07-08 15:54:58,624 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := fibonacci(~x~0); {36#true} is VALID [2020-07-08 15:54:58,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:58,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:58,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:58,629 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:58,631 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-08 15:54:58,632 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(<= main_~x~0 0)} is VALID [2020-07-08 15:54:58,633 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(<= main_~x~0 0)} ~result~0 := #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-08 15:54:58,634 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(<= main_~x~0 0)} havoc #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-08 15:54:58,635 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(<= main_~x~0 0)} assume !(5 != ~x~0 || 3 == ~result~0); {37#false} is VALID [2020-07-08 15:54:58,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-08 15:54:58,638 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-08 15:54:58,639 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:58,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [588335310] [2020-07-08 15:54:58,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:58,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 15:54:58,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670840437] [2020-07-08 15:54:58,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 15:54:58,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:58,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 15:54:58,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:58,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 15:54:58,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 15:54:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:54:58,711 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-08 15:54:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,010 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 15:54:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 15:54:59,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 15:54:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:54:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-08 15:54:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:54:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-08 15:54:59,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-08 15:54:59,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,136 INFO L225 Difference]: With dead ends: 48 [2020-07-08 15:54:59,136 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 15:54:59,139 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-08 15:54:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 15:54:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 15:54:59,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:59,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 15:54:59,207 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 15:54:59,207 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 15:54:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,214 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-08 15:54:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 15:54:59,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:59,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:59,216 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 15:54:59,216 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 15:54:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,221 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-08 15:54:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 15:54:59,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:59,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:59,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:59,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 15:54:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-08 15:54:59,228 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-08 15:54:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:59,229 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-08 15:54:59,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 15:54:59,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-08 15:54:59,275 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-08 15:54:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 15:54:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 15:54:59,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:59,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:54:59,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:54:59,278 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-08 15:54:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:59,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910738838] [2020-07-08 15:54:59,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-08 15:54:59,333 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-08 15:54:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:59,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:59,373 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:59,374 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-08 15:54:59,375 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-08 15:54:59,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-08 15:54:59,376 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-08 15:54:59,376 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret4 := main(); {268#true} is VALID [2020-07-08 15:54:59,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {268#true} is VALID [2020-07-08 15:54:59,377 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#true} ~x~0 := #t~nondet2; {268#true} is VALID [2020-07-08 15:54:59,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#true} havoc #t~nondet2; {268#true} is VALID [2020-07-08 15:54:59,377 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#true} call #t~ret3 := fibonacci(~x~0); {268#true} is VALID [2020-07-08 15:54:59,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:59,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:59,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:59,383 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-08 15:54:59,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {278#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {278#(<= main_~x~0 1)} is VALID [2020-07-08 15:54:59,384 INFO L280 TraceCheckUtils]: 15: Hoare triple {278#(<= main_~x~0 1)} ~result~0 := #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-08 15:54:59,385 INFO L280 TraceCheckUtils]: 16: Hoare triple {278#(<= main_~x~0 1)} havoc #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-08 15:54:59,386 INFO L280 TraceCheckUtils]: 17: Hoare triple {278#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {269#false} is VALID [2020-07-08 15:54:59,386 INFO L280 TraceCheckUtils]: 18: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-08 15:54:59,388 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-08 15:54:59,388 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:59,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910738838] [2020-07-08 15:54:59,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:59,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 15:54:59,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378172597] [2020-07-08 15:54:59,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 15:54:59,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:59,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 15:54:59,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 15:54:59,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 15:54:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:54:59,414 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-08 15:54:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,610 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-08 15:54:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 15:54:59,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 15:54:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:54:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-08 15:54:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 15:54:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-08 15:54:59,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-08 15:54:59,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,670 INFO L225 Difference]: With dead ends: 38 [2020-07-08 15:54:59,670 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 15:54:59,672 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-08 15:54:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 15:54:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-08 15:54:59,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:59,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-08 15:54:59,703 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-08 15:54:59,704 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-08 15:54:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,708 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-08 15:54:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-08 15:54:59,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:59,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:59,710 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-08 15:54:59,710 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-08 15:54:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,713 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-08 15:54:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-08 15:54:59,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:59,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:59,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:59,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 15:54:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-08 15:54:59,718 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-08 15:54:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:59,718 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-08 15:54:59,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 15:54:59,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-08 15:54:59,765 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-08 15:54:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 15:54:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 15:54:59,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:59,767 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, 1, 1] [2020-07-08 15:54:59,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:54:59,767 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-08 15:54:59,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:59,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910197324] [2020-07-08 15:54:59,769 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-08 15:54:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 15:54:59,887 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-08 15:54:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,967 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,968 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-08 15:54:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 15:54:59,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-08 15:54:59,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-08 15:54:59,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 15:54:59,977 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-08 15:54:59,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 15:54:59,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-08 15:54:59,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-08 15:54:59,980 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-08 15:54:59,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,983 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,984 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,986 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-08 15:54:59,986 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-08 15:54:59,987 INFO L263 TraceCheckUtils]: 10: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-08 15:54:59,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 15:54:59,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-08 15:54:59,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-08 15:54:59,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 15:54:59,989 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-08 15:54:59,989 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-08 15:54:59,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-08 15:54:59,990 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-08 15:54:59,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-08 15:54:59,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-08 15:54:59,991 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-08 15:54:59,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-08 15:54:59,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 15:54:59,993 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-08 15:54:59,993 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret4 := main(); {485#true} is VALID [2020-07-08 15:54:59,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {485#true} is VALID [2020-07-08 15:54:59,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := #t~nondet2; {485#true} is VALID [2020-07-08 15:54:59,995 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#true} havoc #t~nondet2; {485#true} is VALID [2020-07-08 15:54:59,995 INFO L263 TraceCheckUtils]: 7: Hoare triple {485#true} call #t~ret3 := fibonacci(~x~0); {485#true} is VALID [2020-07-08 15:54:59,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 15:54:59,996 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-08 15:54:59,997 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-08 15:54:59,998 INFO L263 TraceCheckUtils]: 11: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-08 15:54:59,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,000 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:00,001 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:00,002 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:00,004 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-08 15:55:00,004 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-08 15:55:00,004 INFO L263 TraceCheckUtils]: 18: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-08 15:55:00,005 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 15:55:00,005 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-08 15:55:00,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-08 15:55:00,006 INFO L280 TraceCheckUtils]: 22: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 15:55:00,006 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-08 15:55:00,006 INFO L280 TraceCheckUtils]: 24: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-08 15:55:00,007 INFO L280 TraceCheckUtils]: 25: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-08 15:55:00,007 INFO L280 TraceCheckUtils]: 26: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-08 15:55:00,008 INFO L280 TraceCheckUtils]: 27: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-08 15:55:00,008 INFO L280 TraceCheckUtils]: 28: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-08 15:55:00,008 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-08 15:55:00,015 INFO L280 TraceCheckUtils]: 30: Hoare triple {486#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {486#false} is VALID [2020-07-08 15:55:00,015 INFO L280 TraceCheckUtils]: 31: Hoare triple {486#false} ~result~0 := #t~ret3; {486#false} is VALID [2020-07-08 15:55:00,016 INFO L280 TraceCheckUtils]: 32: Hoare triple {486#false} havoc #t~ret3; {486#false} is VALID [2020-07-08 15:55:00,016 INFO L280 TraceCheckUtils]: 33: Hoare triple {486#false} assume !(5 != ~x~0 || 3 == ~result~0); {486#false} is VALID [2020-07-08 15:55:00,016 INFO L280 TraceCheckUtils]: 34: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-08 15:55:00,018 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-08 15:55:00,018 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:00,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910197324] [2020-07-08 15:55:00,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:00,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 15:55:00,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623152160] [2020-07-08 15:55:00,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 15:55:00,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:00,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 15:55:00,067 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-08 15:55:00,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 15:55:00,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 15:55:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:55:00,068 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-08 15:55:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:00,312 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-08 15:55:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:55:00,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 15:55:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:55:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-08 15:55:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:55:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-08 15:55:00,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-08 15:55:00,400 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-08 15:55:00,402 INFO L225 Difference]: With dead ends: 54 [2020-07-08 15:55:00,402 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 15:55:00,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 15:55:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 15:55:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 15:55:00,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:00,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 15:55:00,441 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 15:55:00,441 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 15:55:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:00,444 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-08 15:55:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 15:55:00,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:00,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:00,445 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 15:55:00,445 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 15:55:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:00,448 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-08 15:55:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 15:55:00,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:00,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:00,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:00,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 15:55:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-08 15:55:00,452 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-08 15:55:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:00,452 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-08 15:55:00,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 15:55:00,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2020-07-08 15:55:00,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 15:55:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 15:55:00,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:00,498 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, 1, 1] [2020-07-08 15:55:00,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:55:00,499 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-08 15:55:00,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:00,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340175065] [2020-07-08 15:55:00,500 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-08 15:55:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 15:55:00,583 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-08 15:55:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#(<= |fibonacci_#in~n| 1)} #res := 1; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#(<= |fibonacci_#in~n| 1)} assume true; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,661 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {813#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-08 15:55:00,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-08 15:55:00,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-08 15:55:00,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 15:55:00,672 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {771#true} {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,674 INFO L263 TraceCheckUtils]: 3: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-08 15:55:00,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,675 INFO L280 TraceCheckUtils]: 5: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {813#(<= |fibonacci_#in~n| 1)} #res := 1; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {813#(<= |fibonacci_#in~n| 1)} assume true; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,679 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {813#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,680 INFO L263 TraceCheckUtils]: 11: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-08 15:55:00,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-08 15:55:00,681 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-08 15:55:00,681 INFO L280 TraceCheckUtils]: 14: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-08 15:55:00,681 INFO L280 TraceCheckUtils]: 15: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 15:55:00,682 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {771#true} {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,683 INFO L280 TraceCheckUtils]: 17: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,684 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,684 INFO L280 TraceCheckUtils]: 19: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,685 INFO L280 TraceCheckUtils]: 20: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,685 INFO L280 TraceCheckUtils]: 21: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume true; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,687 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {812#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-08 15:55:00,688 INFO L263 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2020-07-08 15:55:00,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 15:55:00,688 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-08 15:55:00,688 INFO L263 TraceCheckUtils]: 3: Hoare triple {771#true} call #t~ret4 := main(); {771#true} is VALID [2020-07-08 15:55:00,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {771#true} is VALID [2020-07-08 15:55:00,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {771#true} ~x~0 := #t~nondet2; {771#true} is VALID [2020-07-08 15:55:00,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {771#true} havoc #t~nondet2; {771#true} is VALID [2020-07-08 15:55:00,689 INFO L263 TraceCheckUtils]: 7: Hoare triple {771#true} call #t~ret3 := fibonacci(~x~0); {771#true} is VALID [2020-07-08 15:55:00,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,691 INFO L263 TraceCheckUtils]: 11: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-08 15:55:00,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,693 INFO L280 TraceCheckUtils]: 13: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,694 INFO L280 TraceCheckUtils]: 15: Hoare triple {813#(<= |fibonacci_#in~n| 1)} #res := 1; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,695 INFO L280 TraceCheckUtils]: 16: Hoare triple {813#(<= |fibonacci_#in~n| 1)} assume true; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,696 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {813#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,697 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,697 INFO L263 TraceCheckUtils]: 19: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-08 15:55:00,697 INFO L280 TraceCheckUtils]: 20: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-08 15:55:00,698 INFO L280 TraceCheckUtils]: 21: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-08 15:55:00,698 INFO L280 TraceCheckUtils]: 22: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-08 15:55:00,698 INFO L280 TraceCheckUtils]: 23: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 15:55:00,699 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {771#true} {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,700 INFO L280 TraceCheckUtils]: 25: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,700 INFO L280 TraceCheckUtils]: 26: Hoare triple {812#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,701 INFO L280 TraceCheckUtils]: 27: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,702 INFO L280 TraceCheckUtils]: 28: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,702 INFO L280 TraceCheckUtils]: 29: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume true; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:00,703 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {812#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-08 15:55:00,704 INFO L280 TraceCheckUtils]: 31: Hoare triple {798#(<= main_~x~0 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {798#(<= main_~x~0 2)} is VALID [2020-07-08 15:55:00,704 INFO L280 TraceCheckUtils]: 32: Hoare triple {798#(<= main_~x~0 2)} ~result~0 := #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-08 15:55:00,705 INFO L280 TraceCheckUtils]: 33: Hoare triple {798#(<= main_~x~0 2)} havoc #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-08 15:55:00,706 INFO L280 TraceCheckUtils]: 34: Hoare triple {798#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {772#false} is VALID [2020-07-08 15:55:00,706 INFO L280 TraceCheckUtils]: 35: Hoare triple {772#false} assume !false; {772#false} is VALID [2020-07-08 15:55:00,718 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-08 15:55:00,718 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:00,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340175065] [2020-07-08 15:55:00,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:00,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 15:55:00,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395577046] [2020-07-08 15:55:00,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 15:55:00,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:00,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 15:55:00,755 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-08 15:55:00,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 15:55:00,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 15:55:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:55:00,757 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-07-08 15:55:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:01,114 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-08 15:55:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 15:55:01,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 15:55:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:55:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-08 15:55:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:55:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-08 15:55:01,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-08 15:55:01,218 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-08 15:55:01,226 INFO L225 Difference]: With dead ends: 58 [2020-07-08 15:55:01,226 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 15:55:01,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 15:55:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 15:55:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-08 15:55:01,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:01,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-08 15:55:01,302 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 15:55:01,303 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 15:55:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:01,309 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-08 15:55:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-08 15:55:01,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:01,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:01,311 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 15:55:01,312 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 15:55:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:01,324 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-08 15:55:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-08 15:55:01,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:01,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:01,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:01,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 15:55:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-08 15:55:01,335 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-08 15:55:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:01,335 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-08 15:55:01,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 15:55:01,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2020-07-08 15:55:01,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-08 15:55:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 15:55:01,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:01,427 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, 1, 1] [2020-07-08 15:55:01,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 15:55:01,429 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-08 15:55:01,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:01,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [959816002] [2020-07-08 15:55:01,430 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: 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-08 15:55:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,621 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1143#true} {1143#true} #44#return; {1143#true} is VALID [2020-07-08 15:55:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 15:55:01,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 15:55:01,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 15:55:01,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,723 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 15:55:01,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 15:55:01,734 INFO L280 TraceCheckUtils]: 3: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,735 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,738 INFO L263 TraceCheckUtils]: 3: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 15:55:01,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 15:55:01,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 15:55:01,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 15:55:01,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,740 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,741 INFO L280 TraceCheckUtils]: 10: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,741 INFO L263 TraceCheckUtils]: 11: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 12: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 14: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 15: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,744 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,744 INFO L280 TraceCheckUtils]: 17: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,745 INFO L280 TraceCheckUtils]: 18: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,747 INFO L280 TraceCheckUtils]: 21: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume true; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,748 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1230#(<= 2 |fibonacci_#in~n|)} {1143#true} #40#return; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} #res := 0; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,769 INFO L280 TraceCheckUtils]: 3: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} assume true; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,771 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1231#(<= |fibonacci_#in~n| 0)} {1210#(<= 3 fibonacci_~n)} #42#return; {1144#false} is VALID [2020-07-08 15:55:01,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 15:55:01,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {1143#true} assume !(1 == ~n); {1143#true} is VALID [2020-07-08 15:55:01,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {1143#true} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 15:55:01,773 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,773 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,774 INFO L280 TraceCheckUtils]: 6: Hoare triple {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,775 INFO L263 TraceCheckUtils]: 7: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 15:55:01,775 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,775 INFO L280 TraceCheckUtils]: 9: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 15:55:01,775 INFO L280 TraceCheckUtils]: 10: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 15:55:01,776 INFO L280 TraceCheckUtils]: 11: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 15:55:01,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,777 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,778 INFO L263 TraceCheckUtils]: 15: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 15:55:01,778 INFO L280 TraceCheckUtils]: 16: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,778 INFO L280 TraceCheckUtils]: 17: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 15:55:01,779 INFO L280 TraceCheckUtils]: 18: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 15:55:01,779 INFO L280 TraceCheckUtils]: 19: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,780 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,782 INFO L280 TraceCheckUtils]: 22: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,782 INFO L280 TraceCheckUtils]: 23: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,783 INFO L280 TraceCheckUtils]: 24: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,783 INFO L280 TraceCheckUtils]: 25: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume true; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,785 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1230#(<= 2 |fibonacci_#in~n|)} {1143#true} #40#return; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:01,785 INFO L280 TraceCheckUtils]: 27: Hoare triple {1210#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:01,785 INFO L263 TraceCheckUtils]: 28: Hoare triple {1210#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 15:55:01,786 INFO L280 TraceCheckUtils]: 29: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,787 INFO L280 TraceCheckUtils]: 30: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,787 INFO L280 TraceCheckUtils]: 31: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} #res := 0; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,788 INFO L280 TraceCheckUtils]: 32: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} assume true; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,789 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1231#(<= |fibonacci_#in~n| 0)} {1210#(<= 3 fibonacci_~n)} #42#return; {1144#false} is VALID [2020-07-08 15:55:01,789 INFO L280 TraceCheckUtils]: 34: Hoare triple {1144#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1144#false} is VALID [2020-07-08 15:55:01,790 INFO L280 TraceCheckUtils]: 35: Hoare triple {1144#false} #res := #t~ret0 + #t~ret1; {1144#false} is VALID [2020-07-08 15:55:01,790 INFO L280 TraceCheckUtils]: 36: Hoare triple {1144#false} havoc #t~ret0; {1144#false} is VALID [2020-07-08 15:55:01,790 INFO L280 TraceCheckUtils]: 37: Hoare triple {1144#false} havoc #t~ret1; {1144#false} is VALID [2020-07-08 15:55:01,790 INFO L280 TraceCheckUtils]: 38: Hoare triple {1144#false} assume true; {1144#false} is VALID [2020-07-08 15:55:01,791 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1144#false} {1143#true} #48#return; {1144#false} is VALID [2020-07-08 15:55:01,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {1143#true} call ULTIMATE.init(); {1143#true} is VALID [2020-07-08 15:55:01,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,793 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1143#true} {1143#true} #44#return; {1143#true} is VALID [2020-07-08 15:55:01,794 INFO L263 TraceCheckUtils]: 3: Hoare triple {1143#true} call #t~ret4 := main(); {1143#true} is VALID [2020-07-08 15:55:01,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1143#true} is VALID [2020-07-08 15:55:01,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {1143#true} ~x~0 := #t~nondet2; {1143#true} is VALID [2020-07-08 15:55:01,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {1143#true} havoc #t~nondet2; {1143#true} is VALID [2020-07-08 15:55:01,794 INFO L263 TraceCheckUtils]: 7: Hoare triple {1143#true} call #t~ret3 := fibonacci(~x~0); {1143#true} is VALID [2020-07-08 15:55:01,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,795 INFO L280 TraceCheckUtils]: 9: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 15:55:01,795 INFO L280 TraceCheckUtils]: 10: Hoare triple {1143#true} assume !(1 == ~n); {1143#true} is VALID [2020-07-08 15:55:01,795 INFO L263 TraceCheckUtils]: 11: Hoare triple {1143#true} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 15:55:01,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,798 INFO L263 TraceCheckUtils]: 15: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 15:55:01,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,798 INFO L280 TraceCheckUtils]: 17: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 15:55:01,799 INFO L280 TraceCheckUtils]: 18: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 15:55:01,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 15:55:01,799 INFO L280 TraceCheckUtils]: 20: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,800 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,801 INFO L280 TraceCheckUtils]: 22: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,801 INFO L263 TraceCheckUtils]: 23: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 15:55:01,801 INFO L280 TraceCheckUtils]: 24: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 15:55:01,801 INFO L280 TraceCheckUtils]: 25: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 15:55:01,802 INFO L280 TraceCheckUtils]: 26: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 15:55:01,802 INFO L280 TraceCheckUtils]: 27: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 15:55:01,803 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,803 INFO L280 TraceCheckUtils]: 29: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,804 INFO L280 TraceCheckUtils]: 30: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,805 INFO L280 TraceCheckUtils]: 31: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,805 INFO L280 TraceCheckUtils]: 32: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,806 INFO L280 TraceCheckUtils]: 33: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume true; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,807 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1230#(<= 2 |fibonacci_#in~n|)} {1143#true} #40#return; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:01,808 INFO L280 TraceCheckUtils]: 35: Hoare triple {1210#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:01,808 INFO L263 TraceCheckUtils]: 36: Hoare triple {1210#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 15:55:01,808 INFO L280 TraceCheckUtils]: 37: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,809 INFO L280 TraceCheckUtils]: 38: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,810 INFO L280 TraceCheckUtils]: 39: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} #res := 0; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,810 INFO L280 TraceCheckUtils]: 40: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} assume true; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:01,811 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1231#(<= |fibonacci_#in~n| 0)} {1210#(<= 3 fibonacci_~n)} #42#return; {1144#false} is VALID [2020-07-08 15:55:01,812 INFO L280 TraceCheckUtils]: 42: Hoare triple {1144#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1144#false} is VALID [2020-07-08 15:55:01,812 INFO L280 TraceCheckUtils]: 43: Hoare triple {1144#false} #res := #t~ret0 + #t~ret1; {1144#false} is VALID [2020-07-08 15:55:01,812 INFO L280 TraceCheckUtils]: 44: Hoare triple {1144#false} havoc #t~ret0; {1144#false} is VALID [2020-07-08 15:55:01,812 INFO L280 TraceCheckUtils]: 45: Hoare triple {1144#false} havoc #t~ret1; {1144#false} is VALID [2020-07-08 15:55:01,812 INFO L280 TraceCheckUtils]: 46: Hoare triple {1144#false} assume true; {1144#false} is VALID [2020-07-08 15:55:01,813 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1144#false} {1143#true} #48#return; {1144#false} is VALID [2020-07-08 15:55:01,813 INFO L280 TraceCheckUtils]: 48: Hoare triple {1144#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1144#false} is VALID [2020-07-08 15:55:01,813 INFO L280 TraceCheckUtils]: 49: Hoare triple {1144#false} ~result~0 := #t~ret3; {1144#false} is VALID [2020-07-08 15:55:01,813 INFO L280 TraceCheckUtils]: 50: Hoare triple {1144#false} havoc #t~ret3; {1144#false} is VALID [2020-07-08 15:55:01,814 INFO L280 TraceCheckUtils]: 51: Hoare triple {1144#false} assume !(5 != ~x~0 || 3 == ~result~0); {1144#false} is VALID [2020-07-08 15:55:01,814 INFO L280 TraceCheckUtils]: 52: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2020-07-08 15:55:01,817 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-08 15:55:01,817 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:01,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [959816002] [2020-07-08 15:55:01,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:01,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 15:55:01,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134812323] [2020-07-08 15:55:01,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-08 15:55:01,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:01,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 15:55:01,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:01,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 15:55:01,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 15:55:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 15:55:01,869 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 8 states. [2020-07-08 15:55:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:02,329 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-08 15:55:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 15:55:02,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-08 15:55:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 15:55:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-08 15:55:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 15:55:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-08 15:55:02,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-08 15:55:02,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:02,441 INFO L225 Difference]: With dead ends: 110 [2020-07-08 15:55:02,441 INFO L226 Difference]: Without dead ends: 66 [2020-07-08 15:55:02,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-08 15:55:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-08 15:55:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-08 15:55:02,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:02,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 54 states. [2020-07-08 15:55:02,529 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 54 states. [2020-07-08 15:55:02,529 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 54 states. [2020-07-08 15:55:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:02,535 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-08 15:55:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-08 15:55:02,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:02,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:02,536 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 66 states. [2020-07-08 15:55:02,536 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 66 states. [2020-07-08 15:55:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:02,541 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-08 15:55:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-08 15:55:02,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:02,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:02,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:02,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 15:55:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-08 15:55:02,546 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-08 15:55:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:02,547 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-08 15:55:02,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 15:55:02,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2020-07-08 15:55:02,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-08 15:55:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 15:55:02,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:02,632 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, 1, 1] [2020-07-08 15:55:02,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 15:55:02,632 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-08 15:55:02,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:02,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [157878974] [2020-07-08 15:55:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 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: 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-08 15:55:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,753 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1699#true} {1699#true} #44#return; {1699#true} is VALID [2020-07-08 15:55:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,848 INFO L280 TraceCheckUtils]: 3: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,849 INFO L280 TraceCheckUtils]: 4: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,850 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 15:55:02,856 INFO L280 TraceCheckUtils]: 2: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 15:55:02,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,858 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,860 INFO L263 TraceCheckUtils]: 3: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 15:55:02,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,864 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,865 INFO L280 TraceCheckUtils]: 10: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,865 INFO L263 TraceCheckUtils]: 11: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 15:55:02,865 INFO L280 TraceCheckUtils]: 12: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,866 INFO L280 TraceCheckUtils]: 13: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 15:55:02,866 INFO L280 TraceCheckUtils]: 14: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 15:55:02,866 INFO L280 TraceCheckUtils]: 15: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,867 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,868 INFO L280 TraceCheckUtils]: 17: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,868 INFO L280 TraceCheckUtils]: 18: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,869 INFO L280 TraceCheckUtils]: 19: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,869 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,870 INFO L280 TraceCheckUtils]: 21: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume true; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,881 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1789#(<= |fibonacci_#in~n| 2)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {1699#true} assume !(~n < 1); {1699#true} is VALID [2020-07-08 15:55:02,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {1699#true} assume 1 == ~n; {1699#true} is VALID [2020-07-08 15:55:02,908 INFO L280 TraceCheckUtils]: 3: Hoare triple {1699#true} #res := 1; {1699#true} is VALID [2020-07-08 15:55:02,908 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,920 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1699#true} {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,922 INFO L263 TraceCheckUtils]: 3: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 15:55:02,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,923 INFO L280 TraceCheckUtils]: 5: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,924 INFO L263 TraceCheckUtils]: 7: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 15:55:02,926 INFO L280 TraceCheckUtils]: 8: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,927 INFO L280 TraceCheckUtils]: 10: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,928 INFO L280 TraceCheckUtils]: 12: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,931 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,932 INFO L263 TraceCheckUtils]: 15: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 15:55:02,932 INFO L280 TraceCheckUtils]: 16: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,932 INFO L280 TraceCheckUtils]: 17: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 15:55:02,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 15:55:02,933 INFO L280 TraceCheckUtils]: 19: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,934 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,934 INFO L280 TraceCheckUtils]: 21: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,935 INFO L280 TraceCheckUtils]: 22: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,935 INFO L280 TraceCheckUtils]: 23: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,938 INFO L280 TraceCheckUtils]: 24: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,939 INFO L280 TraceCheckUtils]: 25: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume true; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,940 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1789#(<= |fibonacci_#in~n| 2)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,941 INFO L280 TraceCheckUtils]: 27: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,941 INFO L263 TraceCheckUtils]: 28: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 15:55:02,941 INFO L280 TraceCheckUtils]: 29: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,942 INFO L280 TraceCheckUtils]: 30: Hoare triple {1699#true} assume !(~n < 1); {1699#true} is VALID [2020-07-08 15:55:02,942 INFO L280 TraceCheckUtils]: 31: Hoare triple {1699#true} assume 1 == ~n; {1699#true} is VALID [2020-07-08 15:55:02,942 INFO L280 TraceCheckUtils]: 32: Hoare triple {1699#true} #res := 1; {1699#true} is VALID [2020-07-08 15:55:02,942 INFO L280 TraceCheckUtils]: 33: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,943 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1699#true} {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,944 INFO L280 TraceCheckUtils]: 35: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,944 INFO L280 TraceCheckUtils]: 36: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,945 INFO L280 TraceCheckUtils]: 37: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,946 INFO L280 TraceCheckUtils]: 38: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,946 INFO L280 TraceCheckUtils]: 39: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume true; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,947 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1776#(<= |fibonacci_#in~n| 3)} {1699#true} #48#return; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 15:55:02,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {1699#true} call ULTIMATE.init(); {1699#true} is VALID [2020-07-08 15:55:02,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,949 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1699#true} {1699#true} #44#return; {1699#true} is VALID [2020-07-08 15:55:02,949 INFO L263 TraceCheckUtils]: 3: Hoare triple {1699#true} call #t~ret4 := main(); {1699#true} is VALID [2020-07-08 15:55:02,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1699#true} is VALID [2020-07-08 15:55:02,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {1699#true} ~x~0 := #t~nondet2; {1699#true} is VALID [2020-07-08 15:55:02,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {1699#true} havoc #t~nondet2; {1699#true} is VALID [2020-07-08 15:55:02,950 INFO L263 TraceCheckUtils]: 7: Hoare triple {1699#true} call #t~ret3 := fibonacci(~x~0); {1699#true} is VALID [2020-07-08 15:55:02,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,952 INFO L263 TraceCheckUtils]: 11: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 15:55:02,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,954 INFO L263 TraceCheckUtils]: 15: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 15:55:02,954 INFO L280 TraceCheckUtils]: 16: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,955 INFO L280 TraceCheckUtils]: 17: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,956 INFO L280 TraceCheckUtils]: 18: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,956 INFO L280 TraceCheckUtils]: 19: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,957 INFO L280 TraceCheckUtils]: 20: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:02,958 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,959 INFO L280 TraceCheckUtils]: 22: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,959 INFO L263 TraceCheckUtils]: 23: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 15:55:02,959 INFO L280 TraceCheckUtils]: 24: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,959 INFO L280 TraceCheckUtils]: 25: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 15:55:02,959 INFO L280 TraceCheckUtils]: 26: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 15:55:02,960 INFO L280 TraceCheckUtils]: 27: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,961 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,961 INFO L280 TraceCheckUtils]: 29: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,962 INFO L280 TraceCheckUtils]: 30: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,963 INFO L280 TraceCheckUtils]: 31: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,963 INFO L280 TraceCheckUtils]: 32: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,964 INFO L280 TraceCheckUtils]: 33: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume true; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:02,966 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1789#(<= |fibonacci_#in~n| 2)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,967 INFO L280 TraceCheckUtils]: 35: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,967 INFO L263 TraceCheckUtils]: 36: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 15:55:02,968 INFO L280 TraceCheckUtils]: 37: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 15:55:02,968 INFO L280 TraceCheckUtils]: 38: Hoare triple {1699#true} assume !(~n < 1); {1699#true} is VALID [2020-07-08 15:55:02,968 INFO L280 TraceCheckUtils]: 39: Hoare triple {1699#true} assume 1 == ~n; {1699#true} is VALID [2020-07-08 15:55:02,968 INFO L280 TraceCheckUtils]: 40: Hoare triple {1699#true} #res := 1; {1699#true} is VALID [2020-07-08 15:55:02,969 INFO L280 TraceCheckUtils]: 41: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 15:55:02,970 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1699#true} {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,970 INFO L280 TraceCheckUtils]: 43: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,973 INFO L280 TraceCheckUtils]: 44: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,975 INFO L280 TraceCheckUtils]: 45: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,977 INFO L280 TraceCheckUtils]: 46: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,978 INFO L280 TraceCheckUtils]: 47: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume true; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:02,979 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1776#(<= |fibonacci_#in~n| 3)} {1699#true} #48#return; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 15:55:02,979 INFO L280 TraceCheckUtils]: 49: Hoare triple {1744#(<= main_~x~0 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 15:55:02,980 INFO L280 TraceCheckUtils]: 50: Hoare triple {1744#(<= main_~x~0 3)} ~result~0 := #t~ret3; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 15:55:02,980 INFO L280 TraceCheckUtils]: 51: Hoare triple {1744#(<= main_~x~0 3)} havoc #t~ret3; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 15:55:02,981 INFO L280 TraceCheckUtils]: 52: Hoare triple {1744#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {1700#false} is VALID [2020-07-08 15:55:02,981 INFO L280 TraceCheckUtils]: 53: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2020-07-08 15:55:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-08 15:55:02,984 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:02,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [157878974] [2020-07-08 15:55:02,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:02,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 15:55:02,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582313915] [2020-07-08 15:55:02,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-08 15:55:02,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:02,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 15:55:03,038 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-08 15:55:03,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 15:55:03,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 15:55:03,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 15:55:03,040 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 9 states. [2020-07-08 15:55:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:03,555 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-08 15:55:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 15:55:03,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-08 15:55:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 15:55:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-08 15:55:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 15:55:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-08 15:55:03,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-08 15:55:03,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:03,651 INFO L225 Difference]: With dead ends: 88 [2020-07-08 15:55:03,651 INFO L226 Difference]: Without dead ends: 82 [2020-07-08 15:55:03,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-08 15:55:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-08 15:55:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-08 15:55:03,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:03,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 76 states. [2020-07-08 15:55:03,771 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 76 states. [2020-07-08 15:55:03,771 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 76 states. [2020-07-08 15:55:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:03,777 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-08 15:55:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-08 15:55:03,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:03,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:03,779 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 82 states. [2020-07-08 15:55:03,779 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 82 states. [2020-07-08 15:55:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:03,786 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-08 15:55:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-08 15:55:03,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:03,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:03,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:03,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-08 15:55:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-08 15:55:03,792 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-08 15:55:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:03,793 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-08 15:55:03,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 15:55:03,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 102 transitions. [2020-07-08 15:55:03,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-08 15:55:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-08 15:55:03,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:03,932 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, 1, 1] [2020-07-08 15:55:03,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 15:55:03,932 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-08 15:55:03,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:03,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976941203] [2020-07-08 15:55:03,933 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-08 15:55:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,137 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2288#true} {2288#true} #44#return; {2288#true} is VALID [2020-07-08 15:55:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,341 INFO L280 TraceCheckUtils]: 3: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,343 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,352 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,355 INFO L263 TraceCheckUtils]: 3: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,359 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,360 INFO L263 TraceCheckUtils]: 11: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,361 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,361 INFO L280 TraceCheckUtils]: 13: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,362 INFO L280 TraceCheckUtils]: 15: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,363 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,364 INFO L280 TraceCheckUtils]: 17: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,364 INFO L280 TraceCheckUtils]: 18: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,366 INFO L280 TraceCheckUtils]: 20: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,367 INFO L280 TraceCheckUtils]: 21: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,369 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,377 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,380 INFO L263 TraceCheckUtils]: 3: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,380 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,381 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,381 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,382 INFO L263 TraceCheckUtils]: 7: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,382 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,383 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,383 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,386 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,387 INFO L263 TraceCheckUtils]: 15: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,387 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,387 INFO L280 TraceCheckUtils]: 17: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,387 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,388 INFO L280 TraceCheckUtils]: 19: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,389 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,389 INFO L280 TraceCheckUtils]: 21: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,390 INFO L280 TraceCheckUtils]: 22: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,390 INFO L280 TraceCheckUtils]: 23: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,391 INFO L280 TraceCheckUtils]: 24: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,391 INFO L280 TraceCheckUtils]: 25: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,393 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,393 INFO L280 TraceCheckUtils]: 27: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,394 INFO L263 TraceCheckUtils]: 28: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,394 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,394 INFO L280 TraceCheckUtils]: 30: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,394 INFO L280 TraceCheckUtils]: 31: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,395 INFO L280 TraceCheckUtils]: 32: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,395 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,396 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,396 INFO L280 TraceCheckUtils]: 35: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,397 INFO L280 TraceCheckUtils]: 36: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,397 INFO L280 TraceCheckUtils]: 37: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,398 INFO L280 TraceCheckUtils]: 38: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,398 INFO L280 TraceCheckUtils]: 39: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume true; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,399 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2536#(<= |fibonacci_#in~n| 3)} {2288#true} #40#return; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,527 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,528 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 15:55:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,532 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 15:55:04,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,533 INFO L263 TraceCheckUtils]: 3: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,534 INFO L280 TraceCheckUtils]: 7: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,534 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 15:55:04,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,535 INFO L263 TraceCheckUtils]: 11: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,535 INFO L280 TraceCheckUtils]: 13: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,535 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,536 INFO L280 TraceCheckUtils]: 15: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,536 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 15:55:04,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,536 INFO L280 TraceCheckUtils]: 19: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 15:55:04,537 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,537 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,538 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,544 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,545 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,548 INFO L263 TraceCheckUtils]: 3: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,548 INFO L280 TraceCheckUtils]: 6: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,548 INFO L263 TraceCheckUtils]: 7: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,549 INFO L280 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,549 INFO L280 TraceCheckUtils]: 11: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,550 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 15:55:04,550 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,550 INFO L263 TraceCheckUtils]: 15: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,551 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,551 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 15:55:04,552 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,552 INFO L280 TraceCheckUtils]: 22: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,552 INFO L280 TraceCheckUtils]: 23: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 15:55:04,552 INFO L280 TraceCheckUtils]: 24: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,552 INFO L280 TraceCheckUtils]: 25: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,553 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,554 INFO L280 TraceCheckUtils]: 27: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,554 INFO L263 TraceCheckUtils]: 28: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,555 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,555 INFO L280 TraceCheckUtils]: 30: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,555 INFO L280 TraceCheckUtils]: 31: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,555 INFO L280 TraceCheckUtils]: 32: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,555 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,557 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,557 INFO L280 TraceCheckUtils]: 35: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,558 INFO L280 TraceCheckUtils]: 36: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,558 INFO L280 TraceCheckUtils]: 37: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,559 INFO L280 TraceCheckUtils]: 38: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,559 INFO L280 TraceCheckUtils]: 39: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,560 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:04,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,569 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,571 INFO L263 TraceCheckUtils]: 3: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,574 INFO L263 TraceCheckUtils]: 7: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,575 INFO L263 TraceCheckUtils]: 11: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,575 INFO L280 TraceCheckUtils]: 13: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,576 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,577 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 15:55:04,577 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,577 INFO L263 TraceCheckUtils]: 19: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,578 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,578 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,578 INFO L280 TraceCheckUtils]: 22: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,578 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 15:55:04,579 INFO L280 TraceCheckUtils]: 25: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,579 INFO L280 TraceCheckUtils]: 27: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 15:55:04,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,593 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,596 INFO L280 TraceCheckUtils]: 31: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,596 INFO L263 TraceCheckUtils]: 32: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,597 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,597 INFO L280 TraceCheckUtils]: 34: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,597 INFO L280 TraceCheckUtils]: 35: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,597 INFO L280 TraceCheckUtils]: 36: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,598 INFO L280 TraceCheckUtils]: 37: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,604 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,604 INFO L280 TraceCheckUtils]: 39: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,605 INFO L280 TraceCheckUtils]: 40: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,605 INFO L280 TraceCheckUtils]: 41: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,606 INFO L280 TraceCheckUtils]: 42: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,606 INFO L280 TraceCheckUtils]: 43: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,607 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,608 INFO L280 TraceCheckUtils]: 45: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,608 INFO L263 TraceCheckUtils]: 46: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,608 INFO L280 TraceCheckUtils]: 47: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,608 INFO L280 TraceCheckUtils]: 48: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,608 INFO L280 TraceCheckUtils]: 49: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,609 INFO L280 TraceCheckUtils]: 50: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,609 INFO L280 TraceCheckUtils]: 51: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,610 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,610 INFO L280 TraceCheckUtils]: 53: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,610 INFO L280 TraceCheckUtils]: 54: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,611 INFO L280 TraceCheckUtils]: 55: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,611 INFO L280 TraceCheckUtils]: 56: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,612 INFO L280 TraceCheckUtils]: 57: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume true; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,613 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2599#(<= 3 |fibonacci_#in~n|)} {2445#(<= fibonacci_~n 4)} #42#return; {2289#false} is VALID [2020-07-08 15:55:04,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,619 INFO L263 TraceCheckUtils]: 3: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,620 INFO L263 TraceCheckUtils]: 7: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,622 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,622 INFO L263 TraceCheckUtils]: 11: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,622 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,623 INFO L280 TraceCheckUtils]: 14: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,625 INFO L280 TraceCheckUtils]: 16: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,626 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,627 INFO L280 TraceCheckUtils]: 18: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,628 INFO L263 TraceCheckUtils]: 19: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,628 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,628 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,628 INFO L280 TraceCheckUtils]: 22: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,629 INFO L280 TraceCheckUtils]: 23: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,630 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,631 INFO L280 TraceCheckUtils]: 25: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,631 INFO L280 TraceCheckUtils]: 26: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,632 INFO L280 TraceCheckUtils]: 27: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,633 INFO L280 TraceCheckUtils]: 28: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,633 INFO L280 TraceCheckUtils]: 29: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,634 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,635 INFO L280 TraceCheckUtils]: 31: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,635 INFO L263 TraceCheckUtils]: 32: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,636 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,636 INFO L280 TraceCheckUtils]: 34: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,636 INFO L280 TraceCheckUtils]: 35: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,636 INFO L280 TraceCheckUtils]: 36: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,636 INFO L280 TraceCheckUtils]: 37: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,638 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,638 INFO L280 TraceCheckUtils]: 39: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,639 INFO L280 TraceCheckUtils]: 40: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,640 INFO L280 TraceCheckUtils]: 41: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,640 INFO L280 TraceCheckUtils]: 42: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,641 INFO L280 TraceCheckUtils]: 43: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume true; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,642 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2536#(<= |fibonacci_#in~n| 3)} {2288#true} #40#return; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:04,643 INFO L280 TraceCheckUtils]: 45: Hoare triple {2445#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:04,643 INFO L263 TraceCheckUtils]: 46: Hoare triple {2445#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,644 INFO L280 TraceCheckUtils]: 47: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,645 INFO L280 TraceCheckUtils]: 48: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,645 INFO L280 TraceCheckUtils]: 49: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,646 INFO L263 TraceCheckUtils]: 50: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,646 INFO L280 TraceCheckUtils]: 51: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,647 INFO L280 TraceCheckUtils]: 52: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,648 INFO L280 TraceCheckUtils]: 53: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,648 INFO L263 TraceCheckUtils]: 54: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,648 INFO L280 TraceCheckUtils]: 55: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,648 INFO L280 TraceCheckUtils]: 56: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,649 INFO L280 TraceCheckUtils]: 57: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,649 INFO L263 TraceCheckUtils]: 58: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,649 INFO L280 TraceCheckUtils]: 59: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,649 INFO L280 TraceCheckUtils]: 60: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,649 INFO L280 TraceCheckUtils]: 61: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,650 INFO L280 TraceCheckUtils]: 62: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,650 INFO L280 TraceCheckUtils]: 63: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,650 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 15:55:04,651 INFO L280 TraceCheckUtils]: 65: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,651 INFO L263 TraceCheckUtils]: 66: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,651 INFO L280 TraceCheckUtils]: 67: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,652 INFO L280 TraceCheckUtils]: 68: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,652 INFO L280 TraceCheckUtils]: 69: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,652 INFO L280 TraceCheckUtils]: 70: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,652 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 15:55:04,653 INFO L280 TraceCheckUtils]: 72: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,653 INFO L280 TraceCheckUtils]: 73: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,653 INFO L280 TraceCheckUtils]: 74: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 15:55:04,654 INFO L280 TraceCheckUtils]: 75: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,654 INFO L280 TraceCheckUtils]: 76: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,655 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,656 INFO L280 TraceCheckUtils]: 78: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,656 INFO L263 TraceCheckUtils]: 79: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,657 INFO L280 TraceCheckUtils]: 80: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,657 INFO L280 TraceCheckUtils]: 81: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,657 INFO L280 TraceCheckUtils]: 82: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,657 INFO L280 TraceCheckUtils]: 83: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,658 INFO L280 TraceCheckUtils]: 84: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,659 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,659 INFO L280 TraceCheckUtils]: 86: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,660 INFO L280 TraceCheckUtils]: 87: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,660 INFO L280 TraceCheckUtils]: 88: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,661 INFO L280 TraceCheckUtils]: 89: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,661 INFO L280 TraceCheckUtils]: 90: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,663 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,664 INFO L280 TraceCheckUtils]: 92: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,664 INFO L263 TraceCheckUtils]: 93: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,664 INFO L280 TraceCheckUtils]: 94: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,665 INFO L280 TraceCheckUtils]: 95: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,665 INFO L280 TraceCheckUtils]: 96: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,665 INFO L280 TraceCheckUtils]: 97: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,666 INFO L280 TraceCheckUtils]: 98: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,667 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,668 INFO L280 TraceCheckUtils]: 100: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,668 INFO L280 TraceCheckUtils]: 101: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,669 INFO L280 TraceCheckUtils]: 102: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,670 INFO L280 TraceCheckUtils]: 103: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,670 INFO L280 TraceCheckUtils]: 104: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume true; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,672 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2599#(<= 3 |fibonacci_#in~n|)} {2445#(<= fibonacci_~n 4)} #42#return; {2289#false} is VALID [2020-07-08 15:55:04,672 INFO L280 TraceCheckUtils]: 106: Hoare triple {2289#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2289#false} is VALID [2020-07-08 15:55:04,672 INFO L280 TraceCheckUtils]: 107: Hoare triple {2289#false} #res := #t~ret0 + #t~ret1; {2289#false} is VALID [2020-07-08 15:55:04,672 INFO L280 TraceCheckUtils]: 108: Hoare triple {2289#false} havoc #t~ret0; {2289#false} is VALID [2020-07-08 15:55:04,673 INFO L280 TraceCheckUtils]: 109: Hoare triple {2289#false} havoc #t~ret1; {2289#false} is VALID [2020-07-08 15:55:04,673 INFO L280 TraceCheckUtils]: 110: Hoare triple {2289#false} assume true; {2289#false} is VALID [2020-07-08 15:55:04,673 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2289#false} {2288#true} #48#return; {2289#false} is VALID [2020-07-08 15:55:04,689 INFO L263 TraceCheckUtils]: 0: Hoare triple {2288#true} call ULTIMATE.init(); {2288#true} is VALID [2020-07-08 15:55:04,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2288#true} {2288#true} #44#return; {2288#true} is VALID [2020-07-08 15:55:04,689 INFO L263 TraceCheckUtils]: 3: Hoare triple {2288#true} call #t~ret4 := main(); {2288#true} is VALID [2020-07-08 15:55:04,690 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,690 INFO L280 TraceCheckUtils]: 5: Hoare triple {2288#true} ~x~0 := #t~nondet2; {2288#true} is VALID [2020-07-08 15:55:04,690 INFO L280 TraceCheckUtils]: 6: Hoare triple {2288#true} havoc #t~nondet2; {2288#true} is VALID [2020-07-08 15:55:04,690 INFO L263 TraceCheckUtils]: 7: Hoare triple {2288#true} call #t~ret3 := fibonacci(~x~0); {2288#true} is VALID [2020-07-08 15:55:04,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,691 INFO L263 TraceCheckUtils]: 11: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,695 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,697 INFO L263 TraceCheckUtils]: 15: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,698 INFO L280 TraceCheckUtils]: 18: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,698 INFO L263 TraceCheckUtils]: 19: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,699 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,701 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,701 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:04,702 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,703 INFO L280 TraceCheckUtils]: 26: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,703 INFO L263 TraceCheckUtils]: 27: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,703 INFO L280 TraceCheckUtils]: 28: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,704 INFO L280 TraceCheckUtils]: 31: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,705 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,705 INFO L280 TraceCheckUtils]: 33: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,706 INFO L280 TraceCheckUtils]: 34: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,706 INFO L280 TraceCheckUtils]: 35: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,707 INFO L280 TraceCheckUtils]: 36: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,707 INFO L280 TraceCheckUtils]: 37: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:04,709 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,709 INFO L280 TraceCheckUtils]: 39: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,709 INFO L263 TraceCheckUtils]: 40: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,710 INFO L280 TraceCheckUtils]: 41: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,710 INFO L280 TraceCheckUtils]: 42: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,710 INFO L280 TraceCheckUtils]: 43: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,710 INFO L280 TraceCheckUtils]: 44: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,710 INFO L280 TraceCheckUtils]: 45: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,711 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,712 INFO L280 TraceCheckUtils]: 47: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,712 INFO L280 TraceCheckUtils]: 48: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,713 INFO L280 TraceCheckUtils]: 49: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,714 INFO L280 TraceCheckUtils]: 50: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,714 INFO L280 TraceCheckUtils]: 51: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume true; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:04,715 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2536#(<= |fibonacci_#in~n| 3)} {2288#true} #40#return; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:04,716 INFO L280 TraceCheckUtils]: 53: Hoare triple {2445#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:04,716 INFO L263 TraceCheckUtils]: 54: Hoare triple {2445#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,716 INFO L280 TraceCheckUtils]: 55: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,717 INFO L280 TraceCheckUtils]: 56: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,717 INFO L280 TraceCheckUtils]: 57: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,718 INFO L263 TraceCheckUtils]: 58: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,718 INFO L280 TraceCheckUtils]: 59: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,719 INFO L280 TraceCheckUtils]: 60: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,720 INFO L280 TraceCheckUtils]: 61: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,720 INFO L263 TraceCheckUtils]: 62: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,720 INFO L280 TraceCheckUtils]: 63: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,720 INFO L280 TraceCheckUtils]: 64: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,721 INFO L280 TraceCheckUtils]: 65: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 15:55:04,721 INFO L263 TraceCheckUtils]: 66: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 15:55:04,721 INFO L280 TraceCheckUtils]: 67: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,721 INFO L280 TraceCheckUtils]: 68: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,721 INFO L280 TraceCheckUtils]: 69: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,721 INFO L280 TraceCheckUtils]: 70: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,722 INFO L280 TraceCheckUtils]: 71: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,722 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 15:55:04,722 INFO L280 TraceCheckUtils]: 73: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,722 INFO L263 TraceCheckUtils]: 74: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,722 INFO L280 TraceCheckUtils]: 75: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,723 INFO L280 TraceCheckUtils]: 76: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 15:55:04,723 INFO L280 TraceCheckUtils]: 77: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 15:55:04,723 INFO L280 TraceCheckUtils]: 78: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,723 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 15:55:04,723 INFO L280 TraceCheckUtils]: 80: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 15:55:04,724 INFO L280 TraceCheckUtils]: 81: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,724 INFO L280 TraceCheckUtils]: 82: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 15:55:04,724 INFO L280 TraceCheckUtils]: 83: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 15:55:04,724 INFO L280 TraceCheckUtils]: 84: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,726 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,727 INFO L280 TraceCheckUtils]: 86: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,727 INFO L263 TraceCheckUtils]: 87: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,727 INFO L280 TraceCheckUtils]: 88: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,727 INFO L280 TraceCheckUtils]: 89: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,727 INFO L280 TraceCheckUtils]: 90: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,728 INFO L280 TraceCheckUtils]: 91: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,728 INFO L280 TraceCheckUtils]: 92: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,729 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,730 INFO L280 TraceCheckUtils]: 94: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,730 INFO L280 TraceCheckUtils]: 95: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,730 INFO L280 TraceCheckUtils]: 96: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,731 INFO L280 TraceCheckUtils]: 97: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,731 INFO L280 TraceCheckUtils]: 98: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,733 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,733 INFO L280 TraceCheckUtils]: 100: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:04,733 INFO L263 TraceCheckUtils]: 101: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 15:55:04,734 INFO L280 TraceCheckUtils]: 102: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 15:55:04,734 INFO L280 TraceCheckUtils]: 103: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 15:55:04,734 INFO L280 TraceCheckUtils]: 104: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 15:55:04,734 INFO L280 TraceCheckUtils]: 105: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 15:55:04,734 INFO L280 TraceCheckUtils]: 106: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 15:55:04,735 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,736 INFO L280 TraceCheckUtils]: 108: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,736 INFO L280 TraceCheckUtils]: 109: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,737 INFO L280 TraceCheckUtils]: 110: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,737 INFO L280 TraceCheckUtils]: 111: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,738 INFO L280 TraceCheckUtils]: 112: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume true; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:04,739 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2599#(<= 3 |fibonacci_#in~n|)} {2445#(<= fibonacci_~n 4)} #42#return; {2289#false} is VALID [2020-07-08 15:55:04,739 INFO L280 TraceCheckUtils]: 114: Hoare triple {2289#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2289#false} is VALID [2020-07-08 15:55:04,739 INFO L280 TraceCheckUtils]: 115: Hoare triple {2289#false} #res := #t~ret0 + #t~ret1; {2289#false} is VALID [2020-07-08 15:55:04,739 INFO L280 TraceCheckUtils]: 116: Hoare triple {2289#false} havoc #t~ret0; {2289#false} is VALID [2020-07-08 15:55:04,739 INFO L280 TraceCheckUtils]: 117: Hoare triple {2289#false} havoc #t~ret1; {2289#false} is VALID [2020-07-08 15:55:04,739 INFO L280 TraceCheckUtils]: 118: Hoare triple {2289#false} assume true; {2289#false} is VALID [2020-07-08 15:55:04,740 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {2289#false} {2288#true} #48#return; {2289#false} is VALID [2020-07-08 15:55:04,740 INFO L280 TraceCheckUtils]: 120: Hoare triple {2289#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2289#false} is VALID [2020-07-08 15:55:04,740 INFO L280 TraceCheckUtils]: 121: Hoare triple {2289#false} ~result~0 := #t~ret3; {2289#false} is VALID [2020-07-08 15:55:04,740 INFO L280 TraceCheckUtils]: 122: Hoare triple {2289#false} havoc #t~ret3; {2289#false} is VALID [2020-07-08 15:55:04,740 INFO L280 TraceCheckUtils]: 123: Hoare triple {2289#false} assume !(5 != ~x~0 || 3 == ~result~0); {2289#false} is VALID [2020-07-08 15:55:04,741 INFO L280 TraceCheckUtils]: 124: Hoare triple {2289#false} assume !false; {2289#false} is VALID [2020-07-08 15:55:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-07-08 15:55:04,755 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:04,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976941203] [2020-07-08 15:55:04,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:04,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 15:55:04,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583093558] [2020-07-08 15:55:04,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2020-07-08 15:55:04,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:04,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 15:55:04,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:04,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 15:55:04,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:04,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 15:55:04,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-08 15:55:04,855 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 14 states. [2020-07-08 15:55:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:05,711 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2020-07-08 15:55:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 15:55:05,711 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2020-07-08 15:55:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 15:55:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-08 15:55:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 15:55:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-08 15:55:05,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 109 transitions. [2020-07-08 15:55:05,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:05,871 INFO L225 Difference]: With dead ends: 137 [2020-07-08 15:55:05,872 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 15:55:05,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-08 15:55:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 15:55:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-07-08 15:55:05,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:05,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 59 states. [2020-07-08 15:55:05,956 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 59 states. [2020-07-08 15:55:05,956 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 59 states. [2020-07-08 15:55:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:05,961 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-08 15:55:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2020-07-08 15:55:05,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:05,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:05,962 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 68 states. [2020-07-08 15:55:05,962 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 68 states. [2020-07-08 15:55:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:05,967 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-08 15:55:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2020-07-08 15:55:05,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:05,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:05,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:05,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 15:55:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-07-08 15:55:05,972 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 125 [2020-07-08 15:55:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:05,972 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-07-08 15:55:05,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 15:55:05,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2020-07-08 15:55:06,101 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-08 15:55:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2020-07-08 15:55:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-08 15:55:06,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:06,103 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:55:06,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 15:55:06,104 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-08 15:55:06,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:06,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602212216] [2020-07-08 15:55:06,105 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-08 15:55:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,251 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3185#true} {3185#true} #44#return; {3185#true} is VALID [2020-07-08 15:55:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,395 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,400 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,402 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,403 INFO L263 TraceCheckUtils]: 3: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,406 INFO L280 TraceCheckUtils]: 7: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,406 INFO L280 TraceCheckUtils]: 8: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,407 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,408 INFO L263 TraceCheckUtils]: 11: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,410 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,411 INFO L280 TraceCheckUtils]: 17: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,412 INFO L280 TraceCheckUtils]: 20: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,414 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,420 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,421 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,423 INFO L263 TraceCheckUtils]: 3: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,423 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,425 INFO L263 TraceCheckUtils]: 7: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,427 INFO L280 TraceCheckUtils]: 11: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,429 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,430 INFO L263 TraceCheckUtils]: 15: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,430 INFO L280 TraceCheckUtils]: 16: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,431 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,434 INFO L280 TraceCheckUtils]: 24: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,434 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,435 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,436 INFO L280 TraceCheckUtils]: 27: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,436 INFO L263 TraceCheckUtils]: 28: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,436 INFO L280 TraceCheckUtils]: 29: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,437 INFO L280 TraceCheckUtils]: 30: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,437 INFO L280 TraceCheckUtils]: 31: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,437 INFO L280 TraceCheckUtils]: 32: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,437 INFO L280 TraceCheckUtils]: 33: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,438 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,439 INFO L280 TraceCheckUtils]: 35: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,439 INFO L280 TraceCheckUtils]: 36: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,440 INFO L280 TraceCheckUtils]: 37: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,440 INFO L280 TraceCheckUtils]: 38: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,441 INFO L280 TraceCheckUtils]: 39: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume true; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,442 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3363#(<= |fibonacci_#in~n| 3)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,456 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 15:55:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,460 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,460 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 15:55:06,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} assume !(1 == ~n); {3185#true} is VALID [2020-07-08 15:55:06,461 INFO L263 TraceCheckUtils]: 3: Hoare triple {3185#true} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,461 INFO L280 TraceCheckUtils]: 5: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,462 INFO L280 TraceCheckUtils]: 6: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,462 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 15:55:06,462 INFO L280 TraceCheckUtils]: 10: Hoare triple {3185#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,463 INFO L263 TraceCheckUtils]: 11: Hoare triple {3185#true} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,463 INFO L280 TraceCheckUtils]: 14: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,464 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 15:55:06,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {3185#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {3185#true} #res := #t~ret0 + #t~ret1; {3185#true} is VALID [2020-07-08 15:55:06,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {3185#true} havoc #t~ret0; {3185#true} is VALID [2020-07-08 15:55:06,464 INFO L280 TraceCheckUtils]: 20: Hoare triple {3185#true} havoc #t~ret1; {3185#true} is VALID [2020-07-08 15:55:06,465 INFO L280 TraceCheckUtils]: 21: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,466 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3185#true} {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,468 INFO L263 TraceCheckUtils]: 3: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,468 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,469 INFO L280 TraceCheckUtils]: 5: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,469 INFO L280 TraceCheckUtils]: 6: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,470 INFO L263 TraceCheckUtils]: 7: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,471 INFO L280 TraceCheckUtils]: 9: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,471 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,471 INFO L263 TraceCheckUtils]: 11: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,472 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,472 INFO L280 TraceCheckUtils]: 13: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,473 INFO L280 TraceCheckUtils]: 14: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,474 INFO L280 TraceCheckUtils]: 16: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,475 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,476 INFO L263 TraceCheckUtils]: 19: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,477 INFO L280 TraceCheckUtils]: 21: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,477 INFO L280 TraceCheckUtils]: 22: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,477 INFO L280 TraceCheckUtils]: 23: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,478 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,479 INFO L280 TraceCheckUtils]: 27: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,480 INFO L280 TraceCheckUtils]: 28: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,480 INFO L280 TraceCheckUtils]: 29: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,481 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,482 INFO L280 TraceCheckUtils]: 31: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,482 INFO L263 TraceCheckUtils]: 32: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,482 INFO L280 TraceCheckUtils]: 33: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,482 INFO L280 TraceCheckUtils]: 34: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,482 INFO L280 TraceCheckUtils]: 35: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,482 INFO L280 TraceCheckUtils]: 36: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,483 INFO L280 TraceCheckUtils]: 37: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,484 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,484 INFO L280 TraceCheckUtils]: 39: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,485 INFO L280 TraceCheckUtils]: 40: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,485 INFO L280 TraceCheckUtils]: 41: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,485 INFO L280 TraceCheckUtils]: 42: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,486 INFO L280 TraceCheckUtils]: 43: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume true; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,487 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3363#(<= |fibonacci_#in~n| 3)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,487 INFO L280 TraceCheckUtils]: 45: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,488 INFO L263 TraceCheckUtils]: 46: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,488 INFO L280 TraceCheckUtils]: 47: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,488 INFO L280 TraceCheckUtils]: 48: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,488 INFO L280 TraceCheckUtils]: 49: Hoare triple {3185#true} assume !(1 == ~n); {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L263 TraceCheckUtils]: 50: Hoare triple {3185#true} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L280 TraceCheckUtils]: 51: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L280 TraceCheckUtils]: 52: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L280 TraceCheckUtils]: 53: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L280 TraceCheckUtils]: 54: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L280 TraceCheckUtils]: 55: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,489 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L280 TraceCheckUtils]: 57: Hoare triple {3185#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L263 TraceCheckUtils]: 58: Hoare triple {3185#true} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L280 TraceCheckUtils]: 59: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L280 TraceCheckUtils]: 60: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L280 TraceCheckUtils]: 61: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L280 TraceCheckUtils]: 62: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,490 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 15:55:06,491 INFO L280 TraceCheckUtils]: 64: Hoare triple {3185#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,491 INFO L280 TraceCheckUtils]: 65: Hoare triple {3185#true} #res := #t~ret0 + #t~ret1; {3185#true} is VALID [2020-07-08 15:55:06,491 INFO L280 TraceCheckUtils]: 66: Hoare triple {3185#true} havoc #t~ret0; {3185#true} is VALID [2020-07-08 15:55:06,491 INFO L280 TraceCheckUtils]: 67: Hoare triple {3185#true} havoc #t~ret1; {3185#true} is VALID [2020-07-08 15:55:06,491 INFO L280 TraceCheckUtils]: 68: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,492 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3185#true} {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,492 INFO L280 TraceCheckUtils]: 70: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,492 INFO L280 TraceCheckUtils]: 71: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,493 INFO L280 TraceCheckUtils]: 72: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,493 INFO L280 TraceCheckUtils]: 73: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,494 INFO L280 TraceCheckUtils]: 74: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume true; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,494 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3332#(<= |fibonacci_#in~n| 4)} {3185#true} #48#return; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 15:55:06,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {3185#true} call ULTIMATE.init(); {3185#true} is VALID [2020-07-08 15:55:06,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,498 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3185#true} {3185#true} #44#return; {3185#true} is VALID [2020-07-08 15:55:06,498 INFO L263 TraceCheckUtils]: 3: Hoare triple {3185#true} call #t~ret4 := main(); {3185#true} is VALID [2020-07-08 15:55:06,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {3185#true} ~x~0 := #t~nondet2; {3185#true} is VALID [2020-07-08 15:55:06,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {3185#true} havoc #t~nondet2; {3185#true} is VALID [2020-07-08 15:55:06,499 INFO L263 TraceCheckUtils]: 7: Hoare triple {3185#true} call #t~ret3 := fibonacci(~x~0); {3185#true} is VALID [2020-07-08 15:55:06,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,499 INFO L280 TraceCheckUtils]: 9: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,500 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,500 INFO L263 TraceCheckUtils]: 11: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,501 INFO L263 TraceCheckUtils]: 15: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,501 INFO L280 TraceCheckUtils]: 16: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,502 INFO L263 TraceCheckUtils]: 19: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,503 INFO L280 TraceCheckUtils]: 20: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,503 INFO L280 TraceCheckUtils]: 21: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:06,503 INFO L280 TraceCheckUtils]: 22: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,504 INFO L280 TraceCheckUtils]: 23: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,504 INFO L280 TraceCheckUtils]: 24: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:06,505 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,505 INFO L280 TraceCheckUtils]: 26: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,506 INFO L263 TraceCheckUtils]: 27: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,506 INFO L280 TraceCheckUtils]: 28: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,506 INFO L280 TraceCheckUtils]: 29: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,506 INFO L280 TraceCheckUtils]: 30: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,506 INFO L280 TraceCheckUtils]: 31: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,507 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,507 INFO L280 TraceCheckUtils]: 33: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,507 INFO L280 TraceCheckUtils]: 34: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,508 INFO L280 TraceCheckUtils]: 35: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,515 INFO L280 TraceCheckUtils]: 36: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,515 INFO L280 TraceCheckUtils]: 37: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:06,516 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,517 INFO L280 TraceCheckUtils]: 39: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,517 INFO L263 TraceCheckUtils]: 40: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,517 INFO L280 TraceCheckUtils]: 41: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,517 INFO L280 TraceCheckUtils]: 42: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,517 INFO L280 TraceCheckUtils]: 43: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,518 INFO L280 TraceCheckUtils]: 44: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,518 INFO L280 TraceCheckUtils]: 45: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,518 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,520 INFO L280 TraceCheckUtils]: 47: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,523 INFO L280 TraceCheckUtils]: 48: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,525 INFO L280 TraceCheckUtils]: 49: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,526 INFO L280 TraceCheckUtils]: 50: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,526 INFO L280 TraceCheckUtils]: 51: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume true; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:06,528 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3363#(<= |fibonacci_#in~n| 3)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,528 INFO L280 TraceCheckUtils]: 53: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:06,529 INFO L263 TraceCheckUtils]: 54: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,529 INFO L280 TraceCheckUtils]: 55: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,529 INFO L280 TraceCheckUtils]: 56: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,529 INFO L280 TraceCheckUtils]: 57: Hoare triple {3185#true} assume !(1 == ~n); {3185#true} is VALID [2020-07-08 15:55:06,529 INFO L263 TraceCheckUtils]: 58: Hoare triple {3185#true} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 15:55:06,529 INFO L280 TraceCheckUtils]: 59: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,530 INFO L280 TraceCheckUtils]: 60: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 15:55:06,530 INFO L280 TraceCheckUtils]: 61: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 15:55:06,530 INFO L280 TraceCheckUtils]: 62: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 15:55:06,530 INFO L280 TraceCheckUtils]: 63: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,530 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 15:55:06,531 INFO L280 TraceCheckUtils]: 65: Hoare triple {3185#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,531 INFO L263 TraceCheckUtils]: 66: Hoare triple {3185#true} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 15:55:06,531 INFO L280 TraceCheckUtils]: 67: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 15:55:06,531 INFO L280 TraceCheckUtils]: 68: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 15:55:06,531 INFO L280 TraceCheckUtils]: 69: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 15:55:06,531 INFO L280 TraceCheckUtils]: 70: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,532 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 15:55:06,532 INFO L280 TraceCheckUtils]: 72: Hoare triple {3185#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3185#true} is VALID [2020-07-08 15:55:06,532 INFO L280 TraceCheckUtils]: 73: Hoare triple {3185#true} #res := #t~ret0 + #t~ret1; {3185#true} is VALID [2020-07-08 15:55:06,532 INFO L280 TraceCheckUtils]: 74: Hoare triple {3185#true} havoc #t~ret0; {3185#true} is VALID [2020-07-08 15:55:06,532 INFO L280 TraceCheckUtils]: 75: Hoare triple {3185#true} havoc #t~ret1; {3185#true} is VALID [2020-07-08 15:55:06,533 INFO L280 TraceCheckUtils]: 76: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 15:55:06,533 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3185#true} {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,534 INFO L280 TraceCheckUtils]: 78: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,535 INFO L280 TraceCheckUtils]: 79: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,536 INFO L280 TraceCheckUtils]: 80: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,537 INFO L280 TraceCheckUtils]: 81: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,537 INFO L280 TraceCheckUtils]: 82: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume true; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 15:55:06,538 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3332#(<= |fibonacci_#in~n| 4)} {3185#true} #48#return; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 15:55:06,539 INFO L280 TraceCheckUtils]: 84: Hoare triple {3265#(<= main_~x~0 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 15:55:06,539 INFO L280 TraceCheckUtils]: 85: Hoare triple {3265#(<= main_~x~0 4)} ~result~0 := #t~ret3; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 15:55:06,540 INFO L280 TraceCheckUtils]: 86: Hoare triple {3265#(<= main_~x~0 4)} havoc #t~ret3; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 15:55:06,540 INFO L280 TraceCheckUtils]: 87: Hoare triple {3265#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {3186#false} is VALID [2020-07-08 15:55:06,540 INFO L280 TraceCheckUtils]: 88: Hoare triple {3186#false} assume !false; {3186#false} is VALID [2020-07-08 15:55:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-08 15:55:06,547 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:06,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602212216] [2020-07-08 15:55:06,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:06,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 15:55:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155032830] [2020-07-08 15:55:06,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2020-07-08 15:55:06,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:06,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 15:55:06,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:06,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 15:55:06,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:06,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 15:55:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-08 15:55:06,619 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 11 states. [2020-07-08 15:55:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:07,099 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2020-07-08 15:55:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 15:55:07,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2020-07-08 15:55:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 15:55:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-08 15:55:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 15:55:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-08 15:55:07,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2020-07-08 15:55:07,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:07,199 INFO L225 Difference]: With dead ends: 71 [2020-07-08 15:55:07,199 INFO L226 Difference]: Without dead ends: 65 [2020-07-08 15:55:07,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-08 15:55:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-08 15:55:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-08 15:55:07,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:07,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2020-07-08 15:55:07,301 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-08 15:55:07,301 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-08 15:55:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:07,306 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2020-07-08 15:55:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-08 15:55:07,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:07,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:07,307 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-08 15:55:07,307 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-08 15:55:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:07,312 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2020-07-08 15:55:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-08 15:55:07,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:07,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:07,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:07,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-08 15:55:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2020-07-08 15:55:07,317 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 89 [2020-07-08 15:55:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:07,317 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2020-07-08 15:55:07,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 15:55:07,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 79 transitions. [2020-07-08 15:55:07,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-08 15:55:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-08 15:55:07,429 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:07,429 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, 1, 1] [2020-07-08 15:55:07,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 15:55:07,430 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-08 15:55:07,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:07,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209470690] [2020-07-08 15:55:07,431 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 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-08 15:55:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,634 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3795#true} {3795#true} #44#return; {3795#true} is VALID [2020-07-08 15:55:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,740 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,744 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,744 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,745 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,746 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,746 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,747 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,747 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,747 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,747 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,747 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,748 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,748 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,748 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,748 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,749 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,749 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,749 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,749 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,749 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,754 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,754 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,754 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,755 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,755 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,756 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,756 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,756 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,757 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,757 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,758 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,758 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,759 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,759 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,760 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,760 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,760 INFO L263 TraceCheckUtils]: 28: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,760 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,761 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,761 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,761 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,761 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,761 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,762 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,762 INFO L280 TraceCheckUtils]: 36: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,762 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,762 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,763 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,763 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,772 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,776 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,776 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,776 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,777 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,779 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,779 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,780 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,780 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,780 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,781 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,781 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,781 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,782 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,783 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,783 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,784 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,785 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,785 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,786 INFO L263 TraceCheckUtils]: 19: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,786 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,786 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,786 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,786 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,787 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,787 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,787 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,787 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,787 INFO L280 TraceCheckUtils]: 28: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,788 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,788 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,788 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,788 INFO L263 TraceCheckUtils]: 32: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,788 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,789 INFO L280 TraceCheckUtils]: 34: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,789 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,789 INFO L280 TraceCheckUtils]: 36: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,789 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,789 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,790 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,790 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,790 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,790 INFO L280 TraceCheckUtils]: 42: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,791 INFO L280 TraceCheckUtils]: 43: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,791 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,791 INFO L280 TraceCheckUtils]: 45: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,791 INFO L263 TraceCheckUtils]: 46: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,791 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,792 INFO L280 TraceCheckUtils]: 48: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,792 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,792 INFO L263 TraceCheckUtils]: 50: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,792 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,792 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,793 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,793 INFO L280 TraceCheckUtils]: 54: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,793 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,793 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,793 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,794 INFO L263 TraceCheckUtils]: 58: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,794 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,794 INFO L280 TraceCheckUtils]: 60: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,794 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,794 INFO L280 TraceCheckUtils]: 62: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,795 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,795 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,795 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,795 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,795 INFO L280 TraceCheckUtils]: 67: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,796 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,796 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,796 INFO L280 TraceCheckUtils]: 70: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,796 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,796 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,797 INFO L280 TraceCheckUtils]: 73: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,797 INFO L280 TraceCheckUtils]: 74: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,798 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3795#true} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,959 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,959 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,959 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,964 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,964 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,964 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:07,966 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:07,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:07,966 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:07,967 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:07,967 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,967 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:07,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,968 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:07,968 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:07,969 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:07,969 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:07,969 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,969 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:07,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:07,970 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,970 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:07,971 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:07,971 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:07,972 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,000 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,001 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,002 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,008 INFO L263 TraceCheckUtils]: 3: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,008 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,008 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,009 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,009 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,010 INFO L280 TraceCheckUtils]: 11: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,010 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,010 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,010 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,011 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,011 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,011 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,011 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,012 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,012 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,012 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,012 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,012 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,013 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,013 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,014 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,015 INFO L280 TraceCheckUtils]: 27: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,015 INFO L263 TraceCheckUtils]: 28: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,015 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,015 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,016 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,016 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,016 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,017 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,018 INFO L280 TraceCheckUtils]: 35: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,018 INFO L280 TraceCheckUtils]: 36: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,019 INFO L280 TraceCheckUtils]: 37: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,019 INFO L280 TraceCheckUtils]: 38: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,020 INFO L280 TraceCheckUtils]: 39: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,021 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:08,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,039 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,039 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:08,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,043 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,043 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,044 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,045 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,046 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,046 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,046 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,046 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,047 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,047 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,047 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,048 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,049 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,051 INFO L263 TraceCheckUtils]: 3: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,052 INFO L280 TraceCheckUtils]: 5: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,053 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,053 INFO L263 TraceCheckUtils]: 7: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,053 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,054 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,054 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,054 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,054 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,054 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,055 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,055 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,055 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,055 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,056 INFO L263 TraceCheckUtils]: 19: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,056 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,057 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,057 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,057 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,057 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,058 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,058 INFO L280 TraceCheckUtils]: 28: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,058 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,059 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,060 INFO L280 TraceCheckUtils]: 31: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,060 INFO L263 TraceCheckUtils]: 32: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,060 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,060 INFO L280 TraceCheckUtils]: 34: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,061 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,061 INFO L280 TraceCheckUtils]: 36: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,061 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,062 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,063 INFO L280 TraceCheckUtils]: 39: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,063 INFO L280 TraceCheckUtils]: 40: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,064 INFO L280 TraceCheckUtils]: 41: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,064 INFO L280 TraceCheckUtils]: 42: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,065 INFO L280 TraceCheckUtils]: 43: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,066 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,067 INFO L280 TraceCheckUtils]: 45: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,067 INFO L263 TraceCheckUtils]: 46: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,067 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,067 INFO L280 TraceCheckUtils]: 48: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,068 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,068 INFO L263 TraceCheckUtils]: 50: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,068 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,068 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,068 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,069 INFO L280 TraceCheckUtils]: 54: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,069 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,069 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,069 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,069 INFO L263 TraceCheckUtils]: 58: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,070 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,070 INFO L280 TraceCheckUtils]: 60: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,070 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,070 INFO L280 TraceCheckUtils]: 62: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,070 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,071 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,071 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,071 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,071 INFO L280 TraceCheckUtils]: 67: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,071 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,073 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,073 INFO L280 TraceCheckUtils]: 70: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,074 INFO L280 TraceCheckUtils]: 71: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,074 INFO L280 TraceCheckUtils]: 72: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,075 INFO L280 TraceCheckUtils]: 73: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,076 INFO L280 TraceCheckUtils]: 74: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,077 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:08,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,100 INFO L280 TraceCheckUtils]: 3: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,102 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 15:55:08,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,103 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,105 INFO L263 TraceCheckUtils]: 7: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,106 INFO L280 TraceCheckUtils]: 9: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,107 INFO L263 TraceCheckUtils]: 11: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,108 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,108 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,108 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,109 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,109 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,109 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,109 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,110 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,110 INFO L263 TraceCheckUtils]: 23: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,111 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,111 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,111 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,111 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,111 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,112 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,112 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,113 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,113 INFO L280 TraceCheckUtils]: 35: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,114 INFO L263 TraceCheckUtils]: 36: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,114 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,114 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,114 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,115 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,115 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,116 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,116 INFO L280 TraceCheckUtils]: 43: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,117 INFO L280 TraceCheckUtils]: 44: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,118 INFO L280 TraceCheckUtils]: 45: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,118 INFO L280 TraceCheckUtils]: 46: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,119 INFO L280 TraceCheckUtils]: 47: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,120 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,121 INFO L280 TraceCheckUtils]: 49: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,121 INFO L263 TraceCheckUtils]: 50: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,121 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,121 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,121 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,122 INFO L263 TraceCheckUtils]: 54: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,122 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,122 INFO L280 TraceCheckUtils]: 56: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,122 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,122 INFO L280 TraceCheckUtils]: 58: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,123 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,123 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,123 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,123 INFO L263 TraceCheckUtils]: 62: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,123 INFO L280 TraceCheckUtils]: 63: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,124 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,124 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,124 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,124 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,124 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,125 INFO L280 TraceCheckUtils]: 69: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,125 INFO L280 TraceCheckUtils]: 70: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,125 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,125 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,126 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,127 INFO L280 TraceCheckUtils]: 74: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,127 INFO L280 TraceCheckUtils]: 75: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,129 INFO L280 TraceCheckUtils]: 76: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,130 INFO L280 TraceCheckUtils]: 77: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,130 INFO L280 TraceCheckUtils]: 78: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,131 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,132 INFO L280 TraceCheckUtils]: 80: Hoare triple {4345#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,132 INFO L263 TraceCheckUtils]: 81: Hoare triple {4345#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,134 INFO L280 TraceCheckUtils]: 82: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,135 INFO L280 TraceCheckUtils]: 83: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,136 INFO L280 TraceCheckUtils]: 84: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,136 INFO L280 TraceCheckUtils]: 85: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,137 INFO L280 TraceCheckUtils]: 86: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,138 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 15:55:08,138 INFO L280 TraceCheckUtils]: 88: Hoare triple {3796#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3796#false} is VALID [2020-07-08 15:55:08,138 INFO L280 TraceCheckUtils]: 89: Hoare triple {3796#false} #res := #t~ret0 + #t~ret1; {3796#false} is VALID [2020-07-08 15:55:08,139 INFO L280 TraceCheckUtils]: 90: Hoare triple {3796#false} havoc #t~ret0; {3796#false} is VALID [2020-07-08 15:55:08,139 INFO L280 TraceCheckUtils]: 91: Hoare triple {3796#false} havoc #t~ret1; {3796#false} is VALID [2020-07-08 15:55:08,139 INFO L280 TraceCheckUtils]: 92: Hoare triple {3796#false} assume true; {3796#false} is VALID [2020-07-08 15:55:08,139 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3796#false} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,147 INFO L280 TraceCheckUtils]: 2: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,147 INFO L263 TraceCheckUtils]: 3: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,148 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,148 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,148 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,149 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,149 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,149 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,150 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,150 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,150 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,151 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,151 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,151 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,151 INFO L263 TraceCheckUtils]: 23: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,151 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,152 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,152 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,152 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,152 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,152 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,153 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,153 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,153 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,153 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,153 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,153 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,154 INFO L263 TraceCheckUtils]: 36: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,154 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,154 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,154 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,154 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,155 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,155 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,155 INFO L280 TraceCheckUtils]: 43: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,155 INFO L280 TraceCheckUtils]: 44: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,155 INFO L280 TraceCheckUtils]: 45: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,156 INFO L280 TraceCheckUtils]: 46: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,156 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,156 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,156 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,156 INFO L263 TraceCheckUtils]: 50: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,157 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,157 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,157 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,157 INFO L263 TraceCheckUtils]: 54: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,157 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,158 INFO L280 TraceCheckUtils]: 56: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,158 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,158 INFO L280 TraceCheckUtils]: 58: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,158 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,158 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,159 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,159 INFO L263 TraceCheckUtils]: 62: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,159 INFO L280 TraceCheckUtils]: 63: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,159 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,159 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,159 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,160 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,160 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,160 INFO L280 TraceCheckUtils]: 69: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,160 INFO L280 TraceCheckUtils]: 70: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,160 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,161 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,161 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,161 INFO L280 TraceCheckUtils]: 74: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,161 INFO L280 TraceCheckUtils]: 75: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,161 INFO L280 TraceCheckUtils]: 76: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,162 INFO L280 TraceCheckUtils]: 77: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,162 INFO L280 TraceCheckUtils]: 78: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,163 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3795#true} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,163 INFO L280 TraceCheckUtils]: 80: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,164 INFO L263 TraceCheckUtils]: 81: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,164 INFO L280 TraceCheckUtils]: 82: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,164 INFO L280 TraceCheckUtils]: 83: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,164 INFO L280 TraceCheckUtils]: 84: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,164 INFO L263 TraceCheckUtils]: 85: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,165 INFO L280 TraceCheckUtils]: 86: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,165 INFO L280 TraceCheckUtils]: 87: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,166 INFO L280 TraceCheckUtils]: 88: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,166 INFO L263 TraceCheckUtils]: 89: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,166 INFO L280 TraceCheckUtils]: 90: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,167 INFO L280 TraceCheckUtils]: 91: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,168 INFO L280 TraceCheckUtils]: 92: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,168 INFO L263 TraceCheckUtils]: 93: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,168 INFO L280 TraceCheckUtils]: 94: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,169 INFO L280 TraceCheckUtils]: 95: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,169 INFO L280 TraceCheckUtils]: 96: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,169 INFO L263 TraceCheckUtils]: 97: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,169 INFO L280 TraceCheckUtils]: 98: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,169 INFO L280 TraceCheckUtils]: 99: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,170 INFO L280 TraceCheckUtils]: 100: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,170 INFO L280 TraceCheckUtils]: 101: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,170 INFO L280 TraceCheckUtils]: 102: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,170 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,170 INFO L280 TraceCheckUtils]: 104: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,170 INFO L263 TraceCheckUtils]: 105: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,171 INFO L280 TraceCheckUtils]: 106: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,171 INFO L280 TraceCheckUtils]: 107: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,171 INFO L280 TraceCheckUtils]: 108: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,171 INFO L280 TraceCheckUtils]: 109: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,171 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,172 INFO L280 TraceCheckUtils]: 111: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,172 INFO L280 TraceCheckUtils]: 112: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,172 INFO L280 TraceCheckUtils]: 113: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,172 INFO L280 TraceCheckUtils]: 114: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,172 INFO L280 TraceCheckUtils]: 115: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,173 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,174 INFO L280 TraceCheckUtils]: 117: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,174 INFO L263 TraceCheckUtils]: 118: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,174 INFO L280 TraceCheckUtils]: 119: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,175 INFO L280 TraceCheckUtils]: 120: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,175 INFO L280 TraceCheckUtils]: 121: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,175 INFO L280 TraceCheckUtils]: 122: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,175 INFO L280 TraceCheckUtils]: 123: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,176 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,177 INFO L280 TraceCheckUtils]: 125: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,177 INFO L280 TraceCheckUtils]: 126: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,178 INFO L280 TraceCheckUtils]: 127: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,178 INFO L280 TraceCheckUtils]: 128: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,179 INFO L280 TraceCheckUtils]: 129: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,180 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,181 INFO L280 TraceCheckUtils]: 131: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,181 INFO L263 TraceCheckUtils]: 132: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,181 INFO L280 TraceCheckUtils]: 133: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,181 INFO L280 TraceCheckUtils]: 134: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,181 INFO L280 TraceCheckUtils]: 135: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,182 INFO L263 TraceCheckUtils]: 136: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,182 INFO L280 TraceCheckUtils]: 137: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,182 INFO L280 TraceCheckUtils]: 138: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,182 INFO L280 TraceCheckUtils]: 139: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,182 INFO L280 TraceCheckUtils]: 140: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,183 INFO L280 TraceCheckUtils]: 141: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,183 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,183 INFO L280 TraceCheckUtils]: 143: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,183 INFO L263 TraceCheckUtils]: 144: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,183 INFO L280 TraceCheckUtils]: 145: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,184 INFO L280 TraceCheckUtils]: 146: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,184 INFO L280 TraceCheckUtils]: 147: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,184 INFO L280 TraceCheckUtils]: 148: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,184 INFO L275 TraceCheckUtils]: 149: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,184 INFO L280 TraceCheckUtils]: 150: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,184 INFO L280 TraceCheckUtils]: 151: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,185 INFO L280 TraceCheckUtils]: 152: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,185 INFO L280 TraceCheckUtils]: 153: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,185 INFO L280 TraceCheckUtils]: 154: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,186 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,186 INFO L280 TraceCheckUtils]: 156: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,187 INFO L280 TraceCheckUtils]: 157: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,187 INFO L280 TraceCheckUtils]: 158: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,187 INFO L280 TraceCheckUtils]: 159: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,188 INFO L280 TraceCheckUtils]: 160: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,189 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,189 INFO L280 TraceCheckUtils]: 162: Hoare triple {4345#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,189 INFO L263 TraceCheckUtils]: 163: Hoare triple {4345#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,189 INFO L280 TraceCheckUtils]: 164: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,190 INFO L280 TraceCheckUtils]: 165: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,190 INFO L280 TraceCheckUtils]: 166: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,191 INFO L280 TraceCheckUtils]: 167: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,191 INFO L280 TraceCheckUtils]: 168: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,192 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 15:55:08,192 INFO L280 TraceCheckUtils]: 170: Hoare triple {3796#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3796#false} is VALID [2020-07-08 15:55:08,192 INFO L280 TraceCheckUtils]: 171: Hoare triple {3796#false} #res := #t~ret0 + #t~ret1; {3796#false} is VALID [2020-07-08 15:55:08,192 INFO L280 TraceCheckUtils]: 172: Hoare triple {3796#false} havoc #t~ret0; {3796#false} is VALID [2020-07-08 15:55:08,192 INFO L280 TraceCheckUtils]: 173: Hoare triple {3796#false} havoc #t~ret1; {3796#false} is VALID [2020-07-08 15:55:08,192 INFO L280 TraceCheckUtils]: 174: Hoare triple {3796#false} assume true; {3796#false} is VALID [2020-07-08 15:55:08,192 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3796#false} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,193 INFO L280 TraceCheckUtils]: 176: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,193 INFO L280 TraceCheckUtils]: 177: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,194 INFO L280 TraceCheckUtils]: 178: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,194 INFO L280 TraceCheckUtils]: 179: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,194 INFO L280 TraceCheckUtils]: 180: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume true; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,195 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {4153#(<= 6 |fibonacci_#in~n|)} {3795#true} #48#return; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 15:55:08,210 INFO L263 TraceCheckUtils]: 0: Hoare triple {3795#true} call ULTIMATE.init(); {3795#true} is VALID [2020-07-08 15:55:08,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,211 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3795#true} {3795#true} #44#return; {3795#true} is VALID [2020-07-08 15:55:08,211 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret4 := main(); {3795#true} is VALID [2020-07-08 15:55:08,211 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} ~x~0 := #t~nondet2; {3795#true} is VALID [2020-07-08 15:55:08,211 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} havoc #t~nondet2; {3795#true} is VALID [2020-07-08 15:55:08,211 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret3 := fibonacci(~x~0); {3795#true} is VALID [2020-07-08 15:55:08,212 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,212 INFO L280 TraceCheckUtils]: 9: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,213 INFO L280 TraceCheckUtils]: 10: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,213 INFO L263 TraceCheckUtils]: 11: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,213 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,213 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,213 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,213 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L263 TraceCheckUtils]: 19: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L263 TraceCheckUtils]: 23: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,214 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L280 TraceCheckUtils]: 28: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L263 TraceCheckUtils]: 31: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,215 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 34: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,216 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,217 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,217 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,217 INFO L280 TraceCheckUtils]: 43: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,217 INFO L263 TraceCheckUtils]: 44: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,217 INFO L280 TraceCheckUtils]: 45: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,217 INFO L280 TraceCheckUtils]: 46: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,218 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,218 INFO L280 TraceCheckUtils]: 48: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,218 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,218 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,218 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,219 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,219 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,219 INFO L280 TraceCheckUtils]: 54: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,219 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,219 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,219 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,220 INFO L263 TraceCheckUtils]: 58: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,220 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,220 INFO L280 TraceCheckUtils]: 60: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,220 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,220 INFO L263 TraceCheckUtils]: 62: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,221 INFO L280 TraceCheckUtils]: 63: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,221 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,221 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,221 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,221 INFO L280 TraceCheckUtils]: 67: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,221 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,222 INFO L280 TraceCheckUtils]: 69: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,222 INFO L263 TraceCheckUtils]: 70: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,222 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,222 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,223 INFO L280 TraceCheckUtils]: 73: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,223 INFO L280 TraceCheckUtils]: 74: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,223 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,223 INFO L280 TraceCheckUtils]: 76: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,223 INFO L280 TraceCheckUtils]: 77: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,223 INFO L280 TraceCheckUtils]: 78: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,224 INFO L280 TraceCheckUtils]: 79: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,224 INFO L280 TraceCheckUtils]: 80: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,224 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,224 INFO L280 TraceCheckUtils]: 82: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,224 INFO L280 TraceCheckUtils]: 83: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,225 INFO L280 TraceCheckUtils]: 84: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,225 INFO L280 TraceCheckUtils]: 85: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,225 INFO L280 TraceCheckUtils]: 86: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,228 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3795#true} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,229 INFO L280 TraceCheckUtils]: 88: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,229 INFO L263 TraceCheckUtils]: 89: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,229 INFO L280 TraceCheckUtils]: 90: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,229 INFO L280 TraceCheckUtils]: 91: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,229 INFO L280 TraceCheckUtils]: 92: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,230 INFO L263 TraceCheckUtils]: 93: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,230 INFO L280 TraceCheckUtils]: 94: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,230 INFO L280 TraceCheckUtils]: 95: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,231 INFO L280 TraceCheckUtils]: 96: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,231 INFO L263 TraceCheckUtils]: 97: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,231 INFO L280 TraceCheckUtils]: 98: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,235 INFO L280 TraceCheckUtils]: 99: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,236 INFO L280 TraceCheckUtils]: 100: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,236 INFO L263 TraceCheckUtils]: 101: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,236 INFO L280 TraceCheckUtils]: 102: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,236 INFO L280 TraceCheckUtils]: 103: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L280 TraceCheckUtils]: 104: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L263 TraceCheckUtils]: 105: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L280 TraceCheckUtils]: 106: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L280 TraceCheckUtils]: 107: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L280 TraceCheckUtils]: 108: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L280 TraceCheckUtils]: 109: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L280 TraceCheckUtils]: 110: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,237 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,238 INFO L280 TraceCheckUtils]: 112: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,238 INFO L263 TraceCheckUtils]: 113: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,238 INFO L280 TraceCheckUtils]: 114: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,238 INFO L280 TraceCheckUtils]: 115: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,238 INFO L280 TraceCheckUtils]: 116: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,238 INFO L280 TraceCheckUtils]: 117: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,239 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,239 INFO L280 TraceCheckUtils]: 119: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,239 INFO L280 TraceCheckUtils]: 120: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,239 INFO L280 TraceCheckUtils]: 121: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,239 INFO L280 TraceCheckUtils]: 122: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,239 INFO L280 TraceCheckUtils]: 123: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,240 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,241 INFO L280 TraceCheckUtils]: 125: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,241 INFO L263 TraceCheckUtils]: 126: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,241 INFO L280 TraceCheckUtils]: 127: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,241 INFO L280 TraceCheckUtils]: 128: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,241 INFO L280 TraceCheckUtils]: 129: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,241 INFO L280 TraceCheckUtils]: 130: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,241 INFO L280 TraceCheckUtils]: 131: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,242 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,245 INFO L280 TraceCheckUtils]: 133: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,246 INFO L280 TraceCheckUtils]: 134: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,246 INFO L280 TraceCheckUtils]: 135: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,247 INFO L280 TraceCheckUtils]: 136: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,247 INFO L280 TraceCheckUtils]: 137: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,248 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,249 INFO L280 TraceCheckUtils]: 139: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:08,249 INFO L263 TraceCheckUtils]: 140: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,249 INFO L280 TraceCheckUtils]: 141: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,249 INFO L280 TraceCheckUtils]: 142: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,249 INFO L280 TraceCheckUtils]: 143: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 15:55:08,249 INFO L263 TraceCheckUtils]: 144: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 15:55:08,249 INFO L280 TraceCheckUtils]: 145: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,249 INFO L280 TraceCheckUtils]: 146: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 15:55:08,250 INFO L280 TraceCheckUtils]: 147: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 15:55:08,250 INFO L280 TraceCheckUtils]: 148: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 15:55:08,250 INFO L280 TraceCheckUtils]: 149: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,250 INFO L275 TraceCheckUtils]: 150: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 15:55:08,251 INFO L280 TraceCheckUtils]: 151: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,251 INFO L263 TraceCheckUtils]: 152: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,251 INFO L280 TraceCheckUtils]: 153: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 15:55:08,251 INFO L280 TraceCheckUtils]: 154: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 15:55:08,251 INFO L280 TraceCheckUtils]: 155: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L280 TraceCheckUtils]: 156: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L280 TraceCheckUtils]: 158: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L280 TraceCheckUtils]: 159: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L280 TraceCheckUtils]: 160: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L280 TraceCheckUtils]: 161: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 15:55:08,252 INFO L280 TraceCheckUtils]: 162: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 15:55:08,253 INFO L275 TraceCheckUtils]: 163: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,253 INFO L280 TraceCheckUtils]: 164: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,254 INFO L280 TraceCheckUtils]: 165: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,254 INFO L280 TraceCheckUtils]: 166: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,255 INFO L280 TraceCheckUtils]: 167: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,257 INFO L280 TraceCheckUtils]: 168: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,263 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,264 INFO L280 TraceCheckUtils]: 170: Hoare triple {4345#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 15:55:08,264 INFO L263 TraceCheckUtils]: 171: Hoare triple {4345#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 15:55:08,274 INFO L280 TraceCheckUtils]: 172: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,275 INFO L280 TraceCheckUtils]: 173: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,276 INFO L280 TraceCheckUtils]: 174: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,276 INFO L280 TraceCheckUtils]: 175: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,277 INFO L280 TraceCheckUtils]: 176: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:08,278 INFO L275 TraceCheckUtils]: 177: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 15:55:08,278 INFO L280 TraceCheckUtils]: 178: Hoare triple {3796#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3796#false} is VALID [2020-07-08 15:55:08,278 INFO L280 TraceCheckUtils]: 179: Hoare triple {3796#false} #res := #t~ret0 + #t~ret1; {3796#false} is VALID [2020-07-08 15:55:08,279 INFO L280 TraceCheckUtils]: 180: Hoare triple {3796#false} havoc #t~ret0; {3796#false} is VALID [2020-07-08 15:55:08,279 INFO L280 TraceCheckUtils]: 181: Hoare triple {3796#false} havoc #t~ret1; {3796#false} is VALID [2020-07-08 15:55:08,279 INFO L280 TraceCheckUtils]: 182: Hoare triple {3796#false} assume true; {3796#false} is VALID [2020-07-08 15:55:08,279 INFO L275 TraceCheckUtils]: 183: Hoare quadruple {3796#false} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,280 INFO L280 TraceCheckUtils]: 184: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,280 INFO L280 TraceCheckUtils]: 185: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,281 INFO L280 TraceCheckUtils]: 186: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,281 INFO L280 TraceCheckUtils]: 187: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,282 INFO L280 TraceCheckUtils]: 188: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume true; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:08,283 INFO L275 TraceCheckUtils]: 189: Hoare quadruple {4153#(<= 6 |fibonacci_#in~n|)} {3795#true} #48#return; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 15:55:08,283 INFO L280 TraceCheckUtils]: 190: Hoare triple {3981#(<= 6 main_~x~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 15:55:08,284 INFO L280 TraceCheckUtils]: 191: Hoare triple {3981#(<= 6 main_~x~0)} ~result~0 := #t~ret3; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 15:55:08,284 INFO L280 TraceCheckUtils]: 192: Hoare triple {3981#(<= 6 main_~x~0)} havoc #t~ret3; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 15:55:08,285 INFO L280 TraceCheckUtils]: 193: Hoare triple {3981#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {3796#false} is VALID [2020-07-08 15:55:08,285 INFO L280 TraceCheckUtils]: 194: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2020-07-08 15:55:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 92 proven. 32 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2020-07-08 15:55:08,311 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:08,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209470690] [2020-07-08 15:55:08,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:08,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 15:55:08,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227295865] [2020-07-08 15:55:08,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 195 [2020-07-08 15:55:08,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:08,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 15:55:08,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:08,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 15:55:08,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 15:55:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-08 15:55:08,436 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 12 states. [2020-07-08 15:55:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:09,345 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2020-07-08 15:55:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 15:55:09,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 195 [2020-07-08 15:55:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 15:55:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2020-07-08 15:55:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 15:55:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2020-07-08 15:55:09,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2020-07-08 15:55:09,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:09,479 INFO L225 Difference]: With dead ends: 141 [2020-07-08 15:55:09,479 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 15:55:09,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-08 15:55:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 15:55:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-08 15:55:09,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:09,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-08 15:55:09,593 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 15:55:09,593 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 15:55:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:09,596 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-07-08 15:55:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-08 15:55:09,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:09,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:09,598 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 15:55:09,598 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 15:55:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:09,600 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-07-08 15:55:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-08 15:55:09,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:09,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:09,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:09,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 15:55:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2020-07-08 15:55:09,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 195 [2020-07-08 15:55:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:09,604 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2020-07-08 15:55:09,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 15:55:09,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 76 transitions. [2020-07-08 15:55:09,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-08 15:55:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-08 15:55:09,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:09,708 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:55:09,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 15:55:09,708 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:09,709 INFO L82 PathProgramCache]: Analyzing trace with hash -311463261, now seen corresponding path program 7 times [2020-07-08 15:55:09,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:09,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012809294] [2020-07-08 15:55:09,709 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 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-08 15:55:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:55:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:55:09,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 15:55:09,969 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:103) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement$AtomicTraceElementBuilder.build(AtomicTraceElement.java:308) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createATESequence(IcfgProgramExecution.java:227) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:77) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) 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-08 15:55:09,977 INFO L168 Benchmark]: Toolchain (without parser) took 12497.85 ms. Allocated memory was 138.9 MB in the beginning and 380.6 MB in the end (delta: 241.7 MB). Free memory was 104.3 MB in the beginning and 345.5 MB in the end (delta: -241.2 MB). Peak memory consumption was 455.9 kB. Max. memory is 7.1 GB. [2020-07-08 15:55:09,979 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 15:55:09,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.18 ms. Allocated memory is still 138.9 MB. Free memory was 103.8 MB in the beginning and 94.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:09,980 INFO L168 Benchmark]: Boogie Preprocessor took 114.73 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 94.3 MB in the beginning and 182.1 MB in the end (delta: -87.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:09,983 INFO L168 Benchmark]: RCFGBuilder took 386.65 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 164.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:09,986 INFO L168 Benchmark]: TraceAbstraction took 11700.32 ms. Allocated memory was 202.9 MB in the beginning and 380.6 MB in the end (delta: 177.7 MB). Free memory was 163.6 MB in the beginning and 345.5 MB in the end (delta: -181.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 15:55:09,991 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.18 ms. Allocated memory is still 138.9 MB. Free memory was 103.8 MB in the beginning and 94.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.73 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 94.3 MB in the beginning and 182.1 MB in the end (delta: -87.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.65 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 164.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11700.32 ms. Allocated memory was 202.9 MB in the beginning and 380.6 MB in the end (delta: 177.7 MB). Free memory was 163.6 MB in the beginning and 345.5 MB in the end (delta: -181.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;: de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...