/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:48:17,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:48:17,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:48:17,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:48:17,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:48:17,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:48:17,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:48:17,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:48:17,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:48:17,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:48:17,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:48:17,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:48:17,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:48:17,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:48:17,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:48:17,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:48:17,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:48:17,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:48:17,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:48:17,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:48:17,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:48:17,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:48:17,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:48:17,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:48:17,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:48:17,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:48:17,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:48:17,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:48:17,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:48:17,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:48:17,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:48:17,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:48:17,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:48:17,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:48:17,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:48:17,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:48:17,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:48:17,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:48:17,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:48:17,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:48:17,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:48:17,482 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:48:17,492 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:48:17,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:48:17,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:48:17,493 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:48:17,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:48:17,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:48:17,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:48:17,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:48:17,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:48:17,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:48:17,495 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:48:17,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:48:17,495 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:48:17,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:48:17,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:48:17,496 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:48:17,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:48:17,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:48:17,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:48:17,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:48:17,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:48:17,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:48:17,497 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:48:17,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:48:17,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:48:17,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:48:17,778 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:48:17,778 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:48:17,779 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-07-11 00:48:17,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6589e8c/f754be62ce114ebf8a03423bdedf1b9d/FLAGc62e08302 [2020-07-11 00:48:18,320 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:48:18,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-07-11 00:48:18,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6589e8c/f754be62ce114ebf8a03423bdedf1b9d/FLAGc62e08302 [2020-07-11 00:48:18,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6589e8c/f754be62ce114ebf8a03423bdedf1b9d [2020-07-11 00:48:18,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:48:18,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:48:18,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:48:18,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:48:18,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:48:18,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:48:18" (1/1) ... [2020-07-11 00:48:18,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb8949b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:18, skipping insertion in model container [2020-07-11 00:48:18,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:48:18" (1/1) ... [2020-07-11 00:48:18,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:48:18,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:48:18,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:48:18,968 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:48:18,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:48:19,004 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:48:19,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19 WrapperNode [2020-07-11 00:48:19,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:48:19,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:48:19,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:48:19,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:48:19,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (1/1) ... [2020-07-11 00:48:19,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:48:19,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:48:19,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:48:19,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:48:19,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (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-11 00:48:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:48:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:48:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-11 00:48:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-11 00:48:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:48:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:48:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:48:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-11 00:48:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-11 00:48:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:48:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:48:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:48:19,586 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:48:19,588 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:48:19,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:48:19 BoogieIcfgContainer [2020-07-11 00:48:19,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:48:19,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:48:19,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:48:19,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:48:19,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:48:18" (1/3) ... [2020-07-11 00:48:19,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190f32f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:48:19, skipping insertion in model container [2020-07-11 00:48:19,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:48:19" (2/3) ... [2020-07-11 00:48:19,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190f32f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:48:19, skipping insertion in model container [2020-07-11 00:48:19,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:48:19" (3/3) ... [2020-07-11 00:48:19,614 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2020-07-11 00:48:19,624 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:48:19,633 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:48:19,651 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:48:19,675 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:48:19,675 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:48:19,676 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:48:19,676 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:48:19,677 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:48:19,677 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:48:19,677 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:48:19,677 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:48:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-11 00:48:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 00:48:19,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:19,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:19,709 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-11 00:48:19,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:19,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033386594] [2020-07-11 00:48:19,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:19,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-11 00:48:19,927 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-11 00:48:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:19,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:19,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:19,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:20,001 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:20,014 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 4 main_~x~0)} #63#return; {49#false} is VALID [2020-07-11 00:48:20,014 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2020-07-11 00:48:20,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-11 00:48:20,015 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-11 00:48:20,016 INFO L263 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2020-07-11 00:48:20,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} ~x~0 := 4; {52#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:20,018 INFO L263 TraceCheckUtils]: 5: Hoare triple {52#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {48#true} is VALID [2020-07-11 00:48:20,022 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:20,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:20,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:20,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:20,031 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 4 main_~x~0)} #63#return; {49#false} is VALID [2020-07-11 00:48:20,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {49#false} is VALID [2020-07-11 00:48:20,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#false} ~result~0 := #t~ret4; {49#false} is VALID [2020-07-11 00:48:20,033 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#false} havoc #t~ret4; {49#false} is VALID [2020-07-11 00:48:20,033 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#false} assume 3 == ~result~0; {49#false} is VALID [2020-07-11 00:48:20,034 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-11 00:48:20,036 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-11 00:48:20,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033386594] [2020-07-11 00:48:20,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:48:20,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:48:20,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298312901] [2020-07-11 00:48:20,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:48:20,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:20,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:48:20,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:20,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:48:20,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:20,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:48:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:48:20,110 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-11 00:48:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:20,540 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-11 00:48:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:48:20,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 00:48:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:48:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-11 00:48:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:48:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-11 00:48:20,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-11 00:48:20,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:20,728 INFO L225 Difference]: With dead ends: 58 [2020-07-11 00:48:20,728 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 00:48:20,734 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-11 00:48:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 00:48:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-11 00:48:20,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:20,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-11 00:48:20,838 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-11 00:48:20,838 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-11 00:48:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:20,848 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-11 00:48:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-11 00:48:20,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:20,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:20,850 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-11 00:48:20,850 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-11 00:48:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:20,859 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-11 00:48:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-11 00:48:20,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:20,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:20,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:20,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:48:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-11 00:48:20,871 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-11 00:48:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:20,872 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-11 00:48:20,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:48:20,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-11 00:48:20,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-11 00:48:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-11 00:48:20,953 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:20,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:20,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:48:20,954 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-11 00:48:20,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:20,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843208695] [2020-07-11 00:48:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:20,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-11 00:48:20,999 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-11 00:48:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:21,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:21,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:21,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:21,045 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:21,046 INFO L280 TraceCheckUtils]: 4: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:21,048 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 4 main_~x~0)} #63#return; {349#false} is VALID [2020-07-11 00:48:21,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-11 00:48:21,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-11 00:48:21,049 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-11 00:48:21,050 INFO L263 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2020-07-11 00:48:21,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 4; {352#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:21,051 INFO L263 TraceCheckUtils]: 5: Hoare triple {352#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {348#true} is VALID [2020-07-11 00:48:21,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:21,053 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:21,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:21,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:21,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:21,057 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 4 main_~x~0)} #63#return; {349#false} is VALID [2020-07-11 00:48:21,058 INFO L280 TraceCheckUtils]: 12: Hoare triple {349#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {349#false} is VALID [2020-07-11 00:48:21,058 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} ~result~0 := #t~ret4; {349#false} is VALID [2020-07-11 00:48:21,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {349#false} havoc #t~ret4; {349#false} is VALID [2020-07-11 00:48:21,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {349#false} assume 3 == ~result~0; {349#false} is VALID [2020-07-11 00:48:21,059 INFO L280 TraceCheckUtils]: 16: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-11 00:48:21,060 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-11 00:48:21,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843208695] [2020-07-11 00:48:21,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:48:21,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:48:21,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230959618] [2020-07-11 00:48:21,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-11 00:48:21,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:21,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:48:21,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:21,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:48:21,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:48:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:48:21,088 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-11 00:48:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:21,365 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-11 00:48:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:48:21,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-11 00:48:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:48:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-11 00:48:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:48:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-11 00:48:21,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-11 00:48:21,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:21,451 INFO L225 Difference]: With dead ends: 50 [2020-07-11 00:48:21,451 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 00:48:21,453 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-11 00:48:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 00:48:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-11 00:48:21,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:21,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-11 00:48:21,505 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-11 00:48:21,505 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-11 00:48:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:21,511 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-11 00:48:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-11 00:48:21,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:21,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:21,513 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-11 00:48:21,514 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-11 00:48:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:21,520 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-11 00:48:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-11 00:48:21,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:21,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:21,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:21,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:48:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-11 00:48:21,527 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-11 00:48:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:21,527 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-11 00:48:21,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:48:21,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-11 00:48:21,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-11 00:48:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 00:48:21,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:21,635 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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-11 00:48:21,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:48:21,636 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-11 00:48:21,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:21,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528498144] [2020-07-11 00:48:21,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:21,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-11 00:48:21,691 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-11 00:48:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:21,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:21,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,793 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-11 00:48:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:21,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-11 00:48:21,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-11 00:48:21,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-11 00:48:21,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-11 00:48:21,803 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-11 00:48:21,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-11 00:48:21,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-11 00:48:21,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-11 00:48:21,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-11 00:48:21,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:21,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,809 INFO L280 TraceCheckUtils]: 7: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,810 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-11 00:48:21,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-11 00:48:21,811 INFO L263 TraceCheckUtils]: 10: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-11 00:48:21,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-11 00:48:21,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-11 00:48:21,812 INFO L280 TraceCheckUtils]: 13: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-11 00:48:21,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-11 00:48:21,813 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-11 00:48:21,813 INFO L280 TraceCheckUtils]: 16: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-11 00:48:21,814 INFO L280 TraceCheckUtils]: 17: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-11 00:48:21,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-11 00:48:21,814 INFO L280 TraceCheckUtils]: 19: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-11 00:48:21,815 INFO L280 TraceCheckUtils]: 20: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-11 00:48:21,815 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {638#false} {641#(<= 4 main_~x~0)} #63#return; {638#false} is VALID [2020-07-11 00:48:21,816 INFO L263 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2020-07-11 00:48:21,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-11 00:48:21,817 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-11 00:48:21,817 INFO L263 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret5 := main(); {637#true} is VALID [2020-07-11 00:48:21,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 4; {641#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:21,819 INFO L263 TraceCheckUtils]: 5: Hoare triple {641#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {637#true} is VALID [2020-07-11 00:48:21,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-11 00:48:21,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-11 00:48:21,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-11 00:48:21,822 INFO L263 TraceCheckUtils]: 9: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-11 00:48:21,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:21,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,825 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:21,826 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-11 00:48:21,827 INFO L280 TraceCheckUtils]: 15: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-11 00:48:21,827 INFO L263 TraceCheckUtils]: 16: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-11 00:48:21,828 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-11 00:48:21,828 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-11 00:48:21,828 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-11 00:48:21,829 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-11 00:48:21,829 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-11 00:48:21,829 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-11 00:48:21,830 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-11 00:48:21,830 INFO L280 TraceCheckUtils]: 24: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-11 00:48:21,830 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-11 00:48:21,831 INFO L280 TraceCheckUtils]: 26: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-11 00:48:21,831 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {638#false} {641#(<= 4 main_~x~0)} #63#return; {638#false} is VALID [2020-07-11 00:48:21,831 INFO L280 TraceCheckUtils]: 28: Hoare triple {638#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {638#false} is VALID [2020-07-11 00:48:21,832 INFO L280 TraceCheckUtils]: 29: Hoare triple {638#false} ~result~0 := #t~ret4; {638#false} is VALID [2020-07-11 00:48:21,832 INFO L280 TraceCheckUtils]: 30: Hoare triple {638#false} havoc #t~ret4; {638#false} is VALID [2020-07-11 00:48:21,832 INFO L280 TraceCheckUtils]: 31: Hoare triple {638#false} assume 3 == ~result~0; {638#false} is VALID [2020-07-11 00:48:21,833 INFO L280 TraceCheckUtils]: 32: Hoare triple {638#false} assume !false; {638#false} is VALID [2020-07-11 00:48:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 00:48:21,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528498144] [2020-07-11 00:48:21,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:21,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:48:21,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358419815] [2020-07-11 00:48:21,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-11 00:48:21,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:21,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:48:21,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:21,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:48:21,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:48:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:48:21,879 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-11 00:48:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:22,285 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-11 00:48:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:48:22,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-11 00:48:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:48:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-11 00:48:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:48:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-11 00:48:22,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-11 00:48:22,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:22,443 INFO L225 Difference]: With dead ends: 82 [2020-07-11 00:48:22,443 INFO L226 Difference]: Without dead ends: 46 [2020-07-11 00:48:22,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:48:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-11 00:48:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-11 00:48:22,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:22,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-11 00:48:22,520 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-11 00:48:22,521 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-11 00:48:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:22,529 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-11 00:48:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-11 00:48:22,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:22,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:22,532 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-11 00:48:22,533 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-11 00:48:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:22,541 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-11 00:48:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-11 00:48:22,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:22,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:22,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:22,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-11 00:48:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-11 00:48:22,552 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-11 00:48:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:22,552 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-11 00:48:22,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:48:22,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-11 00:48:22,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-11 00:48:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:48:22,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:22,619 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-07-11 00:48:22,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:48:22,621 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:22,621 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-11 00:48:22,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:22,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742230036] [2020-07-11 00:48:22,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:22,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-11 00:48:22,672 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1026#true} {1026#true} #59#return; {1026#true} is VALID [2020-07-11 00:48:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:22,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1067#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:22,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {1067#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1067#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:22,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {1067#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,757 INFO L280 TraceCheckUtils]: 3: Hoare triple {1068#(<= |fibo2_#in~n| 1)} #res := 1; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,773 INFO L280 TraceCheckUtils]: 4: Hoare triple {1068#(<= |fibo2_#in~n| 1)} assume true; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,774 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1068#(<= |fibo2_#in~n| 1)} {1054#(= fibo1_~n |fibo1_#in~n|)} #69#return; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:22,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-11 00:48:22,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-11 00:48:22,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} #res := 0; {1026#true} is VALID [2020-07-11 00:48:22,791 INFO L280 TraceCheckUtils]: 3: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-11 00:48:22,792 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1026#true} {1061#(<= |fibo1_#in~n| 2)} #71#return; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1054#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:22,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {1054#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1054#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:22,797 INFO L280 TraceCheckUtils]: 2: Hoare triple {1054#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1054#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:22,797 INFO L263 TraceCheckUtils]: 3: Hoare triple {1054#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {1026#true} is VALID [2020-07-11 00:48:22,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {1026#true} ~n := #in~n; {1067#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:22,798 INFO L280 TraceCheckUtils]: 5: Hoare triple {1067#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1067#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:22,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {1067#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {1068#(<= |fibo2_#in~n| 1)} #res := 1; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,800 INFO L280 TraceCheckUtils]: 8: Hoare triple {1068#(<= |fibo2_#in~n| 1)} assume true; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,804 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1068#(<= |fibo2_#in~n| 1)} {1054#(= fibo1_~n |fibo1_#in~n|)} #69#return; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,805 INFO L280 TraceCheckUtils]: 10: Hoare triple {1061#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,805 INFO L263 TraceCheckUtils]: 11: Hoare triple {1061#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {1026#true} is VALID [2020-07-11 00:48:22,805 INFO L280 TraceCheckUtils]: 12: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-11 00:48:22,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-11 00:48:22,805 INFO L280 TraceCheckUtils]: 14: Hoare triple {1026#true} #res := 0; {1026#true} is VALID [2020-07-11 00:48:22,806 INFO L280 TraceCheckUtils]: 15: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-11 00:48:22,812 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1026#true} {1061#(<= |fibo1_#in~n| 2)} #71#return; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,813 INFO L280 TraceCheckUtils]: 17: Hoare triple {1061#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {1061#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {1061#(<= |fibo1_#in~n| 2)} havoc #t~ret1; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,815 INFO L280 TraceCheckUtils]: 20: Hoare triple {1061#(<= |fibo1_#in~n| 2)} havoc #t~ret0; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,816 INFO L280 TraceCheckUtils]: 21: Hoare triple {1061#(<= |fibo1_#in~n| 2)} assume true; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,816 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1061#(<= |fibo1_#in~n| 2)} {1030#(<= 4 main_~x~0)} #63#return; {1027#false} is VALID [2020-07-11 00:48:22,817 INFO L263 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2020-07-11 00:48:22,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-11 00:48:22,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1026#true} {1026#true} #59#return; {1026#true} is VALID [2020-07-11 00:48:22,818 INFO L263 TraceCheckUtils]: 3: Hoare triple {1026#true} call #t~ret5 := main(); {1026#true} is VALID [2020-07-11 00:48:22,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {1026#true} ~x~0 := 4; {1030#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:22,819 INFO L263 TraceCheckUtils]: 5: Hoare triple {1030#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1026#true} is VALID [2020-07-11 00:48:22,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {1026#true} ~n := #in~n; {1054#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:22,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {1054#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1054#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:22,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {1054#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1054#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:22,821 INFO L263 TraceCheckUtils]: 9: Hoare triple {1054#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {1026#true} is VALID [2020-07-11 00:48:22,822 INFO L280 TraceCheckUtils]: 10: Hoare triple {1026#true} ~n := #in~n; {1067#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:22,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {1067#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1067#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:22,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {1067#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {1068#(<= |fibo2_#in~n| 1)} #res := 1; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,825 INFO L280 TraceCheckUtils]: 14: Hoare triple {1068#(<= |fibo2_#in~n| 1)} assume true; {1068#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:22,826 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1068#(<= |fibo2_#in~n| 1)} {1054#(= fibo1_~n |fibo1_#in~n|)} #69#return; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,826 INFO L280 TraceCheckUtils]: 16: Hoare triple {1061#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,827 INFO L263 TraceCheckUtils]: 17: Hoare triple {1061#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {1026#true} is VALID [2020-07-11 00:48:22,827 INFO L280 TraceCheckUtils]: 18: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-11 00:48:22,827 INFO L280 TraceCheckUtils]: 19: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-11 00:48:22,827 INFO L280 TraceCheckUtils]: 20: Hoare triple {1026#true} #res := 0; {1026#true} is VALID [2020-07-11 00:48:22,827 INFO L280 TraceCheckUtils]: 21: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-11 00:48:22,828 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1026#true} {1061#(<= |fibo1_#in~n| 2)} #71#return; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,828 INFO L280 TraceCheckUtils]: 23: Hoare triple {1061#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,829 INFO L280 TraceCheckUtils]: 24: Hoare triple {1061#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,830 INFO L280 TraceCheckUtils]: 25: Hoare triple {1061#(<= |fibo1_#in~n| 2)} havoc #t~ret1; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,830 INFO L280 TraceCheckUtils]: 26: Hoare triple {1061#(<= |fibo1_#in~n| 2)} havoc #t~ret0; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,830 INFO L280 TraceCheckUtils]: 27: Hoare triple {1061#(<= |fibo1_#in~n| 2)} assume true; {1061#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:22,831 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1061#(<= |fibo1_#in~n| 2)} {1030#(<= 4 main_~x~0)} #63#return; {1027#false} is VALID [2020-07-11 00:48:22,831 INFO L280 TraceCheckUtils]: 29: Hoare triple {1027#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1027#false} is VALID [2020-07-11 00:48:22,832 INFO L280 TraceCheckUtils]: 30: Hoare triple {1027#false} ~result~0 := #t~ret4; {1027#false} is VALID [2020-07-11 00:48:22,832 INFO L280 TraceCheckUtils]: 31: Hoare triple {1027#false} havoc #t~ret4; {1027#false} is VALID [2020-07-11 00:48:22,832 INFO L280 TraceCheckUtils]: 32: Hoare triple {1027#false} assume 3 == ~result~0; {1027#false} is VALID [2020-07-11 00:48:22,832 INFO L280 TraceCheckUtils]: 33: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2020-07-11 00:48:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 00:48:22,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742230036] [2020-07-11 00:48:22,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:48:22,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939029105] [2020-07-11 00:48:22,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-11 00:48:22,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:22,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:48:22,875 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-11 00:48:22,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:48:22,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:48:22,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:48:22,877 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-07-11 00:48:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:23,505 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-07-11 00:48:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:48:23,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-11 00:48:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:48:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2020-07-11 00:48:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:48:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2020-07-11 00:48:23,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 86 transitions. [2020-07-11 00:48:23,628 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-11 00:48:23,632 INFO L225 Difference]: With dead ends: 74 [2020-07-11 00:48:23,632 INFO L226 Difference]: Without dead ends: 68 [2020-07-11 00:48:23,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:48:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-11 00:48:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-11 00:48:23,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:23,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2020-07-11 00:48:23,726 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2020-07-11 00:48:23,726 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2020-07-11 00:48:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:23,735 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2020-07-11 00:48:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2020-07-11 00:48:23,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:23,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:23,737 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2020-07-11 00:48:23,737 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2020-07-11 00:48:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:23,744 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2020-07-11 00:48:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2020-07-11 00:48:23,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:23,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:23,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:23,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-11 00:48:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-07-11 00:48:23,749 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-07-11 00:48:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:23,750 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-07-11 00:48:23,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:48:23,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 83 transitions. [2020-07-11 00:48:23,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-07-11 00:48:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 00:48:23,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:23,844 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:23,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:48:23,845 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-07-11 00:48:23,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:23,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091334663] [2020-07-11 00:48:23,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:23,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:23,907 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1492#true} {1492#true} #59#return; {1492#true} is VALID [2020-07-11 00:48:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:24,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#true} ~n := #in~n; {1574#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:24,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {1574#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {1575#(<= |fibo1_#in~n| 0)} #res := 0; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {1575#(<= |fibo1_#in~n| 0)} assume true; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,010 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1575#(<= |fibo1_#in~n| 0)} {1563#(< 1 fibo2_~n)} #65#return; {1493#false} is VALID [2020-07-11 00:48:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:24,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,016 INFO L280 TraceCheckUtils]: 2: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,017 INFO L280 TraceCheckUtils]: 3: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,017 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1492#true} {1493#false} #67#return; {1493#false} is VALID [2020-07-11 00:48:24,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {1492#true} assume !(~n < 1); {1562#(< 0 fibo2_~n)} is VALID [2020-07-11 00:48:24,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {1562#(< 0 fibo2_~n)} assume !(1 == ~n); {1563#(< 1 fibo2_~n)} is VALID [2020-07-11 00:48:24,019 INFO L263 TraceCheckUtils]: 3: Hoare triple {1563#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1492#true} is VALID [2020-07-11 00:48:24,020 INFO L280 TraceCheckUtils]: 4: Hoare triple {1492#true} ~n := #in~n; {1574#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:24,021 INFO L280 TraceCheckUtils]: 5: Hoare triple {1574#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,021 INFO L280 TraceCheckUtils]: 6: Hoare triple {1575#(<= |fibo1_#in~n| 0)} #res := 0; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,022 INFO L280 TraceCheckUtils]: 7: Hoare triple {1575#(<= |fibo1_#in~n| 0)} assume true; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,023 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1575#(<= |fibo1_#in~n| 0)} {1563#(< 1 fibo2_~n)} #65#return; {1493#false} is VALID [2020-07-11 00:48:24,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {1493#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,024 INFO L263 TraceCheckUtils]: 10: Hoare triple {1493#false} call #t~ret3 := fibo1(~n - 2); {1492#true} is VALID [2020-07-11 00:48:24,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,024 INFO L280 TraceCheckUtils]: 12: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,025 INFO L280 TraceCheckUtils]: 13: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,025 INFO L280 TraceCheckUtils]: 14: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,025 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1492#true} {1493#false} #67#return; {1493#false} is VALID [2020-07-11 00:48:24,025 INFO L280 TraceCheckUtils]: 16: Hoare triple {1493#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,026 INFO L280 TraceCheckUtils]: 17: Hoare triple {1493#false} #res := #t~ret2 + #t~ret3; {1493#false} is VALID [2020-07-11 00:48:24,026 INFO L280 TraceCheckUtils]: 18: Hoare triple {1493#false} havoc #t~ret3; {1493#false} is VALID [2020-07-11 00:48:24,026 INFO L280 TraceCheckUtils]: 19: Hoare triple {1493#false} havoc #t~ret2; {1493#false} is VALID [2020-07-11 00:48:24,026 INFO L280 TraceCheckUtils]: 20: Hoare triple {1493#false} assume true; {1493#false} is VALID [2020-07-11 00:48:24,027 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1493#false} {1492#true} #69#return; {1493#false} is VALID [2020-07-11 00:48:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:24,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,035 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1492#true} {1493#false} #71#return; {1493#false} is VALID [2020-07-11 00:48:24,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {1492#true} assume !(~n < 1); {1492#true} is VALID [2020-07-11 00:48:24,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {1492#true} assume !(1 == ~n); {1492#true} is VALID [2020-07-11 00:48:24,036 INFO L263 TraceCheckUtils]: 3: Hoare triple {1492#true} call #t~ret0 := fibo2(~n - 1); {1492#true} is VALID [2020-07-11 00:48:24,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {1492#true} assume !(~n < 1); {1562#(< 0 fibo2_~n)} is VALID [2020-07-11 00:48:24,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {1562#(< 0 fibo2_~n)} assume !(1 == ~n); {1563#(< 1 fibo2_~n)} is VALID [2020-07-11 00:48:24,038 INFO L263 TraceCheckUtils]: 7: Hoare triple {1563#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1492#true} is VALID [2020-07-11 00:48:24,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {1492#true} ~n := #in~n; {1574#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:24,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {1574#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {1575#(<= |fibo1_#in~n| 0)} #res := 0; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,044 INFO L280 TraceCheckUtils]: 11: Hoare triple {1575#(<= |fibo1_#in~n| 0)} assume true; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,045 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1575#(<= |fibo1_#in~n| 0)} {1563#(< 1 fibo2_~n)} #65#return; {1493#false} is VALID [2020-07-11 00:48:24,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {1493#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,046 INFO L263 TraceCheckUtils]: 14: Hoare triple {1493#false} call #t~ret3 := fibo1(~n - 2); {1492#true} is VALID [2020-07-11 00:48:24,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,046 INFO L280 TraceCheckUtils]: 16: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,046 INFO L280 TraceCheckUtils]: 17: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,047 INFO L280 TraceCheckUtils]: 18: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,047 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1492#true} {1493#false} #67#return; {1493#false} is VALID [2020-07-11 00:48:24,047 INFO L280 TraceCheckUtils]: 20: Hoare triple {1493#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,047 INFO L280 TraceCheckUtils]: 21: Hoare triple {1493#false} #res := #t~ret2 + #t~ret3; {1493#false} is VALID [2020-07-11 00:48:24,047 INFO L280 TraceCheckUtils]: 22: Hoare triple {1493#false} havoc #t~ret3; {1493#false} is VALID [2020-07-11 00:48:24,048 INFO L280 TraceCheckUtils]: 23: Hoare triple {1493#false} havoc #t~ret2; {1493#false} is VALID [2020-07-11 00:48:24,048 INFO L280 TraceCheckUtils]: 24: Hoare triple {1493#false} assume true; {1493#false} is VALID [2020-07-11 00:48:24,048 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1493#false} {1492#true} #69#return; {1493#false} is VALID [2020-07-11 00:48:24,048 INFO L280 TraceCheckUtils]: 26: Hoare triple {1493#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,049 INFO L263 TraceCheckUtils]: 27: Hoare triple {1493#false} call #t~ret1 := fibo2(~n - 2); {1492#true} is VALID [2020-07-11 00:48:24,049 INFO L280 TraceCheckUtils]: 28: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,049 INFO L280 TraceCheckUtils]: 29: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,049 INFO L280 TraceCheckUtils]: 30: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,050 INFO L280 TraceCheckUtils]: 31: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,050 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1492#true} {1493#false} #71#return; {1493#false} is VALID [2020-07-11 00:48:24,051 INFO L280 TraceCheckUtils]: 33: Hoare triple {1493#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,051 INFO L280 TraceCheckUtils]: 34: Hoare triple {1493#false} #res := #t~ret0 + #t~ret1; {1493#false} is VALID [2020-07-11 00:48:24,051 INFO L280 TraceCheckUtils]: 35: Hoare triple {1493#false} havoc #t~ret1; {1493#false} is VALID [2020-07-11 00:48:24,051 INFO L280 TraceCheckUtils]: 36: Hoare triple {1493#false} havoc #t~ret0; {1493#false} is VALID [2020-07-11 00:48:24,052 INFO L280 TraceCheckUtils]: 37: Hoare triple {1493#false} assume true; {1493#false} is VALID [2020-07-11 00:48:24,052 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1493#false} {1492#true} #63#return; {1493#false} is VALID [2020-07-11 00:48:24,053 INFO L263 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2020-07-11 00:48:24,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,054 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1492#true} {1492#true} #59#return; {1492#true} is VALID [2020-07-11 00:48:24,054 INFO L263 TraceCheckUtils]: 3: Hoare triple {1492#true} call #t~ret5 := main(); {1492#true} is VALID [2020-07-11 00:48:24,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {1492#true} ~x~0 := 4; {1492#true} is VALID [2020-07-11 00:48:24,054 INFO L263 TraceCheckUtils]: 5: Hoare triple {1492#true} call #t~ret4 := fibo1(~x~0); {1492#true} is VALID [2020-07-11 00:48:24,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {1492#true} assume !(~n < 1); {1492#true} is VALID [2020-07-11 00:48:24,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {1492#true} assume !(1 == ~n); {1492#true} is VALID [2020-07-11 00:48:24,055 INFO L263 TraceCheckUtils]: 9: Hoare triple {1492#true} call #t~ret0 := fibo2(~n - 1); {1492#true} is VALID [2020-07-11 00:48:24,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {1492#true} assume !(~n < 1); {1562#(< 0 fibo2_~n)} is VALID [2020-07-11 00:48:24,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {1562#(< 0 fibo2_~n)} assume !(1 == ~n); {1563#(< 1 fibo2_~n)} is VALID [2020-07-11 00:48:24,058 INFO L263 TraceCheckUtils]: 13: Hoare triple {1563#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1492#true} is VALID [2020-07-11 00:48:24,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {1492#true} ~n := #in~n; {1574#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:24,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {1574#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,059 INFO L280 TraceCheckUtils]: 16: Hoare triple {1575#(<= |fibo1_#in~n| 0)} #res := 0; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,059 INFO L280 TraceCheckUtils]: 17: Hoare triple {1575#(<= |fibo1_#in~n| 0)} assume true; {1575#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:24,060 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1575#(<= |fibo1_#in~n| 0)} {1563#(< 1 fibo2_~n)} #65#return; {1493#false} is VALID [2020-07-11 00:48:24,061 INFO L280 TraceCheckUtils]: 19: Hoare triple {1493#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,061 INFO L263 TraceCheckUtils]: 20: Hoare triple {1493#false} call #t~ret3 := fibo1(~n - 2); {1492#true} is VALID [2020-07-11 00:48:24,061 INFO L280 TraceCheckUtils]: 21: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,061 INFO L280 TraceCheckUtils]: 22: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,061 INFO L280 TraceCheckUtils]: 23: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,062 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1492#true} {1493#false} #67#return; {1493#false} is VALID [2020-07-11 00:48:24,062 INFO L280 TraceCheckUtils]: 26: Hoare triple {1493#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,062 INFO L280 TraceCheckUtils]: 27: Hoare triple {1493#false} #res := #t~ret2 + #t~ret3; {1493#false} is VALID [2020-07-11 00:48:24,062 INFO L280 TraceCheckUtils]: 28: Hoare triple {1493#false} havoc #t~ret3; {1493#false} is VALID [2020-07-11 00:48:24,062 INFO L280 TraceCheckUtils]: 29: Hoare triple {1493#false} havoc #t~ret2; {1493#false} is VALID [2020-07-11 00:48:24,062 INFO L280 TraceCheckUtils]: 30: Hoare triple {1493#false} assume true; {1493#false} is VALID [2020-07-11 00:48:24,063 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1493#false} {1492#true} #69#return; {1493#false} is VALID [2020-07-11 00:48:24,063 INFO L280 TraceCheckUtils]: 32: Hoare triple {1493#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,063 INFO L263 TraceCheckUtils]: 33: Hoare triple {1493#false} call #t~ret1 := fibo2(~n - 2); {1492#true} is VALID [2020-07-11 00:48:24,063 INFO L280 TraceCheckUtils]: 34: Hoare triple {1492#true} ~n := #in~n; {1492#true} is VALID [2020-07-11 00:48:24,063 INFO L280 TraceCheckUtils]: 35: Hoare triple {1492#true} assume ~n < 1; {1492#true} is VALID [2020-07-11 00:48:24,064 INFO L280 TraceCheckUtils]: 36: Hoare triple {1492#true} #res := 0; {1492#true} is VALID [2020-07-11 00:48:24,064 INFO L280 TraceCheckUtils]: 37: Hoare triple {1492#true} assume true; {1492#true} is VALID [2020-07-11 00:48:24,064 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1492#true} {1493#false} #71#return; {1493#false} is VALID [2020-07-11 00:48:24,064 INFO L280 TraceCheckUtils]: 39: Hoare triple {1493#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,064 INFO L280 TraceCheckUtils]: 40: Hoare triple {1493#false} #res := #t~ret0 + #t~ret1; {1493#false} is VALID [2020-07-11 00:48:24,064 INFO L280 TraceCheckUtils]: 41: Hoare triple {1493#false} havoc #t~ret1; {1493#false} is VALID [2020-07-11 00:48:24,065 INFO L280 TraceCheckUtils]: 42: Hoare triple {1493#false} havoc #t~ret0; {1493#false} is VALID [2020-07-11 00:48:24,065 INFO L280 TraceCheckUtils]: 43: Hoare triple {1493#false} assume true; {1493#false} is VALID [2020-07-11 00:48:24,065 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1493#false} {1492#true} #63#return; {1493#false} is VALID [2020-07-11 00:48:24,065 INFO L280 TraceCheckUtils]: 45: Hoare triple {1493#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1493#false} is VALID [2020-07-11 00:48:24,066 INFO L280 TraceCheckUtils]: 46: Hoare triple {1493#false} ~result~0 := #t~ret4; {1493#false} is VALID [2020-07-11 00:48:24,066 INFO L280 TraceCheckUtils]: 47: Hoare triple {1493#false} havoc #t~ret4; {1493#false} is VALID [2020-07-11 00:48:24,066 INFO L280 TraceCheckUtils]: 48: Hoare triple {1493#false} assume 3 == ~result~0; {1493#false} is VALID [2020-07-11 00:48:24,066 INFO L280 TraceCheckUtils]: 49: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2020-07-11 00:48:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-11 00:48:24,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091334663] [2020-07-11 00:48:24,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:24,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:48:24,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500568297] [2020-07-11 00:48:24,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-07-11 00:48:24,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:24,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:48:24,126 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-11 00:48:24,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:48:24,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:48:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:48:24,128 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-07-11 00:48:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:24,498 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-07-11 00:48:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:48:24,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-07-11 00:48:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:48:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-11 00:48:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:48:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-11 00:48:24,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2020-07-11 00:48:24,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:24,629 INFO L225 Difference]: With dead ends: 130 [2020-07-11 00:48:24,629 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 00:48:24,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:48:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 00:48:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-11 00:48:24,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:24,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-11 00:48:24,772 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:48:24,773 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:48:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:24,779 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-11 00:48:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-07-11 00:48:24,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:24,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:24,780 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:48:24,780 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:48:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:24,786 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-07-11 00:48:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-07-11 00:48:24,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:24,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:24,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:24,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:48:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-07-11 00:48:24,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-07-11 00:48:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:24,793 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-07-11 00:48:24,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:48:24,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 89 transitions. [2020-07-11 00:48:24,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-07-11 00:48:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-11 00:48:24,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:24,916 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:24,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:48:24,916 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-07-11 00:48:24,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:24,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515941453] [2020-07-11 00:48:24,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:24,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:24,956 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2120#true} {2120#true} #59#return; {2120#true} is VALID [2020-07-11 00:48:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:25,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} assume !(~n < 1); {2120#true} is VALID [2020-07-11 00:48:25,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {2120#true} assume 1 == ~n; {2120#true} is VALID [2020-07-11 00:48:25,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {2120#true} #res := 1; {2120#true} is VALID [2020-07-11 00:48:25,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,070 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #65#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:25,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} assume ~n < 1; {2120#true} is VALID [2020-07-11 00:48:25,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {2120#true} #res := 0; {2120#true} is VALID [2020-07-11 00:48:25,082 INFO L280 TraceCheckUtils]: 3: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,083 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #67#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} ~n := #in~n; {2194#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {2194#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2195#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-11 00:48:25,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {2195#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,087 INFO L263 TraceCheckUtils]: 3: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2120#true} is VALID [2020-07-11 00:48:25,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {2120#true} assume !(~n < 1); {2120#true} is VALID [2020-07-11 00:48:25,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {2120#true} assume 1 == ~n; {2120#true} is VALID [2020-07-11 00:48:25,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {2120#true} #res := 1; {2120#true} is VALID [2020-07-11 00:48:25,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,090 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #65#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,091 INFO L280 TraceCheckUtils]: 10: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,091 INFO L263 TraceCheckUtils]: 11: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {2120#true} is VALID [2020-07-11 00:48:25,091 INFO L280 TraceCheckUtils]: 12: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,092 INFO L280 TraceCheckUtils]: 13: Hoare triple {2120#true} assume ~n < 1; {2120#true} is VALID [2020-07-11 00:48:25,092 INFO L280 TraceCheckUtils]: 14: Hoare triple {2120#true} #res := 0; {2120#true} is VALID [2020-07-11 00:48:25,092 INFO L280 TraceCheckUtils]: 15: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,093 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #67#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,094 INFO L280 TraceCheckUtils]: 17: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,095 INFO L280 TraceCheckUtils]: 18: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,095 INFO L280 TraceCheckUtils]: 19: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,096 INFO L280 TraceCheckUtils]: 20: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,097 INFO L280 TraceCheckUtils]: 21: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume true; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,098 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2196#(<= 2 |fibo2_#in~n|)} {2120#true} #69#return; {2188#(<= 3 fibo1_~n)} is VALID [2020-07-11 00:48:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:25,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} ~n := #in~n; {2194#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {2194#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#(<= |fibo2_#in~n| 0)} #res := 0; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,124 INFO L280 TraceCheckUtils]: 3: Hoare triple {2208#(<= |fibo2_#in~n| 0)} assume true; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,125 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2208#(<= |fibo2_#in~n| 0)} {2188#(<= 3 fibo1_~n)} #71#return; {2121#false} is VALID [2020-07-11 00:48:25,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} assume !(~n < 1); {2120#true} is VALID [2020-07-11 00:48:25,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {2120#true} assume !(1 == ~n); {2120#true} is VALID [2020-07-11 00:48:25,127 INFO L263 TraceCheckUtils]: 3: Hoare triple {2120#true} call #t~ret0 := fibo2(~n - 1); {2120#true} is VALID [2020-07-11 00:48:25,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {2120#true} ~n := #in~n; {2194#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {2194#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2195#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-11 00:48:25,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {2195#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,130 INFO L263 TraceCheckUtils]: 7: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2120#true} is VALID [2020-07-11 00:48:25,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {2120#true} assume !(~n < 1); {2120#true} is VALID [2020-07-11 00:48:25,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {2120#true} assume 1 == ~n; {2120#true} is VALID [2020-07-11 00:48:25,131 INFO L280 TraceCheckUtils]: 11: Hoare triple {2120#true} #res := 1; {2120#true} is VALID [2020-07-11 00:48:25,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,133 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #65#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,134 INFO L280 TraceCheckUtils]: 14: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,134 INFO L263 TraceCheckUtils]: 15: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {2120#true} is VALID [2020-07-11 00:48:25,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,135 INFO L280 TraceCheckUtils]: 17: Hoare triple {2120#true} assume ~n < 1; {2120#true} is VALID [2020-07-11 00:48:25,135 INFO L280 TraceCheckUtils]: 18: Hoare triple {2120#true} #res := 0; {2120#true} is VALID [2020-07-11 00:48:25,135 INFO L280 TraceCheckUtils]: 19: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,136 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #67#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,137 INFO L280 TraceCheckUtils]: 21: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,137 INFO L280 TraceCheckUtils]: 22: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,139 INFO L280 TraceCheckUtils]: 24: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume true; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,141 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2196#(<= 2 |fibo2_#in~n|)} {2120#true} #69#return; {2188#(<= 3 fibo1_~n)} is VALID [2020-07-11 00:48:25,141 INFO L280 TraceCheckUtils]: 27: Hoare triple {2188#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2188#(<= 3 fibo1_~n)} is VALID [2020-07-11 00:48:25,142 INFO L263 TraceCheckUtils]: 28: Hoare triple {2188#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {2120#true} is VALID [2020-07-11 00:48:25,142 INFO L280 TraceCheckUtils]: 29: Hoare triple {2120#true} ~n := #in~n; {2194#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {2194#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,144 INFO L280 TraceCheckUtils]: 31: Hoare triple {2208#(<= |fibo2_#in~n| 0)} #res := 0; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {2208#(<= |fibo2_#in~n| 0)} assume true; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,146 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2208#(<= |fibo2_#in~n| 0)} {2188#(<= 3 fibo1_~n)} #71#return; {2121#false} is VALID [2020-07-11 00:48:25,146 INFO L280 TraceCheckUtils]: 34: Hoare triple {2121#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2121#false} is VALID [2020-07-11 00:48:25,146 INFO L280 TraceCheckUtils]: 35: Hoare triple {2121#false} #res := #t~ret0 + #t~ret1; {2121#false} is VALID [2020-07-11 00:48:25,147 INFO L280 TraceCheckUtils]: 36: Hoare triple {2121#false} havoc #t~ret1; {2121#false} is VALID [2020-07-11 00:48:25,147 INFO L280 TraceCheckUtils]: 37: Hoare triple {2121#false} havoc #t~ret0; {2121#false} is VALID [2020-07-11 00:48:25,147 INFO L280 TraceCheckUtils]: 38: Hoare triple {2121#false} assume true; {2121#false} is VALID [2020-07-11 00:48:25,147 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2121#false} {2124#(<= 4 main_~x~0)} #63#return; {2121#false} is VALID [2020-07-11 00:48:25,149 INFO L263 TraceCheckUtils]: 0: Hoare triple {2120#true} call ULTIMATE.init(); {2120#true} is VALID [2020-07-11 00:48:25,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,150 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2120#true} {2120#true} #59#return; {2120#true} is VALID [2020-07-11 00:48:25,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {2120#true} call #t~ret5 := main(); {2120#true} is VALID [2020-07-11 00:48:25,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {2120#true} ~x~0 := 4; {2124#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:25,152 INFO L263 TraceCheckUtils]: 5: Hoare triple {2124#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {2120#true} is VALID [2020-07-11 00:48:25,152 INFO L280 TraceCheckUtils]: 6: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,152 INFO L280 TraceCheckUtils]: 7: Hoare triple {2120#true} assume !(~n < 1); {2120#true} is VALID [2020-07-11 00:48:25,153 INFO L280 TraceCheckUtils]: 8: Hoare triple {2120#true} assume !(1 == ~n); {2120#true} is VALID [2020-07-11 00:48:25,153 INFO L263 TraceCheckUtils]: 9: Hoare triple {2120#true} call #t~ret0 := fibo2(~n - 1); {2120#true} is VALID [2020-07-11 00:48:25,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {2120#true} ~n := #in~n; {2194#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {2194#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2195#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-11 00:48:25,155 INFO L280 TraceCheckUtils]: 12: Hoare triple {2195#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,155 INFO L263 TraceCheckUtils]: 13: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2120#true} is VALID [2020-07-11 00:48:25,156 INFO L280 TraceCheckUtils]: 14: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {2120#true} assume !(~n < 1); {2120#true} is VALID [2020-07-11 00:48:25,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {2120#true} assume 1 == ~n; {2120#true} is VALID [2020-07-11 00:48:25,156 INFO L280 TraceCheckUtils]: 17: Hoare triple {2120#true} #res := 1; {2120#true} is VALID [2020-07-11 00:48:25,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,158 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #65#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,158 INFO L280 TraceCheckUtils]: 20: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,158 INFO L263 TraceCheckUtils]: 21: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {2120#true} is VALID [2020-07-11 00:48:25,159 INFO L280 TraceCheckUtils]: 22: Hoare triple {2120#true} ~n := #in~n; {2120#true} is VALID [2020-07-11 00:48:25,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {2120#true} assume ~n < 1; {2120#true} is VALID [2020-07-11 00:48:25,159 INFO L280 TraceCheckUtils]: 24: Hoare triple {2120#true} #res := 0; {2120#true} is VALID [2020-07-11 00:48:25,159 INFO L280 TraceCheckUtils]: 25: Hoare triple {2120#true} assume true; {2120#true} is VALID [2020-07-11 00:48:25,160 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2120#true} {2196#(<= 2 |fibo2_#in~n|)} #67#return; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,161 INFO L280 TraceCheckUtils]: 27: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,161 INFO L280 TraceCheckUtils]: 28: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,162 INFO L280 TraceCheckUtils]: 29: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,163 INFO L280 TraceCheckUtils]: 30: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,163 INFO L280 TraceCheckUtils]: 31: Hoare triple {2196#(<= 2 |fibo2_#in~n|)} assume true; {2196#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,165 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2196#(<= 2 |fibo2_#in~n|)} {2120#true} #69#return; {2188#(<= 3 fibo1_~n)} is VALID [2020-07-11 00:48:25,165 INFO L280 TraceCheckUtils]: 33: Hoare triple {2188#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2188#(<= 3 fibo1_~n)} is VALID [2020-07-11 00:48:25,165 INFO L263 TraceCheckUtils]: 34: Hoare triple {2188#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {2120#true} is VALID [2020-07-11 00:48:25,166 INFO L280 TraceCheckUtils]: 35: Hoare triple {2120#true} ~n := #in~n; {2194#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:25,167 INFO L280 TraceCheckUtils]: 36: Hoare triple {2194#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,168 INFO L280 TraceCheckUtils]: 37: Hoare triple {2208#(<= |fibo2_#in~n| 0)} #res := 0; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,168 INFO L280 TraceCheckUtils]: 38: Hoare triple {2208#(<= |fibo2_#in~n| 0)} assume true; {2208#(<= |fibo2_#in~n| 0)} is VALID [2020-07-11 00:48:25,169 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2208#(<= |fibo2_#in~n| 0)} {2188#(<= 3 fibo1_~n)} #71#return; {2121#false} is VALID [2020-07-11 00:48:25,170 INFO L280 TraceCheckUtils]: 40: Hoare triple {2121#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2121#false} is VALID [2020-07-11 00:48:25,170 INFO L280 TraceCheckUtils]: 41: Hoare triple {2121#false} #res := #t~ret0 + #t~ret1; {2121#false} is VALID [2020-07-11 00:48:25,170 INFO L280 TraceCheckUtils]: 42: Hoare triple {2121#false} havoc #t~ret1; {2121#false} is VALID [2020-07-11 00:48:25,170 INFO L280 TraceCheckUtils]: 43: Hoare triple {2121#false} havoc #t~ret0; {2121#false} is VALID [2020-07-11 00:48:25,171 INFO L280 TraceCheckUtils]: 44: Hoare triple {2121#false} assume true; {2121#false} is VALID [2020-07-11 00:48:25,171 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2121#false} {2124#(<= 4 main_~x~0)} #63#return; {2121#false} is VALID [2020-07-11 00:48:25,171 INFO L280 TraceCheckUtils]: 46: Hoare triple {2121#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2121#false} is VALID [2020-07-11 00:48:25,171 INFO L280 TraceCheckUtils]: 47: Hoare triple {2121#false} ~result~0 := #t~ret4; {2121#false} is VALID [2020-07-11 00:48:25,172 INFO L280 TraceCheckUtils]: 48: Hoare triple {2121#false} havoc #t~ret4; {2121#false} is VALID [2020-07-11 00:48:25,172 INFO L280 TraceCheckUtils]: 49: Hoare triple {2121#false} assume 3 == ~result~0; {2121#false} is VALID [2020-07-11 00:48:25,172 INFO L280 TraceCheckUtils]: 50: Hoare triple {2121#false} assume !false; {2121#false} is VALID [2020-07-11 00:48:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-11 00:48:25,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515941453] [2020-07-11 00:48:25,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:25,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:48:25,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969396972] [2020-07-11 00:48:25,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-11 00:48:25,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:25,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:48:25,227 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-11 00:48:25,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:48:25,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:48:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:48:25,229 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-07-11 00:48:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:25,817 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-07-11 00:48:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:48:25,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-11 00:48:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:48:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2020-07-11 00:48:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:48:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2020-07-11 00:48:25,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 108 transitions. [2020-07-11 00:48:25,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:25,942 INFO L225 Difference]: With dead ends: 142 [2020-07-11 00:48:25,943 INFO L226 Difference]: Without dead ends: 78 [2020-07-11 00:48:25,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:48:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-11 00:48:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-07-11 00:48:26,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:26,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 72 states. [2020-07-11 00:48:26,081 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 72 states. [2020-07-11 00:48:26,081 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 72 states. [2020-07-11 00:48:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:26,086 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2020-07-11 00:48:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2020-07-11 00:48:26,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:26,088 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 78 states. [2020-07-11 00:48:26,088 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 78 states. [2020-07-11 00:48:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:26,094 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2020-07-11 00:48:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2020-07-11 00:48:26,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:26,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:26,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:26,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-11 00:48:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-07-11 00:48:26,100 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-07-11 00:48:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:26,100 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-07-11 00:48:26,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:48:26,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 92 transitions. [2020-07-11 00:48:26,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-07-11 00:48:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 00:48:26,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:26,210 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:26,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:48:26,210 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-07-11 00:48:26,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:26,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472168837] [2020-07-11 00:48:26,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,242 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2799#true} {2799#true} #59#return; {2799#true} is VALID [2020-07-11 00:48:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {2799#true} ~n := #in~n; {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,345 INFO L280 TraceCheckUtils]: 3: Hoare triple {2889#(<= |fibo1_#in~n| 1)} #res := 1; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {2889#(<= |fibo1_#in~n| 1)} assume true; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,347 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2889#(<= |fibo1_#in~n| 1)} {2876#(= fibo2_~n |fibo2_#in~n|)} #65#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {2799#true} assume ~n < 1; {2799#true} is VALID [2020-07-11 00:48:26,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {2799#true} #res := 0; {2799#true} is VALID [2020-07-11 00:48:26,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,354 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2799#true} {2883#(<= |fibo2_#in~n| 2)} #67#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {2799#true} ~n := #in~n; {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,356 INFO L263 TraceCheckUtils]: 3: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2799#true} is VALID [2020-07-11 00:48:26,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {2799#true} ~n := #in~n; {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {2889#(<= |fibo1_#in~n| 1)} #res := 1; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {2889#(<= |fibo1_#in~n| 1)} assume true; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,361 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2889#(<= |fibo1_#in~n| 1)} {2876#(= fibo2_~n |fibo2_#in~n|)} #65#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,361 INFO L263 TraceCheckUtils]: 11: Hoare triple {2883#(<= |fibo2_#in~n| 2)} call #t~ret3 := fibo1(~n - 2); {2799#true} is VALID [2020-07-11 00:48:26,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {2799#true} assume ~n < 1; {2799#true} is VALID [2020-07-11 00:48:26,362 INFO L280 TraceCheckUtils]: 14: Hoare triple {2799#true} #res := 0; {2799#true} is VALID [2020-07-11 00:48:26,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,364 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2799#true} {2883#(<= |fibo2_#in~n| 2)} #67#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,364 INFO L280 TraceCheckUtils]: 17: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,365 INFO L280 TraceCheckUtils]: 18: Hoare triple {2883#(<= |fibo2_#in~n| 2)} #res := #t~ret2 + #t~ret3; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {2883#(<= |fibo2_#in~n| 2)} havoc #t~ret3; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,366 INFO L280 TraceCheckUtils]: 20: Hoare triple {2883#(<= |fibo2_#in~n| 2)} havoc #t~ret2; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,366 INFO L280 TraceCheckUtils]: 21: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume true; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,368 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2883#(<= |fibo2_#in~n| 2)} {2845#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:26,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {2799#true} assume !(~n < 1); {2799#true} is VALID [2020-07-11 00:48:26,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {2799#true} assume 1 == ~n; {2799#true} is VALID [2020-07-11 00:48:26,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {2799#true} #res := 1; {2799#true} is VALID [2020-07-11 00:48:26,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,376 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2799#true} {2869#(<= |fibo1_#in~n| 3)} #71#return; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {2799#true} ~n := #in~n; {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,378 INFO L263 TraceCheckUtils]: 3: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2799#true} is VALID [2020-07-11 00:48:26,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {2799#true} ~n := #in~n; {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,379 INFO L280 TraceCheckUtils]: 5: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,380 INFO L263 TraceCheckUtils]: 7: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2799#true} is VALID [2020-07-11 00:48:26,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {2799#true} ~n := #in~n; {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {2889#(<= |fibo1_#in~n| 1)} #res := 1; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,383 INFO L280 TraceCheckUtils]: 12: Hoare triple {2889#(<= |fibo1_#in~n| 1)} assume true; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,384 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2889#(<= |fibo1_#in~n| 1)} {2876#(= fibo2_~n |fibo2_#in~n|)} #65#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,385 INFO L263 TraceCheckUtils]: 15: Hoare triple {2883#(<= |fibo2_#in~n| 2)} call #t~ret3 := fibo1(~n - 2); {2799#true} is VALID [2020-07-11 00:48:26,385 INFO L280 TraceCheckUtils]: 16: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,385 INFO L280 TraceCheckUtils]: 17: Hoare triple {2799#true} assume ~n < 1; {2799#true} is VALID [2020-07-11 00:48:26,386 INFO L280 TraceCheckUtils]: 18: Hoare triple {2799#true} #res := 0; {2799#true} is VALID [2020-07-11 00:48:26,386 INFO L280 TraceCheckUtils]: 19: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,387 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2799#true} {2883#(<= |fibo2_#in~n| 2)} #67#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,387 INFO L280 TraceCheckUtils]: 21: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,388 INFO L280 TraceCheckUtils]: 22: Hoare triple {2883#(<= |fibo2_#in~n| 2)} #res := #t~ret2 + #t~ret3; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,388 INFO L280 TraceCheckUtils]: 23: Hoare triple {2883#(<= |fibo2_#in~n| 2)} havoc #t~ret3; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,389 INFO L280 TraceCheckUtils]: 24: Hoare triple {2883#(<= |fibo2_#in~n| 2)} havoc #t~ret2; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,389 INFO L280 TraceCheckUtils]: 25: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume true; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,391 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2883#(<= |fibo2_#in~n| 2)} {2845#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,391 INFO L280 TraceCheckUtils]: 27: Hoare triple {2869#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,391 INFO L263 TraceCheckUtils]: 28: Hoare triple {2869#(<= |fibo1_#in~n| 3)} call #t~ret1 := fibo2(~n - 2); {2799#true} is VALID [2020-07-11 00:48:26,392 INFO L280 TraceCheckUtils]: 29: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,392 INFO L280 TraceCheckUtils]: 30: Hoare triple {2799#true} assume !(~n < 1); {2799#true} is VALID [2020-07-11 00:48:26,392 INFO L280 TraceCheckUtils]: 31: Hoare triple {2799#true} assume 1 == ~n; {2799#true} is VALID [2020-07-11 00:48:26,392 INFO L280 TraceCheckUtils]: 32: Hoare triple {2799#true} #res := 1; {2799#true} is VALID [2020-07-11 00:48:26,393 INFO L280 TraceCheckUtils]: 33: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,393 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2799#true} {2869#(<= |fibo1_#in~n| 3)} #71#return; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,394 INFO L280 TraceCheckUtils]: 35: Hoare triple {2869#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,395 INFO L280 TraceCheckUtils]: 36: Hoare triple {2869#(<= |fibo1_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,395 INFO L280 TraceCheckUtils]: 37: Hoare triple {2869#(<= |fibo1_#in~n| 3)} havoc #t~ret1; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,396 INFO L280 TraceCheckUtils]: 38: Hoare triple {2869#(<= |fibo1_#in~n| 3)} havoc #t~ret0; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,396 INFO L280 TraceCheckUtils]: 39: Hoare triple {2869#(<= |fibo1_#in~n| 3)} assume true; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,397 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2869#(<= |fibo1_#in~n| 3)} {2803#(<= 4 main_~x~0)} #63#return; {2800#false} is VALID [2020-07-11 00:48:26,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {2799#true} call ULTIMATE.init(); {2799#true} is VALID [2020-07-11 00:48:26,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,400 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2799#true} {2799#true} #59#return; {2799#true} is VALID [2020-07-11 00:48:26,400 INFO L263 TraceCheckUtils]: 3: Hoare triple {2799#true} call #t~ret5 := main(); {2799#true} is VALID [2020-07-11 00:48:26,400 INFO L280 TraceCheckUtils]: 4: Hoare triple {2799#true} ~x~0 := 4; {2803#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:26,401 INFO L263 TraceCheckUtils]: 5: Hoare triple {2803#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {2799#true} is VALID [2020-07-11 00:48:26,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {2799#true} ~n := #in~n; {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,402 INFO L263 TraceCheckUtils]: 9: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2799#true} is VALID [2020-07-11 00:48:26,403 INFO L280 TraceCheckUtils]: 10: Hoare triple {2799#true} ~n := #in~n; {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {2876#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:26,404 INFO L263 TraceCheckUtils]: 13: Hoare triple {2876#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2799#true} is VALID [2020-07-11 00:48:26,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {2799#true} ~n := #in~n; {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2845#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:26,406 INFO L280 TraceCheckUtils]: 16: Hoare triple {2845#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,407 INFO L280 TraceCheckUtils]: 17: Hoare triple {2889#(<= |fibo1_#in~n| 1)} #res := 1; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,408 INFO L280 TraceCheckUtils]: 18: Hoare triple {2889#(<= |fibo1_#in~n| 1)} assume true; {2889#(<= |fibo1_#in~n| 1)} is VALID [2020-07-11 00:48:26,410 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2889#(<= |fibo1_#in~n| 1)} {2876#(= fibo2_~n |fibo2_#in~n|)} #65#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,410 INFO L280 TraceCheckUtils]: 20: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,411 INFO L263 TraceCheckUtils]: 21: Hoare triple {2883#(<= |fibo2_#in~n| 2)} call #t~ret3 := fibo1(~n - 2); {2799#true} is VALID [2020-07-11 00:48:26,411 INFO L280 TraceCheckUtils]: 22: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,411 INFO L280 TraceCheckUtils]: 23: Hoare triple {2799#true} assume ~n < 1; {2799#true} is VALID [2020-07-11 00:48:26,411 INFO L280 TraceCheckUtils]: 24: Hoare triple {2799#true} #res := 0; {2799#true} is VALID [2020-07-11 00:48:26,412 INFO L280 TraceCheckUtils]: 25: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,413 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2799#true} {2883#(<= |fibo2_#in~n| 2)} #67#return; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,414 INFO L280 TraceCheckUtils]: 27: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,414 INFO L280 TraceCheckUtils]: 28: Hoare triple {2883#(<= |fibo2_#in~n| 2)} #res := #t~ret2 + #t~ret3; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,415 INFO L280 TraceCheckUtils]: 29: Hoare triple {2883#(<= |fibo2_#in~n| 2)} havoc #t~ret3; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,416 INFO L280 TraceCheckUtils]: 30: Hoare triple {2883#(<= |fibo2_#in~n| 2)} havoc #t~ret2; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,417 INFO L280 TraceCheckUtils]: 31: Hoare triple {2883#(<= |fibo2_#in~n| 2)} assume true; {2883#(<= |fibo2_#in~n| 2)} is VALID [2020-07-11 00:48:26,418 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2883#(<= |fibo2_#in~n| 2)} {2845#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,419 INFO L280 TraceCheckUtils]: 33: Hoare triple {2869#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,419 INFO L263 TraceCheckUtils]: 34: Hoare triple {2869#(<= |fibo1_#in~n| 3)} call #t~ret1 := fibo2(~n - 2); {2799#true} is VALID [2020-07-11 00:48:26,419 INFO L280 TraceCheckUtils]: 35: Hoare triple {2799#true} ~n := #in~n; {2799#true} is VALID [2020-07-11 00:48:26,420 INFO L280 TraceCheckUtils]: 36: Hoare triple {2799#true} assume !(~n < 1); {2799#true} is VALID [2020-07-11 00:48:26,420 INFO L280 TraceCheckUtils]: 37: Hoare triple {2799#true} assume 1 == ~n; {2799#true} is VALID [2020-07-11 00:48:26,420 INFO L280 TraceCheckUtils]: 38: Hoare triple {2799#true} #res := 1; {2799#true} is VALID [2020-07-11 00:48:26,420 INFO L280 TraceCheckUtils]: 39: Hoare triple {2799#true} assume true; {2799#true} is VALID [2020-07-11 00:48:26,422 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2799#true} {2869#(<= |fibo1_#in~n| 3)} #71#return; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,422 INFO L280 TraceCheckUtils]: 41: Hoare triple {2869#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,423 INFO L280 TraceCheckUtils]: 42: Hoare triple {2869#(<= |fibo1_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,424 INFO L280 TraceCheckUtils]: 43: Hoare triple {2869#(<= |fibo1_#in~n| 3)} havoc #t~ret1; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,425 INFO L280 TraceCheckUtils]: 44: Hoare triple {2869#(<= |fibo1_#in~n| 3)} havoc #t~ret0; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,425 INFO L280 TraceCheckUtils]: 45: Hoare triple {2869#(<= |fibo1_#in~n| 3)} assume true; {2869#(<= |fibo1_#in~n| 3)} is VALID [2020-07-11 00:48:26,426 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2869#(<= |fibo1_#in~n| 3)} {2803#(<= 4 main_~x~0)} #63#return; {2800#false} is VALID [2020-07-11 00:48:26,427 INFO L280 TraceCheckUtils]: 47: Hoare triple {2800#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2800#false} is VALID [2020-07-11 00:48:26,427 INFO L280 TraceCheckUtils]: 48: Hoare triple {2800#false} ~result~0 := #t~ret4; {2800#false} is VALID [2020-07-11 00:48:26,427 INFO L280 TraceCheckUtils]: 49: Hoare triple {2800#false} havoc #t~ret4; {2800#false} is VALID [2020-07-11 00:48:26,427 INFO L280 TraceCheckUtils]: 50: Hoare triple {2800#false} assume 3 == ~result~0; {2800#false} is VALID [2020-07-11 00:48:26,427 INFO L280 TraceCheckUtils]: 51: Hoare triple {2800#false} assume !false; {2800#false} is VALID [2020-07-11 00:48:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-11 00:48:26,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [472168837] [2020-07-11 00:48:26,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:26,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:48:26,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154236345] [2020-07-11 00:48:26,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-11 00:48:26,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:26,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:48:26,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:26,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:48:26,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:48:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:48:26,495 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-07-11 00:48:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:27,300 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-07-11 00:48:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:48:27,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-11 00:48:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:48:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-11 00:48:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:48:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-11 00:48:27,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2020-07-11 00:48:27,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:27,421 INFO L225 Difference]: With dead ends: 118 [2020-07-11 00:48:27,422 INFO L226 Difference]: Without dead ends: 112 [2020-07-11 00:48:27,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:48:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-11 00:48:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-07-11 00:48:27,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:27,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 106 states. [2020-07-11 00:48:27,640 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 106 states. [2020-07-11 00:48:27,640 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 106 states. [2020-07-11 00:48:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:27,647 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2020-07-11 00:48:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2020-07-11 00:48:27,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:27,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:27,649 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 112 states. [2020-07-11 00:48:27,649 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 112 states. [2020-07-11 00:48:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:27,656 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2020-07-11 00:48:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2020-07-11 00:48:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:27,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:27,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:27,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-11 00:48:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-07-11 00:48:27,664 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-07-11 00:48:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:27,665 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-07-11 00:48:27,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:48:27,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 106 states and 145 transitions. [2020-07-11 00:48:27,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-07-11 00:48:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-11 00:48:27,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:27,873 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:27,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:48:27,873 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:27,874 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-07-11 00:48:27,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:27,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510207969] [2020-07-11 00:48:27,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:27,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:27,915 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3573#true} {3573#true} #59#return; {3573#true} is VALID [2020-07-11 00:48:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:28,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,105 INFO L280 TraceCheckUtils]: 3: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,106 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #69#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:28,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {3573#true} assume ~n < 1; {3573#true} is VALID [2020-07-11 00:48:28,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {3573#true} #res := 0; {3573#true} is VALID [2020-07-11 00:48:28,113 INFO L280 TraceCheckUtils]: 3: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,114 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #71#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,115 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,115 INFO L280 TraceCheckUtils]: 1: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:28,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,117 INFO L263 TraceCheckUtils]: 3: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,117 INFO L280 TraceCheckUtils]: 4: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,117 INFO L280 TraceCheckUtils]: 5: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,117 INFO L280 TraceCheckUtils]: 6: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,118 INFO L280 TraceCheckUtils]: 7: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,119 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #69#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,120 INFO L280 TraceCheckUtils]: 10: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,120 INFO L263 TraceCheckUtils]: 11: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,120 INFO L280 TraceCheckUtils]: 12: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,120 INFO L280 TraceCheckUtils]: 13: Hoare triple {3573#true} assume ~n < 1; {3573#true} is VALID [2020-07-11 00:48:28,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {3573#true} #res := 0; {3573#true} is VALID [2020-07-11 00:48:28,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,122 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #71#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,122 INFO L280 TraceCheckUtils]: 17: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,123 INFO L280 TraceCheckUtils]: 18: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,124 INFO L280 TraceCheckUtils]: 19: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,124 INFO L280 TraceCheckUtils]: 20: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,125 INFO L280 TraceCheckUtils]: 21: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume true; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,126 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3713#(<= 2 |fibo1_#in~n|)} {3573#true} #65#return; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:28,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,148 INFO L280 TraceCheckUtils]: 2: Hoare triple {3725#(<= |fibo1_#in~n| 0)} #res := 0; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {3725#(<= |fibo1_#in~n| 0)} assume true; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,149 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3725#(<= |fibo1_#in~n| 0)} {3705#(<= 3 fibo2_~n)} #67#return; {3574#false} is VALID [2020-07-11 00:48:28,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {3573#true} assume !(1 == ~n); {3573#true} is VALID [2020-07-11 00:48:28,151 INFO L263 TraceCheckUtils]: 3: Hoare triple {3573#true} call #t~ret2 := fibo1(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,151 INFO L280 TraceCheckUtils]: 4: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:28,153 INFO L280 TraceCheckUtils]: 6: Hoare triple {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,153 INFO L263 TraceCheckUtils]: 7: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,153 INFO L280 TraceCheckUtils]: 8: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,154 INFO L280 TraceCheckUtils]: 9: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,155 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #69#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,156 INFO L280 TraceCheckUtils]: 14: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,156 INFO L263 TraceCheckUtils]: 15: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,157 INFO L280 TraceCheckUtils]: 16: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,157 INFO L280 TraceCheckUtils]: 17: Hoare triple {3573#true} assume ~n < 1; {3573#true} is VALID [2020-07-11 00:48:28,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {3573#true} #res := 0; {3573#true} is VALID [2020-07-11 00:48:28,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,158 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #71#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,159 INFO L280 TraceCheckUtils]: 21: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,160 INFO L280 TraceCheckUtils]: 22: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,160 INFO L280 TraceCheckUtils]: 23: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,161 INFO L280 TraceCheckUtils]: 24: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,161 INFO L280 TraceCheckUtils]: 25: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume true; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,162 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3713#(<= 2 |fibo1_#in~n|)} {3573#true} #65#return; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,163 INFO L280 TraceCheckUtils]: 27: Hoare triple {3705#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,163 INFO L263 TraceCheckUtils]: 28: Hoare triple {3705#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,164 INFO L280 TraceCheckUtils]: 29: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,164 INFO L280 TraceCheckUtils]: 30: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,165 INFO L280 TraceCheckUtils]: 31: Hoare triple {3725#(<= |fibo1_#in~n| 0)} #res := 0; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,165 INFO L280 TraceCheckUtils]: 32: Hoare triple {3725#(<= |fibo1_#in~n| 0)} assume true; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,167 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3725#(<= |fibo1_#in~n| 0)} {3705#(<= 3 fibo2_~n)} #67#return; {3574#false} is VALID [2020-07-11 00:48:28,167 INFO L280 TraceCheckUtils]: 34: Hoare triple {3574#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,167 INFO L280 TraceCheckUtils]: 35: Hoare triple {3574#false} #res := #t~ret2 + #t~ret3; {3574#false} is VALID [2020-07-11 00:48:28,167 INFO L280 TraceCheckUtils]: 36: Hoare triple {3574#false} havoc #t~ret3; {3574#false} is VALID [2020-07-11 00:48:28,167 INFO L280 TraceCheckUtils]: 37: Hoare triple {3574#false} havoc #t~ret2; {3574#false} is VALID [2020-07-11 00:48:28,168 INFO L280 TraceCheckUtils]: 38: Hoare triple {3574#false} assume true; {3574#false} is VALID [2020-07-11 00:48:28,168 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {3574#false} {3573#true} #69#return; {3574#false} is VALID [2020-07-11 00:48:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:28,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,175 INFO L280 TraceCheckUtils]: 4: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,176 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3573#true} {3574#false} #71#return; {3574#false} is VALID [2020-07-11 00:48:28,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {3573#true} assume !(1 == ~n); {3573#true} is VALID [2020-07-11 00:48:28,177 INFO L263 TraceCheckUtils]: 3: Hoare triple {3573#true} call #t~ret0 := fibo2(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,177 INFO L280 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !(1 == ~n); {3573#true} is VALID [2020-07-11 00:48:28,177 INFO L263 TraceCheckUtils]: 7: Hoare triple {3573#true} call #t~ret2 := fibo1(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:28,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,180 INFO L263 TraceCheckUtils]: 11: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,181 INFO L280 TraceCheckUtils]: 12: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,181 INFO L280 TraceCheckUtils]: 13: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,181 INFO L280 TraceCheckUtils]: 14: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,182 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #69#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,183 INFO L280 TraceCheckUtils]: 18: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,183 INFO L263 TraceCheckUtils]: 19: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,183 INFO L280 TraceCheckUtils]: 20: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,184 INFO L280 TraceCheckUtils]: 21: Hoare triple {3573#true} assume ~n < 1; {3573#true} is VALID [2020-07-11 00:48:28,184 INFO L280 TraceCheckUtils]: 22: Hoare triple {3573#true} #res := 0; {3573#true} is VALID [2020-07-11 00:48:28,184 INFO L280 TraceCheckUtils]: 23: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,185 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #71#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,186 INFO L280 TraceCheckUtils]: 25: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,186 INFO L280 TraceCheckUtils]: 26: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,187 INFO L280 TraceCheckUtils]: 27: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,187 INFO L280 TraceCheckUtils]: 28: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,188 INFO L280 TraceCheckUtils]: 29: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume true; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,189 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3713#(<= 2 |fibo1_#in~n|)} {3573#true} #65#return; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,190 INFO L280 TraceCheckUtils]: 31: Hoare triple {3705#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,190 INFO L263 TraceCheckUtils]: 32: Hoare triple {3705#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,191 INFO L280 TraceCheckUtils]: 33: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,191 INFO L280 TraceCheckUtils]: 34: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,192 INFO L280 TraceCheckUtils]: 35: Hoare triple {3725#(<= |fibo1_#in~n| 0)} #res := 0; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,193 INFO L280 TraceCheckUtils]: 36: Hoare triple {3725#(<= |fibo1_#in~n| 0)} assume true; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,194 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {3725#(<= |fibo1_#in~n| 0)} {3705#(<= 3 fibo2_~n)} #67#return; {3574#false} is VALID [2020-07-11 00:48:28,194 INFO L280 TraceCheckUtils]: 38: Hoare triple {3574#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,194 INFO L280 TraceCheckUtils]: 39: Hoare triple {3574#false} #res := #t~ret2 + #t~ret3; {3574#false} is VALID [2020-07-11 00:48:28,194 INFO L280 TraceCheckUtils]: 40: Hoare triple {3574#false} havoc #t~ret3; {3574#false} is VALID [2020-07-11 00:48:28,194 INFO L280 TraceCheckUtils]: 41: Hoare triple {3574#false} havoc #t~ret2; {3574#false} is VALID [2020-07-11 00:48:28,195 INFO L280 TraceCheckUtils]: 42: Hoare triple {3574#false} assume true; {3574#false} is VALID [2020-07-11 00:48:28,195 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3574#false} {3573#true} #69#return; {3574#false} is VALID [2020-07-11 00:48:28,195 INFO L280 TraceCheckUtils]: 44: Hoare triple {3574#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,195 INFO L263 TraceCheckUtils]: 45: Hoare triple {3574#false} call #t~ret1 := fibo2(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,195 INFO L280 TraceCheckUtils]: 46: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,196 INFO L280 TraceCheckUtils]: 47: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,196 INFO L280 TraceCheckUtils]: 48: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,196 INFO L280 TraceCheckUtils]: 49: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,196 INFO L280 TraceCheckUtils]: 50: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,197 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {3573#true} {3574#false} #71#return; {3574#false} is VALID [2020-07-11 00:48:28,197 INFO L280 TraceCheckUtils]: 52: Hoare triple {3574#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,197 INFO L280 TraceCheckUtils]: 53: Hoare triple {3574#false} #res := #t~ret0 + #t~ret1; {3574#false} is VALID [2020-07-11 00:48:28,197 INFO L280 TraceCheckUtils]: 54: Hoare triple {3574#false} havoc #t~ret1; {3574#false} is VALID [2020-07-11 00:48:28,198 INFO L280 TraceCheckUtils]: 55: Hoare triple {3574#false} havoc #t~ret0; {3574#false} is VALID [2020-07-11 00:48:28,198 INFO L280 TraceCheckUtils]: 56: Hoare triple {3574#false} assume true; {3574#false} is VALID [2020-07-11 00:48:28,198 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {3574#false} {3577#(<= 4 main_~x~0)} #63#return; {3574#false} is VALID [2020-07-11 00:48:28,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2020-07-11 00:48:28,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,201 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3573#true} {3573#true} #59#return; {3573#true} is VALID [2020-07-11 00:48:28,202 INFO L263 TraceCheckUtils]: 3: Hoare triple {3573#true} call #t~ret5 := main(); {3573#true} is VALID [2020-07-11 00:48:28,202 INFO L280 TraceCheckUtils]: 4: Hoare triple {3573#true} ~x~0 := 4; {3577#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:28,203 INFO L263 TraceCheckUtils]: 5: Hoare triple {3577#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {3573#true} is VALID [2020-07-11 00:48:28,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {3573#true} assume !(1 == ~n); {3573#true} is VALID [2020-07-11 00:48:28,203 INFO L263 TraceCheckUtils]: 9: Hoare triple {3573#true} call #t~ret0 := fibo2(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,204 INFO L280 TraceCheckUtils]: 12: Hoare triple {3573#true} assume !(1 == ~n); {3573#true} is VALID [2020-07-11 00:48:28,204 INFO L263 TraceCheckUtils]: 13: Hoare triple {3573#true} call #t~ret2 := fibo1(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,205 INFO L280 TraceCheckUtils]: 15: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:28,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {3712#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,206 INFO L263 TraceCheckUtils]: 17: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3573#true} is VALID [2020-07-11 00:48:28,207 INFO L280 TraceCheckUtils]: 18: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,207 INFO L280 TraceCheckUtils]: 19: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,207 INFO L280 TraceCheckUtils]: 21: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,207 INFO L280 TraceCheckUtils]: 22: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,208 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #69#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,209 INFO L280 TraceCheckUtils]: 24: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,209 INFO L263 TraceCheckUtils]: 25: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,209 INFO L280 TraceCheckUtils]: 26: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,210 INFO L280 TraceCheckUtils]: 27: Hoare triple {3573#true} assume ~n < 1; {3573#true} is VALID [2020-07-11 00:48:28,210 INFO L280 TraceCheckUtils]: 28: Hoare triple {3573#true} #res := 0; {3573#true} is VALID [2020-07-11 00:48:28,210 INFO L280 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,211 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3713#(<= 2 |fibo1_#in~n|)} #71#return; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,211 INFO L280 TraceCheckUtils]: 31: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,212 INFO L280 TraceCheckUtils]: 32: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,213 INFO L280 TraceCheckUtils]: 33: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,213 INFO L280 TraceCheckUtils]: 34: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,214 INFO L280 TraceCheckUtils]: 35: Hoare triple {3713#(<= 2 |fibo1_#in~n|)} assume true; {3713#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,215 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3713#(<= 2 |fibo1_#in~n|)} {3573#true} #65#return; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,216 INFO L280 TraceCheckUtils]: 37: Hoare triple {3705#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3705#(<= 3 fibo2_~n)} is VALID [2020-07-11 00:48:28,216 INFO L263 TraceCheckUtils]: 38: Hoare triple {3705#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,217 INFO L280 TraceCheckUtils]: 39: Hoare triple {3573#true} ~n := #in~n; {3711#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:28,218 INFO L280 TraceCheckUtils]: 40: Hoare triple {3711#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,218 INFO L280 TraceCheckUtils]: 41: Hoare triple {3725#(<= |fibo1_#in~n| 0)} #res := 0; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,219 INFO L280 TraceCheckUtils]: 42: Hoare triple {3725#(<= |fibo1_#in~n| 0)} assume true; {3725#(<= |fibo1_#in~n| 0)} is VALID [2020-07-11 00:48:28,220 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3725#(<= |fibo1_#in~n| 0)} {3705#(<= 3 fibo2_~n)} #67#return; {3574#false} is VALID [2020-07-11 00:48:28,221 INFO L280 TraceCheckUtils]: 44: Hoare triple {3574#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,221 INFO L280 TraceCheckUtils]: 45: Hoare triple {3574#false} #res := #t~ret2 + #t~ret3; {3574#false} is VALID [2020-07-11 00:48:28,221 INFO L280 TraceCheckUtils]: 46: Hoare triple {3574#false} havoc #t~ret3; {3574#false} is VALID [2020-07-11 00:48:28,221 INFO L280 TraceCheckUtils]: 47: Hoare triple {3574#false} havoc #t~ret2; {3574#false} is VALID [2020-07-11 00:48:28,222 INFO L280 TraceCheckUtils]: 48: Hoare triple {3574#false} assume true; {3574#false} is VALID [2020-07-11 00:48:28,222 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {3574#false} {3573#true} #69#return; {3574#false} is VALID [2020-07-11 00:48:28,222 INFO L280 TraceCheckUtils]: 50: Hoare triple {3574#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,222 INFO L263 TraceCheckUtils]: 51: Hoare triple {3574#false} call #t~ret1 := fibo2(~n - 2); {3573#true} is VALID [2020-07-11 00:48:28,223 INFO L280 TraceCheckUtils]: 52: Hoare triple {3573#true} ~n := #in~n; {3573#true} is VALID [2020-07-11 00:48:28,223 INFO L280 TraceCheckUtils]: 53: Hoare triple {3573#true} assume !(~n < 1); {3573#true} is VALID [2020-07-11 00:48:28,223 INFO L280 TraceCheckUtils]: 54: Hoare triple {3573#true} assume 1 == ~n; {3573#true} is VALID [2020-07-11 00:48:28,223 INFO L280 TraceCheckUtils]: 55: Hoare triple {3573#true} #res := 1; {3573#true} is VALID [2020-07-11 00:48:28,223 INFO L280 TraceCheckUtils]: 56: Hoare triple {3573#true} assume true; {3573#true} is VALID [2020-07-11 00:48:28,224 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {3573#true} {3574#false} #71#return; {3574#false} is VALID [2020-07-11 00:48:28,224 INFO L280 TraceCheckUtils]: 58: Hoare triple {3574#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,224 INFO L280 TraceCheckUtils]: 59: Hoare triple {3574#false} #res := #t~ret0 + #t~ret1; {3574#false} is VALID [2020-07-11 00:48:28,224 INFO L280 TraceCheckUtils]: 60: Hoare triple {3574#false} havoc #t~ret1; {3574#false} is VALID [2020-07-11 00:48:28,225 INFO L280 TraceCheckUtils]: 61: Hoare triple {3574#false} havoc #t~ret0; {3574#false} is VALID [2020-07-11 00:48:28,225 INFO L280 TraceCheckUtils]: 62: Hoare triple {3574#false} assume true; {3574#false} is VALID [2020-07-11 00:48:28,225 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3574#false} {3577#(<= 4 main_~x~0)} #63#return; {3574#false} is VALID [2020-07-11 00:48:28,225 INFO L280 TraceCheckUtils]: 64: Hoare triple {3574#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3574#false} is VALID [2020-07-11 00:48:28,225 INFO L280 TraceCheckUtils]: 65: Hoare triple {3574#false} ~result~0 := #t~ret4; {3574#false} is VALID [2020-07-11 00:48:28,226 INFO L280 TraceCheckUtils]: 66: Hoare triple {3574#false} havoc #t~ret4; {3574#false} is VALID [2020-07-11 00:48:28,226 INFO L280 TraceCheckUtils]: 67: Hoare triple {3574#false} assume 3 == ~result~0; {3574#false} is VALID [2020-07-11 00:48:28,226 INFO L280 TraceCheckUtils]: 68: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2020-07-11 00:48:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-11 00:48:28,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510207969] [2020-07-11 00:48:28,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:28,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:48:28,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746322125] [2020-07-11 00:48:28,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-11 00:48:28,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:28,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:48:28,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:28,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:48:28,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:48:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:48:28,302 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-07-11 00:48:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:29,090 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-07-11 00:48:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:48:29,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-11 00:48:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:48:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2020-07-11 00:48:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:48:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2020-07-11 00:48:29,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 113 transitions. [2020-07-11 00:48:29,260 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-11 00:48:29,265 INFO L225 Difference]: With dead ends: 227 [2020-07-11 00:48:29,265 INFO L226 Difference]: Without dead ends: 127 [2020-07-11 00:48:29,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:48:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-11 00:48:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-07-11 00:48:29,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:29,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 115 states. [2020-07-11 00:48:29,523 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 115 states. [2020-07-11 00:48:29,523 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 115 states. [2020-07-11 00:48:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:29,533 INFO L93 Difference]: Finished difference Result 127 states and 180 transitions. [2020-07-11 00:48:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2020-07-11 00:48:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:29,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:29,535 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 127 states. [2020-07-11 00:48:29,535 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 127 states. [2020-07-11 00:48:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:29,543 INFO L93 Difference]: Finished difference Result 127 states and 180 transitions. [2020-07-11 00:48:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2020-07-11 00:48:29,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:29,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:29,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:29,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-11 00:48:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-07-11 00:48:29,553 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-07-11 00:48:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:29,553 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-07-11 00:48:29,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:48:29,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 115 states and 161 transitions. [2020-07-11 00:48:29,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-07-11 00:48:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-11 00:48:29,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:29,791 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:29,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:48:29,791 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:29,792 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-07-11 00:48:29,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:29,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291687469] [2020-07-11 00:48:29,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:29,834 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4671#true} {4671#true} #59#return; {4671#true} is VALID [2020-07-11 00:48:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:29,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:29,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:29,991 INFO L280 TraceCheckUtils]: 3: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:29,991 INFO L280 TraceCheckUtils]: 4: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:29,992 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #69#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:29,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:29,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {4671#true} assume ~n < 1; {4671#true} is VALID [2020-07-11 00:48:29,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {4671#true} #res := 0; {4671#true} is VALID [2020-07-11 00:48:29,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,000 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #71#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4814#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {4814#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:30,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,003 INFO L263 TraceCheckUtils]: 3: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,004 INFO L280 TraceCheckUtils]: 8: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,005 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #69#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,006 INFO L263 TraceCheckUtils]: 11: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,007 INFO L280 TraceCheckUtils]: 13: Hoare triple {4671#true} assume ~n < 1; {4671#true} is VALID [2020-07-11 00:48:30,007 INFO L280 TraceCheckUtils]: 14: Hoare triple {4671#true} #res := 0; {4671#true} is VALID [2020-07-11 00:48:30,007 INFO L280 TraceCheckUtils]: 15: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,008 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #71#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,009 INFO L280 TraceCheckUtils]: 17: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,009 INFO L280 TraceCheckUtils]: 18: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,010 INFO L280 TraceCheckUtils]: 19: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume true; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,012 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4816#(<= 2 |fibo1_#in~n|)} {4783#(= fibo2_~n |fibo2_#in~n|)} #65#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:30,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,021 INFO L280 TraceCheckUtils]: 3: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,021 INFO L280 TraceCheckUtils]: 4: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,022 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4671#true} {4807#(<= 3 |fibo2_#in~n|)} #67#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,024 INFO L263 TraceCheckUtils]: 3: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {4671#true} ~n := #in~n; {4814#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,026 INFO L280 TraceCheckUtils]: 5: Hoare triple {4814#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:30,026 INFO L280 TraceCheckUtils]: 6: Hoare triple {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,027 INFO L263 TraceCheckUtils]: 7: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,027 INFO L280 TraceCheckUtils]: 9: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,029 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #69#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,029 INFO L280 TraceCheckUtils]: 14: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,030 INFO L263 TraceCheckUtils]: 15: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,030 INFO L280 TraceCheckUtils]: 16: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,030 INFO L280 TraceCheckUtils]: 17: Hoare triple {4671#true} assume ~n < 1; {4671#true} is VALID [2020-07-11 00:48:30,030 INFO L280 TraceCheckUtils]: 18: Hoare triple {4671#true} #res := 0; {4671#true} is VALID [2020-07-11 00:48:30,030 INFO L280 TraceCheckUtils]: 19: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,031 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #71#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,032 INFO L280 TraceCheckUtils]: 22: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,034 INFO L280 TraceCheckUtils]: 24: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,034 INFO L280 TraceCheckUtils]: 25: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume true; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,036 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4816#(<= 2 |fibo1_#in~n|)} {4783#(= fibo2_~n |fibo2_#in~n|)} #65#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,036 INFO L280 TraceCheckUtils]: 27: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,037 INFO L263 TraceCheckUtils]: 28: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,037 INFO L280 TraceCheckUtils]: 29: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,037 INFO L280 TraceCheckUtils]: 30: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,037 INFO L280 TraceCheckUtils]: 31: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,037 INFO L280 TraceCheckUtils]: 32: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,038 INFO L280 TraceCheckUtils]: 33: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,038 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4671#true} {4807#(<= 3 |fibo2_#in~n|)} #67#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,039 INFO L280 TraceCheckUtils]: 35: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,040 INFO L280 TraceCheckUtils]: 36: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,040 INFO L280 TraceCheckUtils]: 37: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} havoc #t~ret3; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,041 INFO L280 TraceCheckUtils]: 38: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} havoc #t~ret2; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,041 INFO L280 TraceCheckUtils]: 39: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume true; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,043 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4807#(<= 3 |fibo2_#in~n|)} {4671#true} #69#return; {4776#(<= 4 fibo1_~n)} is VALID [2020-07-11 00:48:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:30,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {4828#(<= |fibo2_#in~n| 1)} #res := 1; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {4828#(<= |fibo2_#in~n| 1)} assume true; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,070 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4828#(<= |fibo2_#in~n| 1)} {4776#(<= 4 fibo1_~n)} #71#return; {4672#false} is VALID [2020-07-11 00:48:30,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {4671#true} assume !(1 == ~n); {4671#true} is VALID [2020-07-11 00:48:30,071 INFO L263 TraceCheckUtils]: 3: Hoare triple {4671#true} call #t~ret0 := fibo2(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {4671#true} ~n := #in~n; {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,073 INFO L280 TraceCheckUtils]: 6: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,073 INFO L263 TraceCheckUtils]: 7: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {4671#true} ~n := #in~n; {4814#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,075 INFO L280 TraceCheckUtils]: 9: Hoare triple {4814#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:30,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,076 INFO L263 TraceCheckUtils]: 11: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,076 INFO L280 TraceCheckUtils]: 13: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,076 INFO L280 TraceCheckUtils]: 14: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,078 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #69#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,078 INFO L280 TraceCheckUtils]: 18: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,078 INFO L263 TraceCheckUtils]: 19: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {4671#true} assume ~n < 1; {4671#true} is VALID [2020-07-11 00:48:30,079 INFO L280 TraceCheckUtils]: 22: Hoare triple {4671#true} #res := 0; {4671#true} is VALID [2020-07-11 00:48:30,079 INFO L280 TraceCheckUtils]: 23: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,080 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #71#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,081 INFO L280 TraceCheckUtils]: 25: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,081 INFO L280 TraceCheckUtils]: 26: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,082 INFO L280 TraceCheckUtils]: 27: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,082 INFO L280 TraceCheckUtils]: 28: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,083 INFO L280 TraceCheckUtils]: 29: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume true; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,084 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4816#(<= 2 |fibo1_#in~n|)} {4783#(= fibo2_~n |fibo2_#in~n|)} #65#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,084 INFO L280 TraceCheckUtils]: 31: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,085 INFO L263 TraceCheckUtils]: 32: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,085 INFO L280 TraceCheckUtils]: 33: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,085 INFO L280 TraceCheckUtils]: 34: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,085 INFO L280 TraceCheckUtils]: 35: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,086 INFO L280 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,086 INFO L280 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,087 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4807#(<= 3 |fibo2_#in~n|)} #67#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,087 INFO L280 TraceCheckUtils]: 39: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,088 INFO L280 TraceCheckUtils]: 40: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,088 INFO L280 TraceCheckUtils]: 41: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} havoc #t~ret3; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,089 INFO L280 TraceCheckUtils]: 42: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} havoc #t~ret2; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,089 INFO L280 TraceCheckUtils]: 43: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume true; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,090 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4807#(<= 3 |fibo2_#in~n|)} {4671#true} #69#return; {4776#(<= 4 fibo1_~n)} is VALID [2020-07-11 00:48:30,091 INFO L280 TraceCheckUtils]: 45: Hoare triple {4776#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4776#(<= 4 fibo1_~n)} is VALID [2020-07-11 00:48:30,091 INFO L263 TraceCheckUtils]: 46: Hoare triple {4776#(<= 4 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,092 INFO L280 TraceCheckUtils]: 47: Hoare triple {4671#true} ~n := #in~n; {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,092 INFO L280 TraceCheckUtils]: 48: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,093 INFO L280 TraceCheckUtils]: 49: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,093 INFO L280 TraceCheckUtils]: 50: Hoare triple {4828#(<= |fibo2_#in~n| 1)} #res := 1; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,094 INFO L280 TraceCheckUtils]: 51: Hoare triple {4828#(<= |fibo2_#in~n| 1)} assume true; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,095 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4828#(<= |fibo2_#in~n| 1)} {4776#(<= 4 fibo1_~n)} #71#return; {4672#false} is VALID [2020-07-11 00:48:30,095 INFO L280 TraceCheckUtils]: 53: Hoare triple {4672#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4672#false} is VALID [2020-07-11 00:48:30,095 INFO L280 TraceCheckUtils]: 54: Hoare triple {4672#false} #res := #t~ret0 + #t~ret1; {4672#false} is VALID [2020-07-11 00:48:30,095 INFO L280 TraceCheckUtils]: 55: Hoare triple {4672#false} havoc #t~ret1; {4672#false} is VALID [2020-07-11 00:48:30,096 INFO L280 TraceCheckUtils]: 56: Hoare triple {4672#false} havoc #t~ret0; {4672#false} is VALID [2020-07-11 00:48:30,096 INFO L280 TraceCheckUtils]: 57: Hoare triple {4672#false} assume true; {4672#false} is VALID [2020-07-11 00:48:30,096 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {4672#false} {4675#(<= 4 main_~x~0)} #63#return; {4672#false} is VALID [2020-07-11 00:48:30,099 INFO L263 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2020-07-11 00:48:30,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,100 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4671#true} {4671#true} #59#return; {4671#true} is VALID [2020-07-11 00:48:30,100 INFO L263 TraceCheckUtils]: 3: Hoare triple {4671#true} call #t~ret5 := main(); {4671#true} is VALID [2020-07-11 00:48:30,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {4671#true} ~x~0 := 4; {4675#(<= 4 main_~x~0)} is VALID [2020-07-11 00:48:30,101 INFO L263 TraceCheckUtils]: 5: Hoare triple {4675#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {4671#true} is VALID [2020-07-11 00:48:30,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !(1 == ~n); {4671#true} is VALID [2020-07-11 00:48:30,101 INFO L263 TraceCheckUtils]: 9: Hoare triple {4671#true} call #t~ret0 := fibo2(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,102 INFO L280 TraceCheckUtils]: 10: Hoare triple {4671#true} ~n := #in~n; {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,103 INFO L263 TraceCheckUtils]: 13: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,104 INFO L280 TraceCheckUtils]: 14: Hoare triple {4671#true} ~n := #in~n; {4814#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,104 INFO L280 TraceCheckUtils]: 15: Hoare triple {4814#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:30,105 INFO L280 TraceCheckUtils]: 16: Hoare triple {4815#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,105 INFO L263 TraceCheckUtils]: 17: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4671#true} is VALID [2020-07-11 00:48:30,105 INFO L280 TraceCheckUtils]: 18: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,106 INFO L280 TraceCheckUtils]: 19: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,106 INFO L280 TraceCheckUtils]: 20: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,106 INFO L280 TraceCheckUtils]: 21: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,106 INFO L280 TraceCheckUtils]: 22: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,108 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #69#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,108 INFO L280 TraceCheckUtils]: 24: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,109 INFO L263 TraceCheckUtils]: 25: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,109 INFO L280 TraceCheckUtils]: 26: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,109 INFO L280 TraceCheckUtils]: 27: Hoare triple {4671#true} assume ~n < 1; {4671#true} is VALID [2020-07-11 00:48:30,109 INFO L280 TraceCheckUtils]: 28: Hoare triple {4671#true} #res := 0; {4671#true} is VALID [2020-07-11 00:48:30,109 INFO L280 TraceCheckUtils]: 29: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,110 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4671#true} {4816#(<= 2 |fibo1_#in~n|)} #71#return; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,111 INFO L280 TraceCheckUtils]: 31: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,112 INFO L280 TraceCheckUtils]: 32: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,112 INFO L280 TraceCheckUtils]: 33: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,113 INFO L280 TraceCheckUtils]: 34: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,113 INFO L280 TraceCheckUtils]: 35: Hoare triple {4816#(<= 2 |fibo1_#in~n|)} assume true; {4816#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:30,114 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {4816#(<= 2 |fibo1_#in~n|)} {4783#(= fibo2_~n |fibo2_#in~n|)} #65#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,115 INFO L280 TraceCheckUtils]: 37: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,115 INFO L263 TraceCheckUtils]: 38: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,116 INFO L280 TraceCheckUtils]: 39: Hoare triple {4671#true} ~n := #in~n; {4671#true} is VALID [2020-07-11 00:48:30,116 INFO L280 TraceCheckUtils]: 40: Hoare triple {4671#true} assume !(~n < 1); {4671#true} is VALID [2020-07-11 00:48:30,116 INFO L280 TraceCheckUtils]: 41: Hoare triple {4671#true} assume 1 == ~n; {4671#true} is VALID [2020-07-11 00:48:30,116 INFO L280 TraceCheckUtils]: 42: Hoare triple {4671#true} #res := 1; {4671#true} is VALID [2020-07-11 00:48:30,116 INFO L280 TraceCheckUtils]: 43: Hoare triple {4671#true} assume true; {4671#true} is VALID [2020-07-11 00:48:30,117 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4671#true} {4807#(<= 3 |fibo2_#in~n|)} #67#return; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,118 INFO L280 TraceCheckUtils]: 45: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,118 INFO L280 TraceCheckUtils]: 46: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,118 INFO L280 TraceCheckUtils]: 47: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} havoc #t~ret3; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,119 INFO L280 TraceCheckUtils]: 48: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} havoc #t~ret2; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,119 INFO L280 TraceCheckUtils]: 49: Hoare triple {4807#(<= 3 |fibo2_#in~n|)} assume true; {4807#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,121 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {4807#(<= 3 |fibo2_#in~n|)} {4671#true} #69#return; {4776#(<= 4 fibo1_~n)} is VALID [2020-07-11 00:48:30,121 INFO L280 TraceCheckUtils]: 51: Hoare triple {4776#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4776#(<= 4 fibo1_~n)} is VALID [2020-07-11 00:48:30,121 INFO L263 TraceCheckUtils]: 52: Hoare triple {4776#(<= 4 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {4671#true} is VALID [2020-07-11 00:48:30,122 INFO L280 TraceCheckUtils]: 53: Hoare triple {4671#true} ~n := #in~n; {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,122 INFO L280 TraceCheckUtils]: 54: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4783#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:30,123 INFO L280 TraceCheckUtils]: 55: Hoare triple {4783#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,123 INFO L280 TraceCheckUtils]: 56: Hoare triple {4828#(<= |fibo2_#in~n| 1)} #res := 1; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,124 INFO L280 TraceCheckUtils]: 57: Hoare triple {4828#(<= |fibo2_#in~n| 1)} assume true; {4828#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:30,125 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {4828#(<= |fibo2_#in~n| 1)} {4776#(<= 4 fibo1_~n)} #71#return; {4672#false} is VALID [2020-07-11 00:48:30,125 INFO L280 TraceCheckUtils]: 59: Hoare triple {4672#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4672#false} is VALID [2020-07-11 00:48:30,125 INFO L280 TraceCheckUtils]: 60: Hoare triple {4672#false} #res := #t~ret0 + #t~ret1; {4672#false} is VALID [2020-07-11 00:48:30,126 INFO L280 TraceCheckUtils]: 61: Hoare triple {4672#false} havoc #t~ret1; {4672#false} is VALID [2020-07-11 00:48:30,126 INFO L280 TraceCheckUtils]: 62: Hoare triple {4672#false} havoc #t~ret0; {4672#false} is VALID [2020-07-11 00:48:30,126 INFO L280 TraceCheckUtils]: 63: Hoare triple {4672#false} assume true; {4672#false} is VALID [2020-07-11 00:48:30,126 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {4672#false} {4675#(<= 4 main_~x~0)} #63#return; {4672#false} is VALID [2020-07-11 00:48:30,126 INFO L280 TraceCheckUtils]: 65: Hoare triple {4672#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4672#false} is VALID [2020-07-11 00:48:30,127 INFO L280 TraceCheckUtils]: 66: Hoare triple {4672#false} ~result~0 := #t~ret4; {4672#false} is VALID [2020-07-11 00:48:30,127 INFO L280 TraceCheckUtils]: 67: Hoare triple {4672#false} havoc #t~ret4; {4672#false} is VALID [2020-07-11 00:48:30,127 INFO L280 TraceCheckUtils]: 68: Hoare triple {4672#false} assume 3 == ~result~0; {4672#false} is VALID [2020-07-11 00:48:30,127 INFO L280 TraceCheckUtils]: 69: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2020-07-11 00:48:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-11 00:48:30,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291687469] [2020-07-11 00:48:30,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:30,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:48:30,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456517647] [2020-07-11 00:48:30,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-07-11 00:48:30,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:30,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:48:30,207 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-11 00:48:30,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:48:30,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:48:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:48:30,209 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-07-11 00:48:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:31,376 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-07-11 00:48:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 00:48:31,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-07-11 00:48:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:48:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2020-07-11 00:48:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:48:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2020-07-11 00:48:31,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 127 transitions. [2020-07-11 00:48:31,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:31,537 INFO L225 Difference]: With dead ends: 257 [2020-07-11 00:48:31,538 INFO L226 Difference]: Without dead ends: 151 [2020-07-11 00:48:31,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:48:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-07-11 00:48:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-07-11 00:48:31,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:31,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 133 states. [2020-07-11 00:48:31,862 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 133 states. [2020-07-11 00:48:31,862 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 133 states. [2020-07-11 00:48:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:31,871 INFO L93 Difference]: Finished difference Result 151 states and 217 transitions. [2020-07-11 00:48:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2020-07-11 00:48:31,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:31,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:31,874 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 151 states. [2020-07-11 00:48:31,874 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 151 states. [2020-07-11 00:48:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:31,881 INFO L93 Difference]: Finished difference Result 151 states and 217 transitions. [2020-07-11 00:48:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2020-07-11 00:48:31,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:31,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:31,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:31,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-11 00:48:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-07-11 00:48:31,890 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-07-11 00:48:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:31,890 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-07-11 00:48:31,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:48:31,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 133 states and 191 transitions. [2020-07-11 00:48:32,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-07-11 00:48:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-11 00:48:32,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:32,148 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:48:32,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 00:48:32,149 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:32,149 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-07-11 00:48:32,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:32,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348258455] [2020-07-11 00:48:32,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,196 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5924#true} {5924#true} #59#return; {5924#true} is VALID [2020-07-11 00:48:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,322 INFO L280 TraceCheckUtils]: 3: Hoare triple {6150#(<= |fibo2_#in~n| 1)} #res := 1; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {6150#(<= |fibo2_#in~n| 1)} assume true; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,324 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6150#(<= |fibo2_#in~n| 1)} {6137#(= fibo1_~n |fibo1_#in~n|)} #69#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,329 INFO L280 TraceCheckUtils]: 3: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,330 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5924#true} {6144#(<= |fibo1_#in~n| 2)} #71#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,332 INFO L263 TraceCheckUtils]: 3: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,334 INFO L280 TraceCheckUtils]: 6: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {6150#(<= |fibo2_#in~n| 1)} #res := 1; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {6150#(<= |fibo2_#in~n| 1)} assume true; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,337 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {6150#(<= |fibo2_#in~n| 1)} {6137#(= fibo1_~n |fibo1_#in~n|)} #69#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,338 INFO L263 TraceCheckUtils]: 11: Hoare triple {6144#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,338 INFO L280 TraceCheckUtils]: 13: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,339 INFO L280 TraceCheckUtils]: 15: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,340 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {5924#true} {6144#(<= |fibo1_#in~n| 2)} #71#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,340 INFO L280 TraceCheckUtils]: 17: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,341 INFO L280 TraceCheckUtils]: 18: Hoare triple {6144#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,341 INFO L280 TraceCheckUtils]: 19: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,342 INFO L280 TraceCheckUtils]: 20: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret0; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,342 INFO L280 TraceCheckUtils]: 21: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume true; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,344 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {6144#(<= |fibo1_#in~n| 2)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,351 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5924#true} {6130#(<= |fibo2_#in~n| 3)} #67#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,353 INFO L263 TraceCheckUtils]: 3: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,355 INFO L263 TraceCheckUtils]: 7: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {6150#(<= |fibo2_#in~n| 1)} #res := 1; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {6150#(<= |fibo2_#in~n| 1)} assume true; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,359 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {6150#(<= |fibo2_#in~n| 1)} {6137#(= fibo1_~n |fibo1_#in~n|)} #69#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,360 INFO L280 TraceCheckUtils]: 14: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,360 INFO L263 TraceCheckUtils]: 15: Hoare triple {6144#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,361 INFO L280 TraceCheckUtils]: 17: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,361 INFO L280 TraceCheckUtils]: 18: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,361 INFO L280 TraceCheckUtils]: 19: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,362 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5924#true} {6144#(<= |fibo1_#in~n| 2)} #71#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,363 INFO L280 TraceCheckUtils]: 21: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,363 INFO L280 TraceCheckUtils]: 22: Hoare triple {6144#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,364 INFO L280 TraceCheckUtils]: 23: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,364 INFO L280 TraceCheckUtils]: 24: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret0; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,365 INFO L280 TraceCheckUtils]: 25: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume true; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,366 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {6144#(<= |fibo1_#in~n| 2)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,367 INFO L280 TraceCheckUtils]: 27: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,367 INFO L263 TraceCheckUtils]: 28: Hoare triple {6130#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,367 INFO L280 TraceCheckUtils]: 29: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,367 INFO L280 TraceCheckUtils]: 30: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,368 INFO L280 TraceCheckUtils]: 31: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,368 INFO L280 TraceCheckUtils]: 32: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,368 INFO L280 TraceCheckUtils]: 33: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,369 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5924#true} {6130#(<= |fibo2_#in~n| 3)} #67#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,369 INFO L280 TraceCheckUtils]: 35: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,370 INFO L280 TraceCheckUtils]: 36: Hoare triple {6130#(<= |fibo2_#in~n| 3)} #res := #t~ret2 + #t~ret3; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,371 INFO L280 TraceCheckUtils]: 37: Hoare triple {6130#(<= |fibo2_#in~n| 3)} havoc #t~ret3; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,371 INFO L280 TraceCheckUtils]: 38: Hoare triple {6130#(<= |fibo2_#in~n| 3)} havoc #t~ret2; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,372 INFO L280 TraceCheckUtils]: 39: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume true; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,373 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {6130#(<= |fibo2_#in~n| 3)} {5924#true} #69#return; {6064#(<= fibo1_~n 4)} is VALID [2020-07-11 00:48:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,465 INFO L280 TraceCheckUtils]: 3: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,466 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #69#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,471 INFO L280 TraceCheckUtils]: 3: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,472 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #71#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:32,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,475 INFO L263 TraceCheckUtils]: 3: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,476 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #69#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,477 INFO L263 TraceCheckUtils]: 11: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,478 INFO L280 TraceCheckUtils]: 13: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,478 INFO L280 TraceCheckUtils]: 15: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,479 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #71#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,479 INFO L280 TraceCheckUtils]: 17: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,480 INFO L280 TraceCheckUtils]: 18: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,480 INFO L280 TraceCheckUtils]: 19: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume true; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,483 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {6182#(<= 2 |fibo1_#in~n|)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:48:32,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,489 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5924#true} {6174#(<= 3 |fibo2_#in~n|)} #67#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,491 INFO L263 TraceCheckUtils]: 3: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:32,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,493 INFO L263 TraceCheckUtils]: 7: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,493 INFO L280 TraceCheckUtils]: 9: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,494 INFO L280 TraceCheckUtils]: 11: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,495 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #69#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,496 INFO L263 TraceCheckUtils]: 15: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,496 INFO L280 TraceCheckUtils]: 16: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,497 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #71#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,498 INFO L280 TraceCheckUtils]: 21: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,498 INFO L280 TraceCheckUtils]: 22: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,499 INFO L280 TraceCheckUtils]: 23: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,499 INFO L280 TraceCheckUtils]: 24: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume true; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,501 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {6182#(<= 2 |fibo1_#in~n|)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,501 INFO L280 TraceCheckUtils]: 27: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,502 INFO L263 TraceCheckUtils]: 28: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,502 INFO L280 TraceCheckUtils]: 29: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,502 INFO L280 TraceCheckUtils]: 30: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,502 INFO L280 TraceCheckUtils]: 31: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,502 INFO L280 TraceCheckUtils]: 32: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,503 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5924#true} {6174#(<= 3 |fibo2_#in~n|)} #67#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,504 INFO L280 TraceCheckUtils]: 35: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,504 INFO L280 TraceCheckUtils]: 36: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,505 INFO L280 TraceCheckUtils]: 37: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} havoc #t~ret3; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,505 INFO L280 TraceCheckUtils]: 38: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} havoc #t~ret2; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,506 INFO L280 TraceCheckUtils]: 39: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume true; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,507 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {6174#(<= 3 |fibo2_#in~n|)} {6064#(<= fibo1_~n 4)} #71#return; {5925#false} is VALID [2020-07-11 00:48:32,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {5924#true} assume !(1 == ~n); {5924#true} is VALID [2020-07-11 00:48:32,509 INFO L263 TraceCheckUtils]: 3: Hoare triple {5924#true} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,510 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,511 INFO L263 TraceCheckUtils]: 7: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,513 INFO L263 TraceCheckUtils]: 11: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,516 INFO L280 TraceCheckUtils]: 15: Hoare triple {6150#(<= |fibo2_#in~n| 1)} #res := 1; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,516 INFO L280 TraceCheckUtils]: 16: Hoare triple {6150#(<= |fibo2_#in~n| 1)} assume true; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,517 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {6150#(<= |fibo2_#in~n| 1)} {6137#(= fibo1_~n |fibo1_#in~n|)} #69#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,518 INFO L263 TraceCheckUtils]: 19: Hoare triple {6144#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,519 INFO L280 TraceCheckUtils]: 21: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,519 INFO L280 TraceCheckUtils]: 22: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,519 INFO L280 TraceCheckUtils]: 23: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,520 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {5924#true} {6144#(<= |fibo1_#in~n| 2)} #71#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,521 INFO L280 TraceCheckUtils]: 25: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,521 INFO L280 TraceCheckUtils]: 26: Hoare triple {6144#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,522 INFO L280 TraceCheckUtils]: 27: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,522 INFO L280 TraceCheckUtils]: 28: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret0; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,523 INFO L280 TraceCheckUtils]: 29: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume true; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,524 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {6144#(<= |fibo1_#in~n| 2)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,524 INFO L280 TraceCheckUtils]: 31: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,525 INFO L263 TraceCheckUtils]: 32: Hoare triple {6130#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,525 INFO L280 TraceCheckUtils]: 33: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,525 INFO L280 TraceCheckUtils]: 34: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,525 INFO L280 TraceCheckUtils]: 35: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,525 INFO L280 TraceCheckUtils]: 36: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,526 INFO L280 TraceCheckUtils]: 37: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,526 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {5924#true} {6130#(<= |fibo2_#in~n| 3)} #67#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,527 INFO L280 TraceCheckUtils]: 39: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,527 INFO L280 TraceCheckUtils]: 40: Hoare triple {6130#(<= |fibo2_#in~n| 3)} #res := #t~ret2 + #t~ret3; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,528 INFO L280 TraceCheckUtils]: 41: Hoare triple {6130#(<= |fibo2_#in~n| 3)} havoc #t~ret3; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,528 INFO L280 TraceCheckUtils]: 42: Hoare triple {6130#(<= |fibo2_#in~n| 3)} havoc #t~ret2; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,529 INFO L280 TraceCheckUtils]: 43: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume true; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,530 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {6130#(<= |fibo2_#in~n| 3)} {5924#true} #69#return; {6064#(<= fibo1_~n 4)} is VALID [2020-07-11 00:48:32,531 INFO L280 TraceCheckUtils]: 45: Hoare triple {6064#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6064#(<= fibo1_~n 4)} is VALID [2020-07-11 00:48:32,531 INFO L263 TraceCheckUtils]: 46: Hoare triple {6064#(<= fibo1_~n 4)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,531 INFO L280 TraceCheckUtils]: 47: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,532 INFO L280 TraceCheckUtils]: 48: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,532 INFO L280 TraceCheckUtils]: 49: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,533 INFO L263 TraceCheckUtils]: 50: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,533 INFO L280 TraceCheckUtils]: 51: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,534 INFO L280 TraceCheckUtils]: 52: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:32,535 INFO L280 TraceCheckUtils]: 53: Hoare triple {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,535 INFO L263 TraceCheckUtils]: 54: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,535 INFO L280 TraceCheckUtils]: 55: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,535 INFO L280 TraceCheckUtils]: 56: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,536 INFO L280 TraceCheckUtils]: 57: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,536 INFO L280 TraceCheckUtils]: 58: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,536 INFO L280 TraceCheckUtils]: 59: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,537 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #69#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,538 INFO L280 TraceCheckUtils]: 61: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,538 INFO L263 TraceCheckUtils]: 62: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,538 INFO L280 TraceCheckUtils]: 63: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,538 INFO L280 TraceCheckUtils]: 64: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,538 INFO L280 TraceCheckUtils]: 65: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,539 INFO L280 TraceCheckUtils]: 66: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,539 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #71#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,540 INFO L280 TraceCheckUtils]: 68: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,541 INFO L280 TraceCheckUtils]: 69: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,541 INFO L280 TraceCheckUtils]: 70: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,542 INFO L280 TraceCheckUtils]: 71: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,542 INFO L280 TraceCheckUtils]: 72: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume true; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,543 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {6182#(<= 2 |fibo1_#in~n|)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,544 INFO L280 TraceCheckUtils]: 74: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,544 INFO L263 TraceCheckUtils]: 75: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,544 INFO L280 TraceCheckUtils]: 76: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,544 INFO L280 TraceCheckUtils]: 77: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,545 INFO L280 TraceCheckUtils]: 78: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,545 INFO L280 TraceCheckUtils]: 79: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,545 INFO L280 TraceCheckUtils]: 80: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,546 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {5924#true} {6174#(<= 3 |fibo2_#in~n|)} #67#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,547 INFO L280 TraceCheckUtils]: 82: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,547 INFO L280 TraceCheckUtils]: 83: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,548 INFO L280 TraceCheckUtils]: 84: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} havoc #t~ret3; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,549 INFO L280 TraceCheckUtils]: 85: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} havoc #t~ret2; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,549 INFO L280 TraceCheckUtils]: 86: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume true; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,550 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {6174#(<= 3 |fibo2_#in~n|)} {6064#(<= fibo1_~n 4)} #71#return; {5925#false} is VALID [2020-07-11 00:48:32,551 INFO L280 TraceCheckUtils]: 88: Hoare triple {5925#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5925#false} is VALID [2020-07-11 00:48:32,551 INFO L280 TraceCheckUtils]: 89: Hoare triple {5925#false} #res := #t~ret0 + #t~ret1; {5925#false} is VALID [2020-07-11 00:48:32,551 INFO L280 TraceCheckUtils]: 90: Hoare triple {5925#false} havoc #t~ret1; {5925#false} is VALID [2020-07-11 00:48:32,551 INFO L280 TraceCheckUtils]: 91: Hoare triple {5925#false} havoc #t~ret0; {5925#false} is VALID [2020-07-11 00:48:32,552 INFO L280 TraceCheckUtils]: 92: Hoare triple {5925#false} assume true; {5925#false} is VALID [2020-07-11 00:48:32,552 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {5925#false} {5928#(<= main_~x~0 4)} #63#return; {5925#false} is VALID [2020-07-11 00:48:32,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {5924#true} call ULTIMATE.init(); {5924#true} is VALID [2020-07-11 00:48:32,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,562 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5924#true} {5924#true} #59#return; {5924#true} is VALID [2020-07-11 00:48:32,562 INFO L263 TraceCheckUtils]: 3: Hoare triple {5924#true} call #t~ret5 := main(); {5924#true} is VALID [2020-07-11 00:48:32,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {5924#true} ~x~0 := 4; {5928#(<= main_~x~0 4)} is VALID [2020-07-11 00:48:32,563 INFO L263 TraceCheckUtils]: 5: Hoare triple {5928#(<= main_~x~0 4)} call #t~ret4 := fibo1(~x~0); {5924#true} is VALID [2020-07-11 00:48:32,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {5924#true} assume !(1 == ~n); {5924#true} is VALID [2020-07-11 00:48:32,563 INFO L263 TraceCheckUtils]: 9: Hoare triple {5924#true} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,565 INFO L263 TraceCheckUtils]: 13: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,567 INFO L263 TraceCheckUtils]: 17: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,567 INFO L280 TraceCheckUtils]: 18: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {6150#(<= |fibo2_#in~n| 1)} #res := 1; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,569 INFO L280 TraceCheckUtils]: 22: Hoare triple {6150#(<= |fibo2_#in~n| 1)} assume true; {6150#(<= |fibo2_#in~n| 1)} is VALID [2020-07-11 00:48:32,571 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {6150#(<= |fibo2_#in~n| 1)} {6137#(= fibo1_~n |fibo1_#in~n|)} #69#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,571 INFO L280 TraceCheckUtils]: 24: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,571 INFO L263 TraceCheckUtils]: 25: Hoare triple {6144#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,572 INFO L280 TraceCheckUtils]: 26: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,572 INFO L280 TraceCheckUtils]: 27: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,572 INFO L280 TraceCheckUtils]: 28: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,572 INFO L280 TraceCheckUtils]: 29: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,573 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {5924#true} {6144#(<= |fibo1_#in~n| 2)} #71#return; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,574 INFO L280 TraceCheckUtils]: 31: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,574 INFO L280 TraceCheckUtils]: 32: Hoare triple {6144#(<= |fibo1_#in~n| 2)} #res := #t~ret0 + #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,575 INFO L280 TraceCheckUtils]: 33: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret1; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,575 INFO L280 TraceCheckUtils]: 34: Hoare triple {6144#(<= |fibo1_#in~n| 2)} havoc #t~ret0; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,576 INFO L280 TraceCheckUtils]: 35: Hoare triple {6144#(<= |fibo1_#in~n| 2)} assume true; {6144#(<= |fibo1_#in~n| 2)} is VALID [2020-07-11 00:48:32,577 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {6144#(<= |fibo1_#in~n| 2)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,578 INFO L280 TraceCheckUtils]: 37: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,578 INFO L263 TraceCheckUtils]: 38: Hoare triple {6130#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,578 INFO L280 TraceCheckUtils]: 39: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,578 INFO L280 TraceCheckUtils]: 40: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,578 INFO L280 TraceCheckUtils]: 41: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,579 INFO L280 TraceCheckUtils]: 42: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,579 INFO L280 TraceCheckUtils]: 43: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,580 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5924#true} {6130#(<= |fibo2_#in~n| 3)} #67#return; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,580 INFO L280 TraceCheckUtils]: 45: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,581 INFO L280 TraceCheckUtils]: 46: Hoare triple {6130#(<= |fibo2_#in~n| 3)} #res := #t~ret2 + #t~ret3; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,582 INFO L280 TraceCheckUtils]: 47: Hoare triple {6130#(<= |fibo2_#in~n| 3)} havoc #t~ret3; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,582 INFO L280 TraceCheckUtils]: 48: Hoare triple {6130#(<= |fibo2_#in~n| 3)} havoc #t~ret2; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,583 INFO L280 TraceCheckUtils]: 49: Hoare triple {6130#(<= |fibo2_#in~n| 3)} assume true; {6130#(<= |fibo2_#in~n| 3)} is VALID [2020-07-11 00:48:32,584 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6130#(<= |fibo2_#in~n| 3)} {5924#true} #69#return; {6064#(<= fibo1_~n 4)} is VALID [2020-07-11 00:48:32,585 INFO L280 TraceCheckUtils]: 51: Hoare triple {6064#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6064#(<= fibo1_~n 4)} is VALID [2020-07-11 00:48:32,585 INFO L263 TraceCheckUtils]: 52: Hoare triple {6064#(<= fibo1_~n 4)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,586 INFO L280 TraceCheckUtils]: 53: Hoare triple {5924#true} ~n := #in~n; {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,586 INFO L280 TraceCheckUtils]: 54: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,587 INFO L280 TraceCheckUtils]: 55: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {6106#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,587 INFO L263 TraceCheckUtils]: 56: Hoare triple {6106#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,587 INFO L280 TraceCheckUtils]: 57: Hoare triple {5924#true} ~n := #in~n; {6137#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,588 INFO L280 TraceCheckUtils]: 58: Hoare triple {6137#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-11 00:48:32,590 INFO L280 TraceCheckUtils]: 59: Hoare triple {6181#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,590 INFO L263 TraceCheckUtils]: 60: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {5924#true} is VALID [2020-07-11 00:48:32,590 INFO L280 TraceCheckUtils]: 61: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,590 INFO L280 TraceCheckUtils]: 62: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,591 INFO L280 TraceCheckUtils]: 63: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,591 INFO L280 TraceCheckUtils]: 64: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,591 INFO L280 TraceCheckUtils]: 65: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,592 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #69#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,592 INFO L280 TraceCheckUtils]: 67: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,593 INFO L263 TraceCheckUtils]: 68: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,593 INFO L280 TraceCheckUtils]: 69: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,593 INFO L280 TraceCheckUtils]: 70: Hoare triple {5924#true} assume ~n < 1; {5924#true} is VALID [2020-07-11 00:48:32,593 INFO L280 TraceCheckUtils]: 71: Hoare triple {5924#true} #res := 0; {5924#true} is VALID [2020-07-11 00:48:32,593 INFO L280 TraceCheckUtils]: 72: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,594 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {5924#true} {6182#(<= 2 |fibo1_#in~n|)} #71#return; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,595 INFO L280 TraceCheckUtils]: 74: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,595 INFO L280 TraceCheckUtils]: 75: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,596 INFO L280 TraceCheckUtils]: 76: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret1; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,596 INFO L280 TraceCheckUtils]: 77: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} havoc #t~ret0; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,597 INFO L280 TraceCheckUtils]: 78: Hoare triple {6182#(<= 2 |fibo1_#in~n|)} assume true; {6182#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-11 00:48:32,598 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {6182#(<= 2 |fibo1_#in~n|)} {6106#(= fibo2_~n |fibo2_#in~n|)} #65#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,598 INFO L280 TraceCheckUtils]: 80: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,599 INFO L263 TraceCheckUtils]: 81: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {5924#true} is VALID [2020-07-11 00:48:32,599 INFO L280 TraceCheckUtils]: 82: Hoare triple {5924#true} ~n := #in~n; {5924#true} is VALID [2020-07-11 00:48:32,599 INFO L280 TraceCheckUtils]: 83: Hoare triple {5924#true} assume !(~n < 1); {5924#true} is VALID [2020-07-11 00:48:32,599 INFO L280 TraceCheckUtils]: 84: Hoare triple {5924#true} assume 1 == ~n; {5924#true} is VALID [2020-07-11 00:48:32,599 INFO L280 TraceCheckUtils]: 85: Hoare triple {5924#true} #res := 1; {5924#true} is VALID [2020-07-11 00:48:32,600 INFO L280 TraceCheckUtils]: 86: Hoare triple {5924#true} assume true; {5924#true} is VALID [2020-07-11 00:48:32,600 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {5924#true} {6174#(<= 3 |fibo2_#in~n|)} #67#return; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,601 INFO L280 TraceCheckUtils]: 88: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,601 INFO L280 TraceCheckUtils]: 89: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,602 INFO L280 TraceCheckUtils]: 90: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} havoc #t~ret3; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,602 INFO L280 TraceCheckUtils]: 91: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} havoc #t~ret2; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,603 INFO L280 TraceCheckUtils]: 92: Hoare triple {6174#(<= 3 |fibo2_#in~n|)} assume true; {6174#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-11 00:48:32,604 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {6174#(<= 3 |fibo2_#in~n|)} {6064#(<= fibo1_~n 4)} #71#return; {5925#false} is VALID [2020-07-11 00:48:32,604 INFO L280 TraceCheckUtils]: 94: Hoare triple {5925#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {5925#false} is VALID [2020-07-11 00:48:32,604 INFO L280 TraceCheckUtils]: 95: Hoare triple {5925#false} #res := #t~ret0 + #t~ret1; {5925#false} is VALID [2020-07-11 00:48:32,605 INFO L280 TraceCheckUtils]: 96: Hoare triple {5925#false} havoc #t~ret1; {5925#false} is VALID [2020-07-11 00:48:32,605 INFO L280 TraceCheckUtils]: 97: Hoare triple {5925#false} havoc #t~ret0; {5925#false} is VALID [2020-07-11 00:48:32,605 INFO L280 TraceCheckUtils]: 98: Hoare triple {5925#false} assume true; {5925#false} is VALID [2020-07-11 00:48:32,605 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {5925#false} {5928#(<= main_~x~0 4)} #63#return; {5925#false} is VALID [2020-07-11 00:48:32,606 INFO L280 TraceCheckUtils]: 100: Hoare triple {5925#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5925#false} is VALID [2020-07-11 00:48:32,606 INFO L280 TraceCheckUtils]: 101: Hoare triple {5925#false} ~result~0 := #t~ret4; {5925#false} is VALID [2020-07-11 00:48:32,606 INFO L280 TraceCheckUtils]: 102: Hoare triple {5925#false} havoc #t~ret4; {5925#false} is VALID [2020-07-11 00:48:32,606 INFO L280 TraceCheckUtils]: 103: Hoare triple {5925#false} assume 3 == ~result~0; {5925#false} is VALID [2020-07-11 00:48:32,607 INFO L280 TraceCheckUtils]: 104: Hoare triple {5925#false} assume !false; {5925#false} is VALID [2020-07-11 00:48:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-11 00:48:32,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348258455] [2020-07-11 00:48:32,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:48:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 00:48:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500010026] [2020-07-11 00:48:32,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-07-11 00:48:32,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:48:32,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 00:48:32,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:32,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 00:48:32,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:48:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 00:48:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:48:32,707 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-07-11 00:48:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:34,296 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-07-11 00:48:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:48:34,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-07-11 00:48:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:48:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:48:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2020-07-11 00:48:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:48:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2020-07-11 00:48:34,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 172 transitions. [2020-07-11 00:48:34,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:34,582 INFO L225 Difference]: With dead ends: 265 [2020-07-11 00:48:34,582 INFO L226 Difference]: Without dead ends: 116 [2020-07-11 00:48:34,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-11 00:48:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-11 00:48:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2020-07-11 00:48:34,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:48:34,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 103 states. [2020-07-11 00:48:34,802 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 103 states. [2020-07-11 00:48:34,802 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 103 states. [2020-07-11 00:48:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:34,807 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2020-07-11 00:48:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2020-07-11 00:48:34,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:34,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:34,809 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 116 states. [2020-07-11 00:48:34,809 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 116 states. [2020-07-11 00:48:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:48:34,814 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2020-07-11 00:48:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2020-07-11 00:48:34,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:48:34,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:48:34,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:48:34,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:48:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-11 00:48:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-07-11 00:48:34,819 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 105 [2020-07-11 00:48:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:48:34,820 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-07-11 00:48:34,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 00:48:34,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 103 states and 127 transitions. [2020-07-11 00:48:35,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:48:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2020-07-11 00:48:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-11 00:48:35,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:48:35,028 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2020-07-11 00:48:35,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 00:48:35,029 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:48:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:48:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1951493560, now seen corresponding path program 1 times [2020-07-11 00:48:35,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:48:35,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [567695988] [2020-07-11 00:48:35,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:48:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:48:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:48:35,094 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:48:35,094 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:48:35,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 00:48:35,165 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:48:35,165 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:48:35,165 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:48:35,166 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:48:35,166 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation [2020-07-11 00:48:35,166 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation [2020-07-11 00:48:35,166 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:48:35,166 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:48:35,166 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:48:35,167 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 00:48:35,167 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 00:48:35,167 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:48:35,167 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:48:35,167 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-11 00:48:35,167 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 00:48:35,168 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-11 00:48:35,169 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-11 00:48:35,170 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-11 00:48:35,171 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-11 00:48:35,172 WARN L170 areAnnotationChecker]: L23-5 has no Hoare annotation [2020-07-11 00:48:35,173 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:48:35,173 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 00:48:35,173 WARN L170 areAnnotationChecker]: L23-6 has no Hoare annotation [2020-07-11 00:48:35,173 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:48:35,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:48:35 BoogieIcfgContainer [2020-07-11 00:48:35,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:48:35,182 INFO L168 Benchmark]: Toolchain (without parser) took 16439.36 ms. Allocated memory was 136.3 MB in the beginning and 399.5 MB in the end (delta: 263.2 MB). Free memory was 101.1 MB in the beginning and 265.3 MB in the end (delta: -164.2 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:48:35,183 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:48:35,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.17 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:48:35,186 INFO L168 Benchmark]: Boogie Preprocessor took 33.67 ms. Allocated memory is still 136.3 MB. Free memory was 91.0 MB in the beginning and 89.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:48:35,189 INFO L168 Benchmark]: RCFGBuilder took 553.39 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 89.4 MB in the beginning and 159.1 MB in the end (delta: -69.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:48:35,190 INFO L168 Benchmark]: TraceAbstraction took 15573.69 ms. Allocated memory was 200.8 MB in the beginning and 399.5 MB in the end (delta: 198.7 MB). Free memory was 158.4 MB in the beginning and 265.3 MB in the end (delta: -106.9 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:48:35,193 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.25 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.17 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.67 ms. Allocated memory is still 136.3 MB. Free memory was 91.0 MB in the beginning and 89.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 553.39 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 89.4 MB in the beginning and 159.1 MB in the end (delta: -69.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15573.69 ms. Allocated memory was 200.8 MB in the beginning and 399.5 MB in the end (delta: 198.7 MB). Free memory was 158.4 MB in the beginning and 265.3 MB in the end (delta: -106.9 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 4; VAL [x=4] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=3, x=4] [L37] int result = fibo1(x); VAL [fibo1(x)=3, result=3, x=4] [L38] COND TRUE result == 3 VAL [result=3, x=4] [L39] __VERIFIER_error() VAL [result=3, x=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.4s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 436 SDtfs, 393 SDslu, 1675 SDs, 0 SdLazy, 1055 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 487 ConstructedInterpolants, 0 QuantifiedInterpolants, 56021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 207/306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...