/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:56:23,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:56:23,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:56:23,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:56:23,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:56:23,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:56:23,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:56:23,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:56:23,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:56:23,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:56:23,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:56:23,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:56:23,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:56:23,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:56:23,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:56:23,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:56:23,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:56:23,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:56:23,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:56:23,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:56:23,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:56:23,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:56:23,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:56:23,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:56:23,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:56:23,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:56:23,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:56:23,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:56:23,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:56:23,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:56:23,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:56:23,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:56:23,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:56:23,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:56:23,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:56:23,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:56:23,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:56:23,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:56:23,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:56:23,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:56:23,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:56:23,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:56:23,530 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:56:23,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:56:23,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:56:23,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:56:23,537 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:56:23,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:56:23,537 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:56:23,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:56:23,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:56:23,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:56:23,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:56:23,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:56:23,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:56:23,539 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:56:23,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:56:23,539 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:56:23,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:56:23,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:56:23,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:56:23,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:56:23,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:56:23,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:56:23,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:56:23,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:56:23,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:56:23,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:56:23,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:56:23,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:56:23,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:56:23,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:56:23,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:56:23,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:56:23,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:56:23,868 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:56:23,869 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:56:23,870 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-10 14:56:23,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5135840/106d79eaa9874a67af25cd431f53e243/FLAG4baebc791 [2020-07-10 14:56:24,385 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:56:24,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-07-10 14:56:24,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5135840/106d79eaa9874a67af25cd431f53e243/FLAG4baebc791 [2020-07-10 14:56:24,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5135840/106d79eaa9874a67af25cd431f53e243 [2020-07-10 14:56:24,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:56:24,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:56:24,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:56:24,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:56:24,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:56:24,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:56:24" (1/1) ... [2020-07-10 14:56:24,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1b5dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:24, skipping insertion in model container [2020-07-10 14:56:24,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:56:24" (1/1) ... [2020-07-10 14:56:24,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:56:24,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:56:25,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:56:25,007 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:56:25,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:56:25,044 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:56:25,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25 WrapperNode [2020-07-10 14:56:25,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:56:25,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:56:25,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:56:25,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:56:25,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... [2020-07-10 14:56:25,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:56:25,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:56:25,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:56:25,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:56:25,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:56:25,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:56:25,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:56:25,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-10 14:56:25,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-10 14:56:25,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:56:25,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:56:25,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:56:25,250 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-10 14:56:25,250 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-10 14:56:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:56:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:56:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:56:25,565 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:56:25,566 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:56:25,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:56:25 BoogieIcfgContainer [2020-07-10 14:56:25,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:56:25,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:56:25,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:56:25,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:56:25,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:56:24" (1/3) ... [2020-07-10 14:56:25,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49414629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:56:25, skipping insertion in model container [2020-07-10 14:56:25,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:56:25" (2/3) ... [2020-07-10 14:56:25,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49414629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:56:25, skipping insertion in model container [2020-07-10 14:56:25,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:56:25" (3/3) ... [2020-07-10 14:56:25,582 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2020-07-10 14:56:25,598 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:56:25,605 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:56:25,629 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:56:25,658 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:56:25,658 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:56:25,658 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:56:25,658 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:56:25,659 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:56:25,659 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:56:25,659 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:56:25,659 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:56:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 14:56:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:56:25,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:25,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:56:25,694 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-10 14:56:25,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:25,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628678466] [2020-07-10 14:56:25,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:25,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 14:56:25,914 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-10 14:56:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:25,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:25,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:25,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:25,991 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 4 main_~x~0)} #51#return; {37#false} is VALID [2020-07-10 14:56:25,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-10 14:56:25,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 14:56:25,994 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-10 14:56:25,994 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2020-07-10 14:56:25,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 4; {40#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:25,997 INFO L263 TraceCheckUtils]: 5: Hoare triple {40#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {36#true} is VALID [2020-07-10 14:56:25,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:26,000 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:26,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:26,003 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 4 main_~x~0)} #51#return; {37#false} is VALID [2020-07-10 14:56:26,004 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {37#false} is VALID [2020-07-10 14:56:26,004 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 3 == ~result~0; {37#false} is VALID [2020-07-10 14:56:26,005 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 14:56:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:56:26,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628678466] [2020-07-10 14:56:26,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:56:26,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:56:26,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820377354] [2020-07-10 14:56:26,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:56:26,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:26,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:56:26,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:26,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:56:26,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:26,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:56:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:56:26,079 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-10 14:56:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:26,398 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:56:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:56:26,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:56:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:56:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-10 14:56:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:56:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-10 14:56:26,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-10 14:56:26,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:26,546 INFO L225 Difference]: With dead ends: 44 [2020-07-10 14:56:26,547 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:56:26,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:56:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:56:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 14:56:26,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:26,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 14:56:26,620 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:56:26,621 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:56:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:26,630 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-10 14:56:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:56:26,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:26,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:26,632 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:56:26,632 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:56:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:26,638 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-10 14:56:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:56:26,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:26,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:26,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:26,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:56:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-10 14:56:26,647 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-10 14:56:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:26,647 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-10 14:56:26,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:56:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:56:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 14:56:26,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:26,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:56:26,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:56:26,650 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-10 14:56:26,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:26,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778684060] [2020-07-10 14:56:26,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:26,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-10 14:56:26,691 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-10 14:56:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:26,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:26,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:26,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:26,759 INFO L280 TraceCheckUtils]: 3: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:26,761 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 4 main_~x~0)} #51#return; {208#false} is VALID [2020-07-10 14:56:26,761 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2020-07-10 14:56:26,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-10 14:56:26,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-10 14:56:26,762 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID [2020-07-10 14:56:26,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 4; {211#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:26,764 INFO L263 TraceCheckUtils]: 5: Hoare triple {211#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {207#true} is VALID [2020-07-10 14:56:26,766 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:26,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:26,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:26,770 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:26,771 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 4 main_~x~0)} #51#return; {208#false} is VALID [2020-07-10 14:56:26,772 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {208#false} is VALID [2020-07-10 14:56:26,772 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 3 == ~result~0; {208#false} is VALID [2020-07-10 14:56:26,773 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2020-07-10 14:56:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:56:26,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778684060] [2020-07-10 14:56:26,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:56:26,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:56:26,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867365837] [2020-07-10 14:56:26,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:56:26,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:26,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:56:26,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:26,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:56:26,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:56:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:56:26,802 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-10 14:56:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:27,024 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-10 14:56:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:56:27,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:56:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:56:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 14:56:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:56:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 14:56:27,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-10 14:56:27,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:27,117 INFO L225 Difference]: With dead ends: 36 [2020-07-10 14:56:27,118 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 14:56:27,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:56:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 14:56:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-10 14:56:27,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:27,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-10 14:56:27,154 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-10 14:56:27,154 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-10 14:56:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:27,167 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:56:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-10 14:56:27,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:27,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:27,169 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-10 14:56:27,170 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-10 14:56:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:27,181 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:56:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-10 14:56:27,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:27,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:27,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:27,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:56:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-10 14:56:27,194 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-10 14:56:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:27,195 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-10 14:56:27,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:56:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:56:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:56:27,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:27,202 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:56:27,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:56:27,203 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-10 14:56:27,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:27,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201126966] [2020-07-10 14:56:27,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,335 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-10 14:56:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:27,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,494 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-10 14:56:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:56:27,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:56:27,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-10 14:56:27,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:56:27,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-10 14:56:27,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-10 14:56:27,527 INFO L263 TraceCheckUtils]: 3: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-10 14:56:27,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:27,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,532 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-10 14:56:27,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-10 14:56:27,533 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-10 14:56:27,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:56:27,534 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:56:27,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,537 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-10 14:56:27,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-10 14:56:27,538 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-10 14:56:27,538 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 4 main_~x~0)} #51#return; {376#false} is VALID [2020-07-10 14:56:27,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-10 14:56:27,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,540 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-10 14:56:27,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-10 14:56:27,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 4; {379#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:27,543 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-10 14:56:27,543 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:56:27,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-10 14:56:27,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-10 14:56:27,546 INFO L263 TraceCheckUtils]: 9: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-10 14:56:27,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:27,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,555 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-10 14:56:27,555 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-10 14:56:27,556 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-10 14:56:27,556 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:56:27,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:56:27,556 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,557 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-10 14:56:27,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-10 14:56:27,557 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-10 14:56:27,558 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 4 main_~x~0)} #51#return; {376#false} is VALID [2020-07-10 14:56:27,558 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-10 14:56:27,558 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 3 == ~result~0; {376#false} is VALID [2020-07-10 14:56:27,559 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-10 14:56:27,560 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-10 14:56:27,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201126966] [2020-07-10 14:56:27,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189413201] [2020-07-10 14:56:27,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:56:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:27,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:27,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-10 14:56:27,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,796 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-10 14:56:27,796 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-10 14:56:27,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 4; {379#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:27,798 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-10 14:56:27,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:27,800 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:27,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:27,801 INFO L263 TraceCheckUtils]: 9: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-10 14:56:27,802 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:27,803 INFO L280 TraceCheckUtils]: 11: Hoare triple {443#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:27,806 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {430#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:27,807 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:27,808 INFO L263 TraceCheckUtils]: 15: Hoare triple {453#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-10 14:56:27,808 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:56:27,808 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:56:27,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:56:27,810 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {453#(<= |fibo1_#in~n| 1)} #59#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:27,811 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:27,812 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume true; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:27,813 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {453#(<= |fibo1_#in~n| 1)} {379#(<= 4 main_~x~0)} #51#return; {376#false} is VALID [2020-07-10 14:56:27,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-10 14:56:27,814 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 3 == ~result~0; {376#false} is VALID [2020-07-10 14:56:27,815 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-10 14:56:27,817 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-10 14:56:27,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:27,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-10 14:56:27,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72391102] [2020-07-10 14:56:27,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 14:56:27,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:27,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:56:27,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:27,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:56:27,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:56:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:56:27,872 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-10 14:56:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:28,480 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-10 14:56:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 14:56:28,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 14:56:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:56:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-10 14:56:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:56:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-10 14:56:28,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-10 14:56:28,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:28,638 INFO L225 Difference]: With dead ends: 58 [2020-07-10 14:56:28,638 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 14:56:28,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:56:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 14:56:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-10 14:56:28,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:28,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-10 14:56:28,663 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-10 14:56:28,663 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-10 14:56:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:28,676 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-10 14:56:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-10 14:56:28,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:28,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:28,678 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-10 14:56:28,678 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-10 14:56:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:28,684 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-10 14:56:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-10 14:56:28,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:28,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:28,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:28,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 14:56:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-10 14:56:28,699 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-10 14:56:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:28,700 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-10 14:56:28,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:56:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-10 14:56:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:56:28,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:28,705 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] [2020-07-10 14:56:28,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:56:28,907 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:28,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-10 14:56:28,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:28,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491375366] [2020-07-10 14:56:28,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:28,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:28,967 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-10 14:56:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:29,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:29,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:29,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,068 INFO L280 TraceCheckUtils]: 3: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,070 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {708#(= fibo1_~n |fibo1_#in~n|)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:29,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:56:29,092 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-10 14:56:29,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:29,096 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:29,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:29,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:29,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-10 14:56:29,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~n := #in~n; {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:29,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:29,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,102 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {708#(= fibo1_~n |fibo1_#in~n|)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,103 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,103 INFO L263 TraceCheckUtils]: 10: Hoare triple {714#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-10 14:56:29,104 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:56:29,104 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-10 14:56:29,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:29,105 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,106 INFO L280 TraceCheckUtils]: 16: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume true; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,107 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {714#(<= |fibo1_#in~n| 2)} {689#(<= 4 main_~x~0)} #51#return; {686#false} is VALID [2020-07-10 14:56:29,108 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-10 14:56:29,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:29,109 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-10 14:56:29,109 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-10 14:56:29,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 4; {689#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:29,110 INFO L263 TraceCheckUtils]: 5: Hoare triple {689#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-10 14:56:29,111 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:29,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:29,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:29,112 INFO L263 TraceCheckUtils]: 9: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-10 14:56:29,113 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:29,113 INFO L280 TraceCheckUtils]: 11: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:29,114 INFO L280 TraceCheckUtils]: 12: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,115 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,116 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {708#(= fibo1_~n |fibo1_#in~n|)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,117 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-10 14:56:29,117 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:56:29,118 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-10 14:56:29,118 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:29,119 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,119 INFO L280 TraceCheckUtils]: 21: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,120 INFO L280 TraceCheckUtils]: 22: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume true; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,121 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {714#(<= |fibo1_#in~n| 2)} {689#(<= 4 main_~x~0)} #51#return; {686#false} is VALID [2020-07-10 14:56:29,121 INFO L280 TraceCheckUtils]: 24: Hoare triple {686#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {686#false} is VALID [2020-07-10 14:56:29,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {686#false} assume 3 == ~result~0; {686#false} is VALID [2020-07-10 14:56:29,122 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-10 14:56:29,123 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-10 14:56:29,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491375366] [2020-07-10 14:56:29,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903540419] [2020-07-10 14:56:29,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:29,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:56:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:29,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:29,254 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-10 14:56:29,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:29,255 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-10 14:56:29,256 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-10 14:56:29,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 4; {689#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:29,257 INFO L263 TraceCheckUtils]: 5: Hoare triple {689#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-10 14:56:29,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {742#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:29,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {742#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {742#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:29,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {742#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {742#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:29,259 INFO L263 TraceCheckUtils]: 9: Hoare triple {742#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-10 14:56:29,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {755#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:29,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {755#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {755#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:29,260 INFO L280 TraceCheckUtils]: 12: Hoare triple {755#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,261 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:29,262 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {742#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,262 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-10 14:56:29,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:56:29,263 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-10 14:56:29,263 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:56:29,265 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,268 INFO L280 TraceCheckUtils]: 22: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume true; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:29,269 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {714#(<= |fibo1_#in~n| 2)} {689#(<= 4 main_~x~0)} #51#return; {686#false} is VALID [2020-07-10 14:56:29,269 INFO L280 TraceCheckUtils]: 24: Hoare triple {686#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {686#false} is VALID [2020-07-10 14:56:29,270 INFO L280 TraceCheckUtils]: 25: Hoare triple {686#false} assume 3 == ~result~0; {686#false} is VALID [2020-07-10 14:56:29,270 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-10 14:56:29,271 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-10 14:56:29,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:29,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-10 14:56:29,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892820657] [2020-07-10 14:56:29,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-10 14:56:29,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:29,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 14:56:29,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 14:56:29,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 14:56:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:56:29,330 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-10 14:56:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:29,977 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-10 14:56:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:56:29,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-10 14:56:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 14:56:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-10 14:56:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 14:56:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-10 14:56:29,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2020-07-10 14:56:30,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:30,099 INFO L225 Difference]: With dead ends: 54 [2020-07-10 14:56:30,099 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 14:56:30,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:56:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 14:56:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-10 14:56:30,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:30,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2020-07-10 14:56:30,135 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2020-07-10 14:56:30,135 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2020-07-10 14:56:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:30,140 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2020-07-10 14:56:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2020-07-10 14:56:30,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:30,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:30,142 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2020-07-10 14:56:30,142 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2020-07-10 14:56:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:30,147 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2020-07-10 14:56:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2020-07-10 14:56:30,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:30,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:30,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:30,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 14:56:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-10 14:56:30,153 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-10 14:56:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:30,154 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-10 14:56:30,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 14:56:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-10 14:56:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 14:56:30,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:30,155 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] [2020-07-10 14:56:30,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:30,367 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:30,368 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-10 14:56:30,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:30,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193218130] [2020-07-10 14:56:30,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,420 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1044#true} {1044#true} #47#return; {1044#true} is VALID [2020-07-10 14:56:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:30,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-10 14:56:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,521 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-10 14:56:30,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(~n < 1); {1099#(< 0 fibo2_~n)} is VALID [2020-07-10 14:56:30,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {1099#(< 0 fibo2_~n)} assume !(1 == ~n); {1100#(< 1 fibo2_~n)} is VALID [2020-07-10 14:56:30,525 INFO L263 TraceCheckUtils]: 3: Hoare triple {1100#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:30,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,531 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-10 14:56:30,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {1045#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1045#false} is VALID [2020-07-10 14:56:30,532 INFO L263 TraceCheckUtils]: 9: Hoare triple {1045#false} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,532 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,533 INFO L280 TraceCheckUtils]: 11: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,533 INFO L280 TraceCheckUtils]: 12: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,533 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-10 14:56:30,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {1045#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1045#false} is VALID [2020-07-10 14:56:30,534 INFO L280 TraceCheckUtils]: 15: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-10 14:56:30,534 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1045#false} {1044#true} #57#return; {1045#false} is VALID [2020-07-10 14:56:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,542 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1045#false} #59#return; {1045#false} is VALID [2020-07-10 14:56:30,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(~n < 1); {1044#true} is VALID [2020-07-10 14:56:30,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#true} assume !(1 == ~n); {1044#true} is VALID [2020-07-10 14:56:30,543 INFO L263 TraceCheckUtils]: 3: Hoare triple {1044#true} call #t~ret0 := fibo2(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,545 INFO L280 TraceCheckUtils]: 5: Hoare triple {1044#true} assume !(~n < 1); {1099#(< 0 fibo2_~n)} is VALID [2020-07-10 14:56:30,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#(< 0 fibo2_~n)} assume !(1 == ~n); {1100#(< 1 fibo2_~n)} is VALID [2020-07-10 14:56:30,546 INFO L263 TraceCheckUtils]: 7: Hoare triple {1100#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:30,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,549 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-10 14:56:30,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {1045#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1045#false} is VALID [2020-07-10 14:56:30,550 INFO L263 TraceCheckUtils]: 13: Hoare triple {1045#false} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,550 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,550 INFO L280 TraceCheckUtils]: 15: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,551 INFO L280 TraceCheckUtils]: 16: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,551 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-10 14:56:30,551 INFO L280 TraceCheckUtils]: 18: Hoare triple {1045#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1045#false} is VALID [2020-07-10 14:56:30,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-10 14:56:30,552 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1045#false} {1044#true} #57#return; {1045#false} is VALID [2020-07-10 14:56:30,552 INFO L280 TraceCheckUtils]: 21: Hoare triple {1045#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1045#false} is VALID [2020-07-10 14:56:30,552 INFO L263 TraceCheckUtils]: 22: Hoare triple {1045#false} call #t~ret1 := fibo2(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,553 INFO L280 TraceCheckUtils]: 23: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,553 INFO L280 TraceCheckUtils]: 24: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,553 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,553 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1044#true} {1045#false} #59#return; {1045#false} is VALID [2020-07-10 14:56:30,554 INFO L280 TraceCheckUtils]: 27: Hoare triple {1045#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1045#false} is VALID [2020-07-10 14:56:30,554 INFO L280 TraceCheckUtils]: 28: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-10 14:56:30,554 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1045#false} {1044#true} #51#return; {1045#false} is VALID [2020-07-10 14:56:30,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2020-07-10 14:56:30,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,556 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #47#return; {1044#true} is VALID [2020-07-10 14:56:30,556 INFO L263 TraceCheckUtils]: 3: Hoare triple {1044#true} call #t~ret5 := main(); {1044#true} is VALID [2020-07-10 14:56:30,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~x~0 := 4; {1044#true} is VALID [2020-07-10 14:56:30,556 INFO L263 TraceCheckUtils]: 5: Hoare triple {1044#true} call #t~ret4 := fibo1(~x~0); {1044#true} is VALID [2020-07-10 14:56:30,557 INFO L280 TraceCheckUtils]: 6: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,557 INFO L280 TraceCheckUtils]: 7: Hoare triple {1044#true} assume !(~n < 1); {1044#true} is VALID [2020-07-10 14:56:30,557 INFO L280 TraceCheckUtils]: 8: Hoare triple {1044#true} assume !(1 == ~n); {1044#true} is VALID [2020-07-10 14:56:30,557 INFO L263 TraceCheckUtils]: 9: Hoare triple {1044#true} call #t~ret0 := fibo2(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,559 INFO L280 TraceCheckUtils]: 11: Hoare triple {1044#true} assume !(~n < 1); {1099#(< 0 fibo2_~n)} is VALID [2020-07-10 14:56:30,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {1099#(< 0 fibo2_~n)} assume !(1 == ~n); {1100#(< 1 fibo2_~n)} is VALID [2020-07-10 14:56:30,560 INFO L263 TraceCheckUtils]: 13: Hoare triple {1100#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:30,562 INFO L280 TraceCheckUtils]: 15: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,562 INFO L280 TraceCheckUtils]: 16: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,564 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-10 14:56:30,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {1045#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1045#false} is VALID [2020-07-10 14:56:30,564 INFO L263 TraceCheckUtils]: 19: Hoare triple {1045#false} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,564 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,565 INFO L280 TraceCheckUtils]: 21: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,565 INFO L280 TraceCheckUtils]: 22: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,565 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-10 14:56:30,565 INFO L280 TraceCheckUtils]: 24: Hoare triple {1045#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1045#false} is VALID [2020-07-10 14:56:30,566 INFO L280 TraceCheckUtils]: 25: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-10 14:56:30,566 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1045#false} {1044#true} #57#return; {1045#false} is VALID [2020-07-10 14:56:30,566 INFO L280 TraceCheckUtils]: 27: Hoare triple {1045#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1045#false} is VALID [2020-07-10 14:56:30,566 INFO L263 TraceCheckUtils]: 28: Hoare triple {1045#false} call #t~ret1 := fibo2(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,567 INFO L280 TraceCheckUtils]: 29: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,567 INFO L280 TraceCheckUtils]: 30: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,567 INFO L280 TraceCheckUtils]: 31: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,567 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1044#true} {1045#false} #59#return; {1045#false} is VALID [2020-07-10 14:56:30,568 INFO L280 TraceCheckUtils]: 33: Hoare triple {1045#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1045#false} is VALID [2020-07-10 14:56:30,568 INFO L280 TraceCheckUtils]: 34: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-10 14:56:30,568 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1045#false} {1044#true} #51#return; {1045#false} is VALID [2020-07-10 14:56:30,568 INFO L280 TraceCheckUtils]: 36: Hoare triple {1045#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1045#false} is VALID [2020-07-10 14:56:30,569 INFO L280 TraceCheckUtils]: 37: Hoare triple {1045#false} assume 3 == ~result~0; {1045#false} is VALID [2020-07-10 14:56:30,569 INFO L280 TraceCheckUtils]: 38: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2020-07-10 14:56:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 14:56:30,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193218130] [2020-07-10 14:56:30,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811336217] [2020-07-10 14:56:30,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:56:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:30,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:30,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2020-07-10 14:56:30,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,785 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #47#return; {1044#true} is VALID [2020-07-10 14:56:30,785 INFO L263 TraceCheckUtils]: 3: Hoare triple {1044#true} call #t~ret5 := main(); {1044#true} is VALID [2020-07-10 14:56:30,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~x~0 := 4; {1126#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:30,786 INFO L263 TraceCheckUtils]: 5: Hoare triple {1126#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1044#true} is VALID [2020-07-10 14:56:30,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {1044#true} ~n := #in~n; {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:30,788 INFO L280 TraceCheckUtils]: 7: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:30,788 INFO L280 TraceCheckUtils]: 8: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:30,789 INFO L263 TraceCheckUtils]: 9: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#true} ~n := #in~n; {1146#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:30,790 INFO L280 TraceCheckUtils]: 11: Hoare triple {1146#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {1146#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:30,791 INFO L280 TraceCheckUtils]: 12: Hoare triple {1146#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {1146#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:30,791 INFO L263 TraceCheckUtils]: 13: Hoare triple {1146#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-10 14:56:30,792 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#true} ~n := #in~n; {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:30,793 INFO L280 TraceCheckUtils]: 15: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,793 INFO L280 TraceCheckUtils]: 16: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:30,795 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1146#(<= |fibo2_#in~n| fibo2_~n)} #53#return; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:30,795 INFO L280 TraceCheckUtils]: 18: Hoare triple {1168#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:30,796 INFO L263 TraceCheckUtils]: 19: Hoare triple {1168#(<= |fibo2_#in~n| 1)} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,796 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,796 INFO L280 TraceCheckUtils]: 21: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,796 INFO L280 TraceCheckUtils]: 22: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,797 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1044#true} {1168#(<= |fibo2_#in~n| 1)} #55#return; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:30,798 INFO L280 TraceCheckUtils]: 24: Hoare triple {1168#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:30,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {1168#(<= |fibo2_#in~n| 1)} assume true; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:30,800 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1168#(<= |fibo2_#in~n| 1)} {1133#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:30,800 INFO L280 TraceCheckUtils]: 27: Hoare triple {1196#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:30,800 INFO L263 TraceCheckUtils]: 28: Hoare triple {1196#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {1044#true} is VALID [2020-07-10 14:56:30,800 INFO L280 TraceCheckUtils]: 29: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-10 14:56:30,801 INFO L280 TraceCheckUtils]: 30: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-10 14:56:30,801 INFO L280 TraceCheckUtils]: 31: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-10 14:56:30,801 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1044#true} {1196#(<= |fibo1_#in~n| 2)} #59#return; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:30,802 INFO L280 TraceCheckUtils]: 33: Hoare triple {1196#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:30,802 INFO L280 TraceCheckUtils]: 34: Hoare triple {1196#(<= |fibo1_#in~n| 2)} assume true; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:30,803 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1196#(<= |fibo1_#in~n| 2)} {1126#(<= 4 main_~x~0)} #51#return; {1045#false} is VALID [2020-07-10 14:56:30,804 INFO L280 TraceCheckUtils]: 36: Hoare triple {1045#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1045#false} is VALID [2020-07-10 14:56:30,804 INFO L280 TraceCheckUtils]: 37: Hoare triple {1045#false} assume 3 == ~result~0; {1045#false} is VALID [2020-07-10 14:56:30,804 INFO L280 TraceCheckUtils]: 38: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2020-07-10 14:56:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 14:56:30,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:30,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-10 14:56:30,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359031596] [2020-07-10 14:56:30,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-10 14:56:30,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:30,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 14:56:30,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:30,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 14:56:30,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 14:56:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:56:30,883 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-10 14:56:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:31,871 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-10 14:56:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 14:56:31,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-10 14:56:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:56:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2020-07-10 14:56:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:56:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2020-07-10 14:56:31,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 102 transitions. [2020-07-10 14:56:32,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:32,018 INFO L225 Difference]: With dead ends: 108 [2020-07-10 14:56:32,019 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 14:56:32,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-10 14:56:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 14:56:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-10 14:56:32,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:32,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-10 14:56:32,075 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 14:56:32,075 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 14:56:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:32,081 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2020-07-10 14:56:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-10 14:56:32,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:32,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:32,082 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-10 14:56:32,082 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-10 14:56:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:32,088 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2020-07-10 14:56:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-10 14:56:32,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:32,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:32,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:32,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 14:56:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-10 14:56:32,095 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-10 14:56:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:32,095 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-10 14:56:32,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 14:56:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-10 14:56:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 14:56:32,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:32,097 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] [2020-07-10 14:56:32,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:32,312 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-10 14:56:32,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:32,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69873381] [2020-07-10 14:56:32,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,347 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1610#true} {1610#true} #47#return; {1610#true} is VALID [2020-07-10 14:56:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-10 14:56:32,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-10 14:56:32,467 INFO L280 TraceCheckUtils]: 3: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,468 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-10 14:56:32,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,483 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-10 14:56:32,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-10 14:56:32,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-10 14:56:32,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,489 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,490 INFO L263 TraceCheckUtils]: 10: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,490 INFO L280 TraceCheckUtils]: 11: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-10 14:56:32,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,493 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,493 INFO L280 TraceCheckUtils]: 15: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,494 INFO L280 TraceCheckUtils]: 16: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume true; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,495 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1671#(<= 2 |fibo2_#in~n|)} {1610#true} #57#return; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-10 14:56:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:32,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {1681#(<= |fibo2_#in~n| 0)} assume true; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:32,528 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1681#(<= |fibo2_#in~n| 0)} {1664#(<= 3 fibo1_~n)} #59#return; {1611#false} is VALID [2020-07-10 14:56:32,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-10 14:56:32,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {1610#true} assume !(1 == ~n); {1610#true} is VALID [2020-07-10 14:56:32,530 INFO L263 TraceCheckUtils]: 3: Hoare triple {1610#true} call #t~ret0 := fibo2(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-10 14:56:32,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,537 INFO L263 TraceCheckUtils]: 7: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-10 14:56:32,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-10 14:56:32,538 INFO L280 TraceCheckUtils]: 11: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,544 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,545 INFO L263 TraceCheckUtils]: 14: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,546 INFO L280 TraceCheckUtils]: 16: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-10 14:56:32,546 INFO L280 TraceCheckUtils]: 17: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,547 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,548 INFO L280 TraceCheckUtils]: 19: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,548 INFO L280 TraceCheckUtils]: 20: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume true; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,549 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1671#(<= 2 |fibo2_#in~n|)} {1610#true} #57#return; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-10 14:56:32,556 INFO L280 TraceCheckUtils]: 22: Hoare triple {1664#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-10 14:56:32,556 INFO L263 TraceCheckUtils]: 23: Hoare triple {1664#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,558 INFO L280 TraceCheckUtils]: 24: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,559 INFO L280 TraceCheckUtils]: 25: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:32,559 INFO L280 TraceCheckUtils]: 26: Hoare triple {1681#(<= |fibo2_#in~n| 0)} assume true; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:32,561 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1681#(<= |fibo2_#in~n| 0)} {1664#(<= 3 fibo1_~n)} #59#return; {1611#false} is VALID [2020-07-10 14:56:32,561 INFO L280 TraceCheckUtils]: 28: Hoare triple {1611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1611#false} is VALID [2020-07-10 14:56:32,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {1611#false} assume true; {1611#false} is VALID [2020-07-10 14:56:32,562 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1611#false} {1614#(<= 4 main_~x~0)} #51#return; {1611#false} is VALID [2020-07-10 14:56:32,563 INFO L263 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1610#true} is VALID [2020-07-10 14:56:32,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,563 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1610#true} {1610#true} #47#return; {1610#true} is VALID [2020-07-10 14:56:32,564 INFO L263 TraceCheckUtils]: 3: Hoare triple {1610#true} call #t~ret5 := main(); {1610#true} is VALID [2020-07-10 14:56:32,565 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~x~0 := 4; {1614#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:32,565 INFO L263 TraceCheckUtils]: 5: Hoare triple {1614#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1610#true} is VALID [2020-07-10 14:56:32,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-10 14:56:32,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {1610#true} assume !(1 == ~n); {1610#true} is VALID [2020-07-10 14:56:32,566 INFO L263 TraceCheckUtils]: 9: Hoare triple {1610#true} call #t~ret0 := fibo2(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-10 14:56:32,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,572 INFO L263 TraceCheckUtils]: 13: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,572 INFO L280 TraceCheckUtils]: 15: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-10 14:56:32,572 INFO L280 TraceCheckUtils]: 16: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-10 14:56:32,573 INFO L280 TraceCheckUtils]: 17: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,573 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,574 INFO L263 TraceCheckUtils]: 20: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,575 INFO L280 TraceCheckUtils]: 21: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-10 14:56:32,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,576 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,576 INFO L280 TraceCheckUtils]: 25: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,577 INFO L280 TraceCheckUtils]: 26: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume true; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,578 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1671#(<= 2 |fibo2_#in~n|)} {1610#true} #57#return; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-10 14:56:32,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {1664#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-10 14:56:32,579 INFO L263 TraceCheckUtils]: 29: Hoare triple {1664#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,579 INFO L280 TraceCheckUtils]: 30: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:32,581 INFO L280 TraceCheckUtils]: 31: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:32,581 INFO L280 TraceCheckUtils]: 32: Hoare triple {1681#(<= |fibo2_#in~n| 0)} assume true; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:56:32,582 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1681#(<= |fibo2_#in~n| 0)} {1664#(<= 3 fibo1_~n)} #59#return; {1611#false} is VALID [2020-07-10 14:56:32,583 INFO L280 TraceCheckUtils]: 34: Hoare triple {1611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1611#false} is VALID [2020-07-10 14:56:32,583 INFO L280 TraceCheckUtils]: 35: Hoare triple {1611#false} assume true; {1611#false} is VALID [2020-07-10 14:56:32,583 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1611#false} {1614#(<= 4 main_~x~0)} #51#return; {1611#false} is VALID [2020-07-10 14:56:32,583 INFO L280 TraceCheckUtils]: 37: Hoare triple {1611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1611#false} is VALID [2020-07-10 14:56:32,583 INFO L280 TraceCheckUtils]: 38: Hoare triple {1611#false} assume 3 == ~result~0; {1611#false} is VALID [2020-07-10 14:56:32,584 INFO L280 TraceCheckUtils]: 39: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2020-07-10 14:56:32,586 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-10 14:56:32,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69873381] [2020-07-10 14:56:32,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136201675] [2020-07-10 14:56:32,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:56:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:32,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:32,836 INFO L263 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1610#true} is VALID [2020-07-10 14:56:32,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,837 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1610#true} {1610#true} #47#return; {1610#true} is VALID [2020-07-10 14:56:32,837 INFO L263 TraceCheckUtils]: 3: Hoare triple {1610#true} call #t~ret5 := main(); {1610#true} is VALID [2020-07-10 14:56:32,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~x~0 := 4; {1614#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:32,838 INFO L263 TraceCheckUtils]: 5: Hoare triple {1614#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1610#true} is VALID [2020-07-10 14:56:32,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {1610#true} ~n := #in~n; {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:32,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:32,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:32,839 INFO L263 TraceCheckUtils]: 9: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1610#true} ~n := #in~n; {1716#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:32,840 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {1716#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:32,841 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {1716#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:32,841 INFO L263 TraceCheckUtils]: 13: Hoare triple {1716#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-10 14:56:32,841 INFO L280 TraceCheckUtils]: 14: Hoare triple {1610#true} ~n := #in~n; {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:32,842 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:32,842 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {1735#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:32,842 INFO L280 TraceCheckUtils]: 17: Hoare triple {1735#(<= |fibo1_#in~n| 1)} assume true; {1735#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:32,844 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1735#(<= |fibo1_#in~n| 1)} {1716#(<= |fibo2_#in~n| fibo2_~n)} #53#return; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:32,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {1742#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:32,845 INFO L263 TraceCheckUtils]: 20: Hoare triple {1742#(<= |fibo2_#in~n| 2)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,845 INFO L280 TraceCheckUtils]: 21: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,845 INFO L280 TraceCheckUtils]: 22: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-10 14:56:32,846 INFO L280 TraceCheckUtils]: 23: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,847 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1610#true} {1742#(<= |fibo2_#in~n| 2)} #55#return; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:32,847 INFO L280 TraceCheckUtils]: 25: Hoare triple {1742#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:32,847 INFO L280 TraceCheckUtils]: 26: Hoare triple {1742#(<= |fibo2_#in~n| 2)} assume true; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:32,848 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1742#(<= |fibo2_#in~n| 2)} {1703#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:32,849 INFO L280 TraceCheckUtils]: 28: Hoare triple {1770#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:32,849 INFO L263 TraceCheckUtils]: 29: Hoare triple {1770#(<= |fibo1_#in~n| 3)} call #t~ret1 := fibo2(~n - 2); {1610#true} is VALID [2020-07-10 14:56:32,849 INFO L280 TraceCheckUtils]: 30: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-10 14:56:32,849 INFO L280 TraceCheckUtils]: 31: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-10 14:56:32,849 INFO L280 TraceCheckUtils]: 32: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-10 14:56:32,850 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1610#true} {1770#(<= |fibo1_#in~n| 3)} #59#return; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:32,851 INFO L280 TraceCheckUtils]: 34: Hoare triple {1770#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:32,851 INFO L280 TraceCheckUtils]: 35: Hoare triple {1770#(<= |fibo1_#in~n| 3)} assume true; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:32,852 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1770#(<= |fibo1_#in~n| 3)} {1614#(<= 4 main_~x~0)} #51#return; {1611#false} is VALID [2020-07-10 14:56:32,852 INFO L280 TraceCheckUtils]: 37: Hoare triple {1611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1611#false} is VALID [2020-07-10 14:56:32,852 INFO L280 TraceCheckUtils]: 38: Hoare triple {1611#false} assume 3 == ~result~0; {1611#false} is VALID [2020-07-10 14:56:32,852 INFO L280 TraceCheckUtils]: 39: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2020-07-10 14:56:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 14:56:32,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:32,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-10 14:56:32,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941926048] [2020-07-10 14:56:32,856 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-10 14:56:32,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:32,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 14:56:32,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:32,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 14:56:32,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 14:56:32,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:56:32,936 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-10 14:56:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:34,580 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-10 14:56:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 14:56:34,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-10 14:56:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:56:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2020-07-10 14:56:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:56:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2020-07-10 14:56:34,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 133 transitions. [2020-07-10 14:56:34,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:34,771 INFO L225 Difference]: With dead ends: 180 [2020-07-10 14:56:34,771 INFO L226 Difference]: Without dead ends: 120 [2020-07-10 14:56:34,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-10 14:56:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-10 14:56:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-10 14:56:34,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:34,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 106 states. [2020-07-10 14:56:34,866 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 106 states. [2020-07-10 14:56:34,866 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 106 states. [2020-07-10 14:56:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:34,877 INFO L93 Difference]: Finished difference Result 120 states and 198 transitions. [2020-07-10 14:56:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 198 transitions. [2020-07-10 14:56:34,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:34,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:34,879 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 120 states. [2020-07-10 14:56:34,879 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 120 states. [2020-07-10 14:56:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:34,890 INFO L93 Difference]: Finished difference Result 120 states and 198 transitions. [2020-07-10 14:56:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 198 transitions. [2020-07-10 14:56:34,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:34,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:34,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:34,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-10 14:56:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-10 14:56:34,900 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-10 14:56:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:34,900 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-10 14:56:34,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 14:56:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-10 14:56:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 14:56:34,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:34,903 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2020-07-10 14:56:35,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:35,114 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:35,115 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-10 14:56:35,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:35,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698301121] [2020-07-10 14:56:35,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,166 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2439#true} {2439#true} #47#return; {2439#true} is VALID [2020-07-10 14:56:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,348 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-10 14:56:35,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:35,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,368 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,370 INFO L280 TraceCheckUtils]: 9: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,370 INFO L263 TraceCheckUtils]: 10: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,370 INFO L280 TraceCheckUtils]: 11: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,371 INFO L280 TraceCheckUtils]: 12: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-10 14:56:35,371 INFO L280 TraceCheckUtils]: 13: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,372 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,376 INFO L280 TraceCheckUtils]: 16: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,377 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,405 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-10 14:56:35,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-10 14:56:35,406 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,408 INFO L280 TraceCheckUtils]: 5: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:35,408 INFO L280 TraceCheckUtils]: 6: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,409 INFO L263 TraceCheckUtils]: 7: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,409 INFO L280 TraceCheckUtils]: 8: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,410 INFO L280 TraceCheckUtils]: 10: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,411 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,412 INFO L263 TraceCheckUtils]: 14: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,412 INFO L280 TraceCheckUtils]: 15: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-10 14:56:35,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,414 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,415 INFO L280 TraceCheckUtils]: 19: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,417 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {2543#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,418 INFO L263 TraceCheckUtils]: 23: Hoare triple {2543#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,420 INFO L280 TraceCheckUtils]: 26: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,421 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-10 14:56:35,422 INFO L280 TraceCheckUtils]: 28: Hoare triple {2440#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2440#false} is VALID [2020-07-10 14:56:35,422 INFO L280 TraceCheckUtils]: 29: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-10 14:56:35,422 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2440#false} {2439#true} #57#return; {2440#false} is VALID [2020-07-10 14:56:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,430 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2439#true} {2440#false} #59#return; {2440#false} is VALID [2020-07-10 14:56:35,430 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-10 14:56:35,431 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,431 INFO L280 TraceCheckUtils]: 5: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,431 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-10 14:56:35,432 INFO L263 TraceCheckUtils]: 7: Hoare triple {2439#true} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,432 INFO L280 TraceCheckUtils]: 8: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,433 INFO L280 TraceCheckUtils]: 9: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:35,434 INFO L280 TraceCheckUtils]: 10: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,435 INFO L263 TraceCheckUtils]: 11: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,435 INFO L280 TraceCheckUtils]: 12: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,435 INFO L280 TraceCheckUtils]: 13: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,435 INFO L280 TraceCheckUtils]: 14: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,435 INFO L280 TraceCheckUtils]: 15: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,436 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,437 INFO L280 TraceCheckUtils]: 17: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,437 INFO L263 TraceCheckUtils]: 18: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,438 INFO L280 TraceCheckUtils]: 19: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,438 INFO L280 TraceCheckUtils]: 20: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-10 14:56:35,438 INFO L280 TraceCheckUtils]: 21: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,439 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,440 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,440 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,442 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,442 INFO L280 TraceCheckUtils]: 26: Hoare triple {2543#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,443 INFO L263 TraceCheckUtils]: 27: Hoare triple {2543#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,443 INFO L280 TraceCheckUtils]: 28: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,444 INFO L280 TraceCheckUtils]: 29: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,445 INFO L280 TraceCheckUtils]: 30: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,446 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-10 14:56:35,446 INFO L280 TraceCheckUtils]: 32: Hoare triple {2440#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2440#false} is VALID [2020-07-10 14:56:35,447 INFO L280 TraceCheckUtils]: 33: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-10 14:56:35,447 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2440#false} {2439#true} #57#return; {2440#false} is VALID [2020-07-10 14:56:35,447 INFO L280 TraceCheckUtils]: 35: Hoare triple {2440#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2440#false} is VALID [2020-07-10 14:56:35,447 INFO L263 TraceCheckUtils]: 36: Hoare triple {2440#false} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,447 INFO L280 TraceCheckUtils]: 37: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,448 INFO L280 TraceCheckUtils]: 38: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,448 INFO L280 TraceCheckUtils]: 39: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,448 INFO L280 TraceCheckUtils]: 40: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,448 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2439#true} {2440#false} #59#return; {2440#false} is VALID [2020-07-10 14:56:35,448 INFO L280 TraceCheckUtils]: 42: Hoare triple {2440#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2440#false} is VALID [2020-07-10 14:56:35,449 INFO L280 TraceCheckUtils]: 43: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-10 14:56:35,449 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2440#false} {2443#(<= 4 main_~x~0)} #51#return; {2440#false} is VALID [2020-07-10 14:56:35,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {2439#true} call ULTIMATE.init(); {2439#true} is VALID [2020-07-10 14:56:35,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,451 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2439#true} {2439#true} #47#return; {2439#true} is VALID [2020-07-10 14:56:35,451 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret5 := main(); {2439#true} is VALID [2020-07-10 14:56:35,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~x~0 := 4; {2443#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:35,452 INFO L263 TraceCheckUtils]: 5: Hoare triple {2443#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {2439#true} is VALID [2020-07-10 14:56:35,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-10 14:56:35,453 INFO L263 TraceCheckUtils]: 9: Hoare triple {2439#true} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-10 14:56:35,454 INFO L263 TraceCheckUtils]: 13: Hoare triple {2439#true} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:35,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,457 INFO L263 TraceCheckUtils]: 17: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,458 INFO L280 TraceCheckUtils]: 20: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,458 INFO L280 TraceCheckUtils]: 21: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,459 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,459 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,460 INFO L263 TraceCheckUtils]: 24: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,460 INFO L280 TraceCheckUtils]: 25: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,460 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-10 14:56:35,460 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,461 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,462 INFO L280 TraceCheckUtils]: 29: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,462 INFO L280 TraceCheckUtils]: 30: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,464 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,464 INFO L280 TraceCheckUtils]: 32: Hoare triple {2543#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-10 14:56:35,465 INFO L263 TraceCheckUtils]: 33: Hoare triple {2543#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,465 INFO L280 TraceCheckUtils]: 34: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:35,466 INFO L280 TraceCheckUtils]: 35: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,467 INFO L280 TraceCheckUtils]: 36: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,468 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-10 14:56:35,468 INFO L280 TraceCheckUtils]: 38: Hoare triple {2440#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2440#false} is VALID [2020-07-10 14:56:35,468 INFO L280 TraceCheckUtils]: 39: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-10 14:56:35,469 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2440#false} {2439#true} #57#return; {2440#false} is VALID [2020-07-10 14:56:35,469 INFO L280 TraceCheckUtils]: 41: Hoare triple {2440#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2440#false} is VALID [2020-07-10 14:56:35,469 INFO L263 TraceCheckUtils]: 42: Hoare triple {2440#false} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,469 INFO L280 TraceCheckUtils]: 43: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,470 INFO L280 TraceCheckUtils]: 44: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,470 INFO L280 TraceCheckUtils]: 45: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,470 INFO L280 TraceCheckUtils]: 46: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,470 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2439#true} {2440#false} #59#return; {2440#false} is VALID [2020-07-10 14:56:35,470 INFO L280 TraceCheckUtils]: 48: Hoare triple {2440#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2440#false} is VALID [2020-07-10 14:56:35,471 INFO L280 TraceCheckUtils]: 49: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-10 14:56:35,471 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2440#false} {2443#(<= 4 main_~x~0)} #51#return; {2440#false} is VALID [2020-07-10 14:56:35,471 INFO L280 TraceCheckUtils]: 51: Hoare triple {2440#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {2440#false} is VALID [2020-07-10 14:56:35,471 INFO L280 TraceCheckUtils]: 52: Hoare triple {2440#false} assume 3 == ~result~0; {2440#false} is VALID [2020-07-10 14:56:35,471 INFO L280 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2020-07-10 14:56:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-10 14:56:35,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698301121] [2020-07-10 14:56:35,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003614121] [2020-07-10 14:56:35,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:56:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:35,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:35,686 INFO L263 TraceCheckUtils]: 0: Hoare triple {2439#true} call ULTIMATE.init(); {2439#true} is VALID [2020-07-10 14:56:35,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,686 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2439#true} {2439#true} #47#return; {2439#true} is VALID [2020-07-10 14:56:35,686 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret5 := main(); {2439#true} is VALID [2020-07-10 14:56:35,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~x~0 := 4; {2443#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:35,687 INFO L263 TraceCheckUtils]: 5: Hoare triple {2443#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {2439#true} is VALID [2020-07-10 14:56:35,688 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} ~n := #in~n; {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:35,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:35,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:35,689 INFO L263 TraceCheckUtils]: 9: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {2439#true} ~n := #in~n; {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:35,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:35,691 INFO L280 TraceCheckUtils]: 12: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:35,692 INFO L263 TraceCheckUtils]: 13: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,692 INFO L280 TraceCheckUtils]: 16: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-10 14:56:35,692 INFO L263 TraceCheckUtils]: 17: Hoare triple {2439#true} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-10 14:56:35,693 INFO L280 TraceCheckUtils]: 18: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,693 INFO L280 TraceCheckUtils]: 19: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,693 INFO L280 TraceCheckUtils]: 20: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,693 INFO L280 TraceCheckUtils]: 21: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,694 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2439#true} {2439#true} #57#return; {2439#true} is VALID [2020-07-10 14:56:35,694 INFO L280 TraceCheckUtils]: 23: Hoare triple {2439#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2439#true} is VALID [2020-07-10 14:56:35,694 INFO L263 TraceCheckUtils]: 24: Hoare triple {2439#true} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,694 INFO L280 TraceCheckUtils]: 25: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-10 14:56:35,694 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,695 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2439#true} {2439#true} #59#return; {2439#true} is VALID [2020-07-10 14:56:35,695 INFO L280 TraceCheckUtils]: 29: Hoare triple {2439#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2439#true} is VALID [2020-07-10 14:56:35,695 INFO L280 TraceCheckUtils]: 30: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,696 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2439#true} {2595#(<= |fibo2_#in~n| fibo2_~n)} #53#return; {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:35,697 INFO L280 TraceCheckUtils]: 32: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:35,697 INFO L263 TraceCheckUtils]: 33: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,698 INFO L280 TraceCheckUtils]: 34: Hoare triple {2439#true} ~n := #in~n; {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:35,699 INFO L280 TraceCheckUtils]: 35: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,699 INFO L280 TraceCheckUtils]: 36: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:56:35,701 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2595#(<= |fibo2_#in~n| fibo2_~n)} #55#return; {2677#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:35,702 INFO L280 TraceCheckUtils]: 38: Hoare triple {2677#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2677#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:35,703 INFO L280 TraceCheckUtils]: 39: Hoare triple {2677#(<= |fibo2_#in~n| 2)} assume true; {2677#(<= |fibo2_#in~n| 2)} is VALID [2020-07-10 14:56:35,705 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2677#(<= |fibo2_#in~n| 2)} {2582#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:35,706 INFO L280 TraceCheckUtils]: 41: Hoare triple {2687#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:35,706 INFO L263 TraceCheckUtils]: 42: Hoare triple {2687#(<= |fibo1_#in~n| 3)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-10 14:56:35,706 INFO L280 TraceCheckUtils]: 43: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-10 14:56:35,706 INFO L280 TraceCheckUtils]: 44: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-10 14:56:35,707 INFO L280 TraceCheckUtils]: 45: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-10 14:56:35,707 INFO L280 TraceCheckUtils]: 46: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-10 14:56:35,708 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2439#true} {2687#(<= |fibo1_#in~n| 3)} #59#return; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:35,709 INFO L280 TraceCheckUtils]: 48: Hoare triple {2687#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:35,709 INFO L280 TraceCheckUtils]: 49: Hoare triple {2687#(<= |fibo1_#in~n| 3)} assume true; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:35,711 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2687#(<= |fibo1_#in~n| 3)} {2443#(<= 4 main_~x~0)} #51#return; {2440#false} is VALID [2020-07-10 14:56:35,711 INFO L280 TraceCheckUtils]: 51: Hoare triple {2440#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {2440#false} is VALID [2020-07-10 14:56:35,711 INFO L280 TraceCheckUtils]: 52: Hoare triple {2440#false} assume 3 == ~result~0; {2440#false} is VALID [2020-07-10 14:56:35,711 INFO L280 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2020-07-10 14:56:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-10 14:56:35,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:35,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-07-10 14:56:35,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855796088] [2020-07-10 14:56:35,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-10 14:56:35,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:35,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:56:35,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:35,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:56:35,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:56:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:56:35,808 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 12 states. [2020-07-10 14:56:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:37,327 INFO L93 Difference]: Finished difference Result 265 states and 511 transitions. [2020-07-10 14:56:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 14:56:37,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-10 14:56:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:56:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2020-07-10 14:56:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:56:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2020-07-10 14:56:37,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 122 transitions. [2020-07-10 14:56:37,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:37,492 INFO L225 Difference]: With dead ends: 265 [2020-07-10 14:56:37,492 INFO L226 Difference]: Without dead ends: 165 [2020-07-10 14:56:37,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-07-10 14:56:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-10 14:56:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2020-07-10 14:56:37,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:37,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 142 states. [2020-07-10 14:56:37,633 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 142 states. [2020-07-10 14:56:37,633 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 142 states. [2020-07-10 14:56:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:37,651 INFO L93 Difference]: Finished difference Result 165 states and 285 transitions. [2020-07-10 14:56:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 285 transitions. [2020-07-10 14:56:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:37,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:37,654 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 165 states. [2020-07-10 14:56:37,654 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 165 states. [2020-07-10 14:56:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:37,669 INFO L93 Difference]: Finished difference Result 165 states and 285 transitions. [2020-07-10 14:56:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 285 transitions. [2020-07-10 14:56:37,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:37,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:37,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:37,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-10 14:56:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 244 transitions. [2020-07-10 14:56:37,686 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 244 transitions. Word has length 54 [2020-07-10 14:56:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:37,687 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 244 transitions. [2020-07-10 14:56:37,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:56:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 244 transitions. [2020-07-10 14:56:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 14:56:37,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:37,690 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2020-07-10 14:56:37,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 14:56:37,906 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2020-07-10 14:56:37,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:37,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283947385] [2020-07-10 14:56:37,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:37,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:37,944 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3599#true} {3599#true} #47#return; {3599#true} is VALID [2020-07-10 14:56:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,092 INFO L280 TraceCheckUtils]: 3: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,093 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-10 14:56:38,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,100 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:38,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,102 INFO L263 TraceCheckUtils]: 3: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,103 INFO L280 TraceCheckUtils]: 5: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,103 INFO L280 TraceCheckUtils]: 6: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,104 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,105 INFO L263 TraceCheckUtils]: 10: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,106 INFO L280 TraceCheckUtils]: 12: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-10 14:56:38,106 INFO L280 TraceCheckUtils]: 13: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,107 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,109 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,115 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,115 INFO L280 TraceCheckUtils]: 3: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,116 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,117 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,118 INFO L263 TraceCheckUtils]: 3: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,119 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:38,120 INFO L280 TraceCheckUtils]: 6: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,121 INFO L263 TraceCheckUtils]: 7: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,121 INFO L280 TraceCheckUtils]: 8: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,121 INFO L280 TraceCheckUtils]: 9: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,121 INFO L280 TraceCheckUtils]: 10: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,121 INFO L280 TraceCheckUtils]: 11: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,122 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,123 INFO L280 TraceCheckUtils]: 13: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,123 INFO L263 TraceCheckUtils]: 14: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,123 INFO L280 TraceCheckUtils]: 15: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,124 INFO L280 TraceCheckUtils]: 16: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-10 14:56:38,124 INFO L280 TraceCheckUtils]: 17: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,125 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,125 INFO L280 TraceCheckUtils]: 19: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,126 INFO L280 TraceCheckUtils]: 20: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,127 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,127 INFO L280 TraceCheckUtils]: 22: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,127 INFO L263 TraceCheckUtils]: 23: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,128 INFO L280 TraceCheckUtils]: 24: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,128 INFO L280 TraceCheckUtils]: 25: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,128 INFO L280 TraceCheckUtils]: 26: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,128 INFO L280 TraceCheckUtils]: 27: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,129 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,129 INFO L280 TraceCheckUtils]: 29: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,130 INFO L280 TraceCheckUtils]: 30: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume true; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,131 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3707#(<= 3 |fibo2_#in~n|)} {3599#true} #57#return; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-10 14:56:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,155 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3682#(<= 4 fibo1_~n)} #59#return; {3600#false} is VALID [2020-07-10 14:56:38,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-10 14:56:38,156 INFO L263 TraceCheckUtils]: 3: Hoare triple {3599#true} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,158 INFO L263 TraceCheckUtils]: 7: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,159 INFO L280 TraceCheckUtils]: 9: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:38,160 INFO L280 TraceCheckUtils]: 10: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,160 INFO L263 TraceCheckUtils]: 11: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,161 INFO L280 TraceCheckUtils]: 14: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,161 INFO L280 TraceCheckUtils]: 15: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,162 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,163 INFO L280 TraceCheckUtils]: 17: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,163 INFO L263 TraceCheckUtils]: 18: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,163 INFO L280 TraceCheckUtils]: 19: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,163 INFO L280 TraceCheckUtils]: 20: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-10 14:56:38,164 INFO L280 TraceCheckUtils]: 21: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,164 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,165 INFO L280 TraceCheckUtils]: 23: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,166 INFO L280 TraceCheckUtils]: 24: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,167 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,168 INFO L280 TraceCheckUtils]: 26: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,168 INFO L263 TraceCheckUtils]: 27: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,168 INFO L280 TraceCheckUtils]: 28: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,168 INFO L280 TraceCheckUtils]: 29: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,169 INFO L280 TraceCheckUtils]: 30: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,169 INFO L280 TraceCheckUtils]: 31: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,171 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,171 INFO L280 TraceCheckUtils]: 33: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,172 INFO L280 TraceCheckUtils]: 34: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume true; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,173 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3707#(<= 3 |fibo2_#in~n|)} {3599#true} #57#return; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-10 14:56:38,174 INFO L280 TraceCheckUtils]: 36: Hoare triple {3682#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-10 14:56:38,174 INFO L263 TraceCheckUtils]: 37: Hoare triple {3682#(<= 4 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,174 INFO L280 TraceCheckUtils]: 38: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,175 INFO L280 TraceCheckUtils]: 39: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,176 INFO L280 TraceCheckUtils]: 40: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,176 INFO L280 TraceCheckUtils]: 41: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,177 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3682#(<= 4 fibo1_~n)} #59#return; {3600#false} is VALID [2020-07-10 14:56:38,178 INFO L280 TraceCheckUtils]: 43: Hoare triple {3600#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3600#false} is VALID [2020-07-10 14:56:38,178 INFO L280 TraceCheckUtils]: 44: Hoare triple {3600#false} assume true; {3600#false} is VALID [2020-07-10 14:56:38,178 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {3600#false} {3603#(<= 4 main_~x~0)} #51#return; {3600#false} is VALID [2020-07-10 14:56:38,181 INFO L263 TraceCheckUtils]: 0: Hoare triple {3599#true} call ULTIMATE.init(); {3599#true} is VALID [2020-07-10 14:56:38,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3599#true} {3599#true} #47#return; {3599#true} is VALID [2020-07-10 14:56:38,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {3599#true} call #t~ret5 := main(); {3599#true} is VALID [2020-07-10 14:56:38,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~x~0 := 4; {3603#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:38,183 INFO L263 TraceCheckUtils]: 5: Hoare triple {3603#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {3599#true} is VALID [2020-07-10 14:56:38,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-10 14:56:38,184 INFO L263 TraceCheckUtils]: 9: Hoare triple {3599#true} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,185 INFO L280 TraceCheckUtils]: 11: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,186 INFO L263 TraceCheckUtils]: 13: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,186 INFO L280 TraceCheckUtils]: 14: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-10 14:56:38,188 INFO L280 TraceCheckUtils]: 16: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,188 INFO L263 TraceCheckUtils]: 17: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,188 INFO L280 TraceCheckUtils]: 18: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,188 INFO L280 TraceCheckUtils]: 20: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,188 INFO L280 TraceCheckUtils]: 21: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,189 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,190 INFO L280 TraceCheckUtils]: 23: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,190 INFO L263 TraceCheckUtils]: 24: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,190 INFO L280 TraceCheckUtils]: 25: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,190 INFO L280 TraceCheckUtils]: 26: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-10 14:56:38,191 INFO L280 TraceCheckUtils]: 27: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,192 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,192 INFO L280 TraceCheckUtils]: 29: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,193 INFO L280 TraceCheckUtils]: 30: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:38,194 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,194 INFO L280 TraceCheckUtils]: 32: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,195 INFO L263 TraceCheckUtils]: 33: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,195 INFO L280 TraceCheckUtils]: 34: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,195 INFO L280 TraceCheckUtils]: 35: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,195 INFO L280 TraceCheckUtils]: 36: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,196 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,197 INFO L280 TraceCheckUtils]: 39: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,197 INFO L280 TraceCheckUtils]: 40: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume true; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,198 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3707#(<= 3 |fibo2_#in~n|)} {3599#true} #57#return; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-10 14:56:38,199 INFO L280 TraceCheckUtils]: 42: Hoare triple {3682#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-10 14:56:38,199 INFO L263 TraceCheckUtils]: 43: Hoare triple {3682#(<= 4 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,200 INFO L280 TraceCheckUtils]: 44: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,200 INFO L280 TraceCheckUtils]: 45: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:38,201 INFO L280 TraceCheckUtils]: 46: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,201 INFO L280 TraceCheckUtils]: 47: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,202 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3682#(<= 4 fibo1_~n)} #59#return; {3600#false} is VALID [2020-07-10 14:56:38,203 INFO L280 TraceCheckUtils]: 49: Hoare triple {3600#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3600#false} is VALID [2020-07-10 14:56:38,203 INFO L280 TraceCheckUtils]: 50: Hoare triple {3600#false} assume true; {3600#false} is VALID [2020-07-10 14:56:38,203 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {3600#false} {3603#(<= 4 main_~x~0)} #51#return; {3600#false} is VALID [2020-07-10 14:56:38,203 INFO L280 TraceCheckUtils]: 52: Hoare triple {3600#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {3600#false} is VALID [2020-07-10 14:56:38,203 INFO L280 TraceCheckUtils]: 53: Hoare triple {3600#false} assume 3 == ~result~0; {3600#false} is VALID [2020-07-10 14:56:38,204 INFO L280 TraceCheckUtils]: 54: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2020-07-10 14:56:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-10 14:56:38,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283947385] [2020-07-10 14:56:38,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498674953] [2020-07-10 14:56:38,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:56:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:38,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:38,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {3599#true} call ULTIMATE.init(); {3599#true} is VALID [2020-07-10 14:56:38,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,393 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3599#true} {3599#true} #47#return; {3599#true} is VALID [2020-07-10 14:56:38,393 INFO L263 TraceCheckUtils]: 3: Hoare triple {3599#true} call #t~ret5 := main(); {3599#true} is VALID [2020-07-10 14:56:38,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~x~0 := 4; {3603#(<= 4 main_~x~0)} is VALID [2020-07-10 14:56:38,394 INFO L263 TraceCheckUtils]: 5: Hoare triple {3603#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {3599#true} is VALID [2020-07-10 14:56:38,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {3599#true} ~n := #in~n; {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:38,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:38,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:38,395 INFO L263 TraceCheckUtils]: 9: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,396 INFO L280 TraceCheckUtils]: 10: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,396 INFO L280 TraceCheckUtils]: 11: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,396 INFO L280 TraceCheckUtils]: 12: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-10 14:56:38,396 INFO L263 TraceCheckUtils]: 13: Hoare triple {3599#true} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,397 INFO L280 TraceCheckUtils]: 16: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-10 14:56:38,397 INFO L263 TraceCheckUtils]: 17: Hoare triple {3599#true} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-10 14:56:38,397 INFO L280 TraceCheckUtils]: 18: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,397 INFO L280 TraceCheckUtils]: 19: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,397 INFO L280 TraceCheckUtils]: 20: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,398 INFO L280 TraceCheckUtils]: 21: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,398 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3599#true} {3599#true} #57#return; {3599#true} is VALID [2020-07-10 14:56:38,398 INFO L280 TraceCheckUtils]: 23: Hoare triple {3599#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3599#true} is VALID [2020-07-10 14:56:38,398 INFO L263 TraceCheckUtils]: 24: Hoare triple {3599#true} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-10 14:56:38,399 INFO L280 TraceCheckUtils]: 27: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,399 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3599#true} {3599#true} #59#return; {3599#true} is VALID [2020-07-10 14:56:38,399 INFO L280 TraceCheckUtils]: 29: Hoare triple {3599#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3599#true} is VALID [2020-07-10 14:56:38,399 INFO L280 TraceCheckUtils]: 30: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,400 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3599#true} {3599#true} #53#return; {3599#true} is VALID [2020-07-10 14:56:38,400 INFO L280 TraceCheckUtils]: 32: Hoare triple {3599#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3599#true} is VALID [2020-07-10 14:56:38,400 INFO L263 TraceCheckUtils]: 33: Hoare triple {3599#true} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,400 INFO L280 TraceCheckUtils]: 34: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-10 14:56:38,400 INFO L280 TraceCheckUtils]: 35: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-10 14:56:38,401 INFO L280 TraceCheckUtils]: 36: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-10 14:56:38,401 INFO L280 TraceCheckUtils]: 37: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,401 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3599#true} {3599#true} #55#return; {3599#true} is VALID [2020-07-10 14:56:38,401 INFO L280 TraceCheckUtils]: 39: Hoare triple {3599#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3599#true} is VALID [2020-07-10 14:56:38,401 INFO L280 TraceCheckUtils]: 40: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-10 14:56:38,403 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3599#true} {3747#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:38,404 INFO L280 TraceCheckUtils]: 42: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:56:38,404 INFO L263 TraceCheckUtils]: 43: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-10 14:56:38,404 INFO L280 TraceCheckUtils]: 44: Hoare triple {3599#true} ~n := #in~n; {3862#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:38,405 INFO L280 TraceCheckUtils]: 45: Hoare triple {3862#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {3862#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:56:38,406 INFO L280 TraceCheckUtils]: 46: Hoare triple {3862#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,406 INFO L280 TraceCheckUtils]: 47: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:38,407 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3747#(<= |fibo1_#in~n| fibo1_~n)} #59#return; {3875#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:38,408 INFO L280 TraceCheckUtils]: 49: Hoare triple {3875#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3875#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:38,408 INFO L280 TraceCheckUtils]: 50: Hoare triple {3875#(<= |fibo1_#in~n| 3)} assume true; {3875#(<= |fibo1_#in~n| 3)} is VALID [2020-07-10 14:56:38,410 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {3875#(<= |fibo1_#in~n| 3)} {3603#(<= 4 main_~x~0)} #51#return; {3600#false} is VALID [2020-07-10 14:56:38,410 INFO L280 TraceCheckUtils]: 52: Hoare triple {3600#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {3600#false} is VALID [2020-07-10 14:56:38,410 INFO L280 TraceCheckUtils]: 53: Hoare triple {3600#false} assume 3 == ~result~0; {3600#false} is VALID [2020-07-10 14:56:38,410 INFO L280 TraceCheckUtils]: 54: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2020-07-10 14:56:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-10 14:56:38,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:38,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2020-07-10 14:56:38,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075006007] [2020-07-10 14:56:38,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-10 14:56:38,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:38,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 14:56:38,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:38,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 14:56:38,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 14:56:38,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:56:38,510 INFO L87 Difference]: Start difference. First operand 142 states and 244 transitions. Second operand 13 states. [2020-07-10 14:56:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:40,008 INFO L93 Difference]: Finished difference Result 304 states and 583 transitions. [2020-07-10 14:56:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 14:56:40,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-10 14:56:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:56:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2020-07-10 14:56:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:56:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2020-07-10 14:56:40,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 125 transitions. [2020-07-10 14:56:40,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:40,191 INFO L225 Difference]: With dead ends: 304 [2020-07-10 14:56:40,192 INFO L226 Difference]: Without dead ends: 101 [2020-07-10 14:56:40,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-07-10 14:56:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-10 14:56:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2020-07-10 14:56:40,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:40,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 83 states. [2020-07-10 14:56:40,247 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 83 states. [2020-07-10 14:56:40,248 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 83 states. [2020-07-10 14:56:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:40,256 INFO L93 Difference]: Finished difference Result 101 states and 156 transitions. [2020-07-10 14:56:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-07-10 14:56:40,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:40,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:40,258 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 101 states. [2020-07-10 14:56:40,258 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 101 states. [2020-07-10 14:56:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:40,265 INFO L93 Difference]: Finished difference Result 101 states and 156 transitions. [2020-07-10 14:56:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-07-10 14:56:40,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:40,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:40,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:40,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-10 14:56:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2020-07-10 14:56:40,273 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 55 [2020-07-10 14:56:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:40,274 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2020-07-10 14:56:40,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 14:56:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2020-07-10 14:56:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-10 14:56:40,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:40,276 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 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-10 14:56:40,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:40,491 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1751947273, now seen corresponding path program 2 times [2020-07-10 14:56:40,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:40,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165210540] [2020-07-10 14:56:40,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,531 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4610#true} {4610#true} #47#return; {4610#true} is VALID [2020-07-10 14:56:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,644 INFO L280 TraceCheckUtils]: 3: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,645 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-10 14:56:40,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,652 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,654 INFO L280 TraceCheckUtils]: 2: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,654 INFO L263 TraceCheckUtils]: 3: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,658 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,658 INFO L280 TraceCheckUtils]: 9: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,659 INFO L263 TraceCheckUtils]: 10: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,659 INFO L280 TraceCheckUtils]: 11: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-10 14:56:40,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,660 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,661 INFO L280 TraceCheckUtils]: 15: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,661 INFO L280 TraceCheckUtils]: 16: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,662 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:40,668 INFO L280 TraceCheckUtils]: 3: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,669 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,671 INFO L263 TraceCheckUtils]: 3: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,673 INFO L263 TraceCheckUtils]: 7: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,677 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,677 INFO L280 TraceCheckUtils]: 13: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,677 INFO L263 TraceCheckUtils]: 14: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,678 INFO L280 TraceCheckUtils]: 16: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-10 14:56:40,678 INFO L280 TraceCheckUtils]: 17: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,679 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,679 INFO L280 TraceCheckUtils]: 19: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,680 INFO L280 TraceCheckUtils]: 20: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,681 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,682 INFO L263 TraceCheckUtils]: 23: Hoare triple {4746#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,682 INFO L280 TraceCheckUtils]: 24: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,682 INFO L280 TraceCheckUtils]: 25: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,683 INFO L280 TraceCheckUtils]: 26: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:40,683 INFO L280 TraceCheckUtils]: 27: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,684 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,684 INFO L280 TraceCheckUtils]: 29: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,685 INFO L280 TraceCheckUtils]: 30: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume true; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,686 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {4746#(<= |fibo2_#in~n| 3)} {4610#true} #57#return; {4707#(<= fibo1_~n 4)} is VALID [2020-07-10 14:56:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,731 INFO L280 TraceCheckUtils]: 3: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,732 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,754 INFO L280 TraceCheckUtils]: 3: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,755 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-10 14:56:40,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:40,756 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,758 INFO L280 TraceCheckUtils]: 7: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,759 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,759 INFO L280 TraceCheckUtils]: 9: Hoare triple {4769#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,760 INFO L263 TraceCheckUtils]: 10: Hoare triple {4769#(<= fibo2_~n 2)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,761 INFO L280 TraceCheckUtils]: 13: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,761 INFO L280 TraceCheckUtils]: 14: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,762 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-10 14:56:40,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {4611#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4611#false} is VALID [2020-07-10 14:56:40,762 INFO L280 TraceCheckUtils]: 17: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-10 14:56:40,763 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {4611#false} {4707#(<= fibo1_~n 4)} #59#return; {4611#false} is VALID [2020-07-10 14:56:40,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:40,763 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,765 INFO L263 TraceCheckUtils]: 7: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,766 INFO L280 TraceCheckUtils]: 10: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,766 INFO L263 TraceCheckUtils]: 11: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,766 INFO L280 TraceCheckUtils]: 12: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,767 INFO L280 TraceCheckUtils]: 13: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,767 INFO L280 TraceCheckUtils]: 14: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,767 INFO L280 TraceCheckUtils]: 15: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,768 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,769 INFO L280 TraceCheckUtils]: 17: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,769 INFO L263 TraceCheckUtils]: 18: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,769 INFO L280 TraceCheckUtils]: 19: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,769 INFO L280 TraceCheckUtils]: 20: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-10 14:56:40,769 INFO L280 TraceCheckUtils]: 21: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,770 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,770 INFO L280 TraceCheckUtils]: 23: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,771 INFO L280 TraceCheckUtils]: 24: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,771 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,772 INFO L280 TraceCheckUtils]: 26: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,772 INFO L263 TraceCheckUtils]: 27: Hoare triple {4746#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,772 INFO L280 TraceCheckUtils]: 28: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,772 INFO L280 TraceCheckUtils]: 29: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,772 INFO L280 TraceCheckUtils]: 30: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:40,773 INFO L280 TraceCheckUtils]: 31: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,773 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,774 INFO L280 TraceCheckUtils]: 33: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,775 INFO L280 TraceCheckUtils]: 34: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume true; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,776 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {4746#(<= |fibo2_#in~n| 3)} {4610#true} #57#return; {4707#(<= fibo1_~n 4)} is VALID [2020-07-10 14:56:40,777 INFO L280 TraceCheckUtils]: 36: Hoare triple {4707#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4707#(<= fibo1_~n 4)} is VALID [2020-07-10 14:56:40,777 INFO L263 TraceCheckUtils]: 37: Hoare triple {4707#(<= fibo1_~n 4)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,777 INFO L280 TraceCheckUtils]: 38: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,777 INFO L280 TraceCheckUtils]: 39: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,778 INFO L280 TraceCheckUtils]: 40: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:40,778 INFO L263 TraceCheckUtils]: 41: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,778 INFO L280 TraceCheckUtils]: 42: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,779 INFO L280 TraceCheckUtils]: 43: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,779 INFO L280 TraceCheckUtils]: 44: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,780 INFO L280 TraceCheckUtils]: 45: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,780 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,781 INFO L280 TraceCheckUtils]: 47: Hoare triple {4769#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,781 INFO L263 TraceCheckUtils]: 48: Hoare triple {4769#(<= fibo2_~n 2)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,781 INFO L280 TraceCheckUtils]: 49: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,782 INFO L280 TraceCheckUtils]: 50: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,782 INFO L280 TraceCheckUtils]: 51: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,783 INFO L280 TraceCheckUtils]: 52: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,783 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-10 14:56:40,784 INFO L280 TraceCheckUtils]: 54: Hoare triple {4611#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4611#false} is VALID [2020-07-10 14:56:40,784 INFO L280 TraceCheckUtils]: 55: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-10 14:56:40,784 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4611#false} {4707#(<= fibo1_~n 4)} #59#return; {4611#false} is VALID [2020-07-10 14:56:40,784 INFO L280 TraceCheckUtils]: 57: Hoare triple {4611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4611#false} is VALID [2020-07-10 14:56:40,784 INFO L280 TraceCheckUtils]: 58: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-10 14:56:40,785 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {4611#false} {4614#(<= main_~x~0 4)} #51#return; {4611#false} is VALID [2020-07-10 14:56:40,787 INFO L263 TraceCheckUtils]: 0: Hoare triple {4610#true} call ULTIMATE.init(); {4610#true} is VALID [2020-07-10 14:56:40,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,788 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4610#true} {4610#true} #47#return; {4610#true} is VALID [2020-07-10 14:56:40,788 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret5 := main(); {4610#true} is VALID [2020-07-10 14:56:40,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~x~0 := 4; {4614#(<= main_~x~0 4)} is VALID [2020-07-10 14:56:40,794 INFO L263 TraceCheckUtils]: 5: Hoare triple {4614#(<= main_~x~0 4)} call #t~ret4 := fibo1(~x~0); {4610#true} is VALID [2020-07-10 14:56:40,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,794 INFO L280 TraceCheckUtils]: 7: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:40,795 INFO L263 TraceCheckUtils]: 9: Hoare triple {4610#true} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,795 INFO L280 TraceCheckUtils]: 10: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,797 INFO L263 TraceCheckUtils]: 13: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,798 INFO L263 TraceCheckUtils]: 17: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,799 INFO L280 TraceCheckUtils]: 18: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:40,800 INFO L280 TraceCheckUtils]: 20: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,800 INFO L280 TraceCheckUtils]: 21: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:56:40,801 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,802 INFO L280 TraceCheckUtils]: 23: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,802 INFO L263 TraceCheckUtils]: 24: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,802 INFO L280 TraceCheckUtils]: 25: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,803 INFO L280 TraceCheckUtils]: 26: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-10 14:56:40,803 INFO L280 TraceCheckUtils]: 27: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,804 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,804 INFO L280 TraceCheckUtils]: 29: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,805 INFO L280 TraceCheckUtils]: 30: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-10 14:56:40,806 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,806 INFO L280 TraceCheckUtils]: 32: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,806 INFO L263 TraceCheckUtils]: 33: Hoare triple {4746#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,807 INFO L280 TraceCheckUtils]: 35: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,807 INFO L280 TraceCheckUtils]: 36: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:40,807 INFO L280 TraceCheckUtils]: 37: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:40,813 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,813 INFO L280 TraceCheckUtils]: 39: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,814 INFO L280 TraceCheckUtils]: 40: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume true; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-10 14:56:40,815 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4746#(<= |fibo2_#in~n| 3)} {4610#true} #57#return; {4707#(<= fibo1_~n 4)} is VALID [2020-07-10 14:56:40,815 INFO L280 TraceCheckUtils]: 42: Hoare triple {4707#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4707#(<= fibo1_~n 4)} is VALID [2020-07-10 14:56:40,816 INFO L263 TraceCheckUtils]: 43: Hoare triple {4707#(<= fibo1_~n 4)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,816 INFO L280 TraceCheckUtils]: 44: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:40,816 INFO L280 TraceCheckUtils]: 45: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:40,816 INFO L280 TraceCheckUtils]: 46: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:40,816 INFO L263 TraceCheckUtils]: 47: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:40,817 INFO L280 TraceCheckUtils]: 48: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,817 INFO L280 TraceCheckUtils]: 49: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,818 INFO L280 TraceCheckUtils]: 50: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,818 INFO L280 TraceCheckUtils]: 51: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:56:40,819 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,820 INFO L280 TraceCheckUtils]: 53: Hoare triple {4769#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4769#(<= fibo2_~n 2)} is VALID [2020-07-10 14:56:40,820 INFO L263 TraceCheckUtils]: 54: Hoare triple {4769#(<= fibo2_~n 2)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:40,821 INFO L280 TraceCheckUtils]: 55: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,821 INFO L280 TraceCheckUtils]: 56: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,822 INFO L280 TraceCheckUtils]: 57: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,822 INFO L280 TraceCheckUtils]: 58: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:40,823 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-10 14:56:40,823 INFO L280 TraceCheckUtils]: 60: Hoare triple {4611#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4611#false} is VALID [2020-07-10 14:56:40,824 INFO L280 TraceCheckUtils]: 61: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-10 14:56:40,824 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4611#false} {4707#(<= fibo1_~n 4)} #59#return; {4611#false} is VALID [2020-07-10 14:56:40,824 INFO L280 TraceCheckUtils]: 63: Hoare triple {4611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4611#false} is VALID [2020-07-10 14:56:40,824 INFO L280 TraceCheckUtils]: 64: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-10 14:56:40,824 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4611#false} {4614#(<= main_~x~0 4)} #51#return; {4611#false} is VALID [2020-07-10 14:56:40,825 INFO L280 TraceCheckUtils]: 66: Hoare triple {4611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {4611#false} is VALID [2020-07-10 14:56:40,825 INFO L280 TraceCheckUtils]: 67: Hoare triple {4611#false} assume 3 == ~result~0; {4611#false} is VALID [2020-07-10 14:56:40,825 INFO L280 TraceCheckUtils]: 68: Hoare triple {4611#false} assume !false; {4611#false} is VALID [2020-07-10 14:56:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-10 14:56:40,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165210540] [2020-07-10 14:56:40,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391385164] [2020-07-10 14:56:40,830 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:40,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:56:40,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:56:40,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:56:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:56:40,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:56:41,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {4610#true} call ULTIMATE.init(); {4610#true} is VALID [2020-07-10 14:56:41,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4610#true} {4610#true} #47#return; {4610#true} is VALID [2020-07-10 14:56:41,069 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret5 := main(); {4610#true} is VALID [2020-07-10 14:56:41,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~x~0 := 4; {4614#(<= main_~x~0 4)} is VALID [2020-07-10 14:56:41,070 INFO L263 TraceCheckUtils]: 5: Hoare triple {4614#(<= main_~x~0 4)} call #t~ret4 := fibo1(~x~0); {4610#true} is VALID [2020-07-10 14:56:41,071 INFO L280 TraceCheckUtils]: 6: Hoare triple {4610#true} ~n := #in~n; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,072 INFO L280 TraceCheckUtils]: 8: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,072 INFO L263 TraceCheckUtils]: 9: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:41,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:41,072 INFO L280 TraceCheckUtils]: 11: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:41,073 INFO L280 TraceCheckUtils]: 12: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:41,073 INFO L263 TraceCheckUtils]: 13: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:41,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:41,073 INFO L280 TraceCheckUtils]: 15: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:41,073 INFO L280 TraceCheckUtils]: 16: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-10 14:56:41,074 INFO L263 TraceCheckUtils]: 17: Hoare triple {4610#true} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-10 14:56:41,074 INFO L280 TraceCheckUtils]: 18: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:41,074 INFO L280 TraceCheckUtils]: 19: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:41,074 INFO L280 TraceCheckUtils]: 20: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:41,074 INFO L280 TraceCheckUtils]: 21: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,075 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4610#true} {4610#true} #57#return; {4610#true} is VALID [2020-07-10 14:56:41,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {4610#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4610#true} is VALID [2020-07-10 14:56:41,075 INFO L263 TraceCheckUtils]: 24: Hoare triple {4610#true} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:41,075 INFO L280 TraceCheckUtils]: 25: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:41,076 INFO L280 TraceCheckUtils]: 26: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-10 14:56:41,076 INFO L280 TraceCheckUtils]: 27: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,076 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4610#true} {4610#true} #59#return; {4610#true} is VALID [2020-07-10 14:56:41,076 INFO L280 TraceCheckUtils]: 29: Hoare triple {4610#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4610#true} is VALID [2020-07-10 14:56:41,076 INFO L280 TraceCheckUtils]: 30: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,077 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {4610#true} {4610#true} #53#return; {4610#true} is VALID [2020-07-10 14:56:41,077 INFO L280 TraceCheckUtils]: 32: Hoare triple {4610#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4610#true} is VALID [2020-07-10 14:56:41,077 INFO L263 TraceCheckUtils]: 33: Hoare triple {4610#true} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:41,077 INFO L280 TraceCheckUtils]: 34: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:41,077 INFO L280 TraceCheckUtils]: 35: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:41,077 INFO L280 TraceCheckUtils]: 36: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:41,078 INFO L280 TraceCheckUtils]: 37: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,078 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4610#true} {4610#true} #55#return; {4610#true} is VALID [2020-07-10 14:56:41,078 INFO L280 TraceCheckUtils]: 39: Hoare triple {4610#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4610#true} is VALID [2020-07-10 14:56:41,078 INFO L280 TraceCheckUtils]: 40: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,080 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4610#true} {4798#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,080 INFO L280 TraceCheckUtils]: 42: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,081 INFO L263 TraceCheckUtils]: 43: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-10 14:56:41,081 INFO L280 TraceCheckUtils]: 44: Hoare triple {4610#true} ~n := #in~n; {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,082 INFO L280 TraceCheckUtils]: 45: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,082 INFO L280 TraceCheckUtils]: 46: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,082 INFO L263 TraceCheckUtils]: 47: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-10 14:56:41,083 INFO L280 TraceCheckUtils]: 48: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-10 14:56:41,083 INFO L280 TraceCheckUtils]: 49: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-10 14:56:41,083 INFO L280 TraceCheckUtils]: 50: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-10 14:56:41,083 INFO L280 TraceCheckUtils]: 51: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-10 14:56:41,084 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4610#true} {4913#(<= fibo2_~n |fibo2_#in~n|)} #53#return; {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,085 INFO L280 TraceCheckUtils]: 53: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,085 INFO L263 TraceCheckUtils]: 54: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-10 14:56:41,085 INFO L280 TraceCheckUtils]: 55: Hoare triple {4610#true} ~n := #in~n; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,086 INFO L280 TraceCheckUtils]: 56: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,087 INFO L280 TraceCheckUtils]: 57: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,087 INFO L280 TraceCheckUtils]: 58: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,088 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4913#(<= fibo2_~n |fibo2_#in~n|)} #55#return; {4959#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,089 INFO L280 TraceCheckUtils]: 60: Hoare triple {4959#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4959#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,089 INFO L280 TraceCheckUtils]: 61: Hoare triple {4959#(<= 3 |fibo2_#in~n|)} assume true; {4959#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-10 14:56:41,091 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4959#(<= 3 |fibo2_#in~n|)} {4798#(<= fibo1_~n |fibo1_#in~n|)} #59#return; {4969#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,091 INFO L280 TraceCheckUtils]: 63: Hoare triple {4969#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4969#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,092 INFO L280 TraceCheckUtils]: 64: Hoare triple {4969#(<= 5 |fibo1_#in~n|)} assume true; {4969#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-10 14:56:41,093 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4969#(<= 5 |fibo1_#in~n|)} {4614#(<= main_~x~0 4)} #51#return; {4611#false} is VALID [2020-07-10 14:56:41,093 INFO L280 TraceCheckUtils]: 66: Hoare triple {4611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {4611#false} is VALID [2020-07-10 14:56:41,093 INFO L280 TraceCheckUtils]: 67: Hoare triple {4611#false} assume 3 == ~result~0; {4611#false} is VALID [2020-07-10 14:56:41,093 INFO L280 TraceCheckUtils]: 68: Hoare triple {4611#false} assume !false; {4611#false} is VALID [2020-07-10 14:56:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-07-10 14:56:41,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:56:41,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2020-07-10 14:56:41,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323923643] [2020-07-10 14:56:41,102 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-10 14:56:41,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:56:41,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 14:56:41,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:41,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 14:56:41,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:56:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 14:56:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-10 14:56:41,207 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 16 states. [2020-07-10 14:56:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:43,052 INFO L93 Difference]: Finished difference Result 174 states and 293 transitions. [2020-07-10 14:56:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 14:56:43,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-10 14:56:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:56:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 14:56:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 147 transitions. [2020-07-10 14:56:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 14:56:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 147 transitions. [2020-07-10 14:56:43,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 147 transitions. [2020-07-10 14:56:43,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:56:43,270 INFO L225 Difference]: With dead ends: 174 [2020-07-10 14:56:43,271 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 14:56:43,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2020-07-10 14:56:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 14:56:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2020-07-10 14:56:43,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:56:43,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 80 states. [2020-07-10 14:56:43,312 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 80 states. [2020-07-10 14:56:43,312 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 80 states. [2020-07-10 14:56:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:43,317 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-10 14:56:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-10 14:56:43,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:43,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:43,318 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 89 states. [2020-07-10 14:56:43,318 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 89 states. [2020-07-10 14:56:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:56:43,322 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-10 14:56:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-10 14:56:43,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:56:43,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:56:43,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:56:43,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:56:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 14:56:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2020-07-10 14:56:43,327 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 69 [2020-07-10 14:56:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:56:43,327 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2020-07-10 14:56:43,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 14:56:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2020-07-10 14:56:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-10 14:56:43,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:56:43,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:56:43,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:56:43,543 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:56:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:56:43,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1156896337, now seen corresponding path program 1 times [2020-07-10 14:56:43,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:56:43,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688310210] [2020-07-10 14:56:43,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:56:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:56:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:56:43,582 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:56:43,582 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:56:43,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation [2020-07-10 14:56:43,622 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:56:43,623 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-10 14:56:43,624 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:56:43,625 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 14:56:43,626 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 14:56:43,627 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:56:43,627 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-10 14:56:43,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:56:43 BoogieIcfgContainer [2020-07-10 14:56:43,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:56:43,634 INFO L168 Benchmark]: Toolchain (without parser) took 18855.78 ms. Allocated memory was 138.9 MB in the beginning and 380.6 MB in the end (delta: 241.7 MB). Free memory was 103.9 MB in the beginning and 275.8 MB in the end (delta: -171.9 MB). Peak memory consumption was 69.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:56:43,640 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:56:43,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.54 ms. Allocated memory is still 138.9 MB. Free memory was 103.7 MB in the beginning and 93.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:56:43,642 INFO L168 Benchmark]: Boogie Preprocessor took 134.20 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.9 MB in the beginning and 182.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:56:43,642 INFO L168 Benchmark]: RCFGBuilder took 392.57 ms. Allocated memory is still 203.4 MB. Free memory was 182.0 MB in the beginning and 163.0 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:56:43,643 INFO L168 Benchmark]: TraceAbstraction took 18056.37 ms. Allocated memory was 203.4 MB in the beginning and 380.6 MB in the end (delta: 177.2 MB). Free memory was 162.3 MB in the beginning and 275.8 MB in the end (delta: -113.5 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:56:43,650 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.54 ms. Allocated memory is still 138.9 MB. Free memory was 103.7 MB in the beginning and 93.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.20 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.9 MB in the beginning and 182.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.57 ms. Allocated memory is still 203.4 MB. Free memory was 182.0 MB in the beginning and 163.0 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18056.37 ms. Allocated memory was 203.4 MB in the beginning and 380.6 MB in the end (delta: 177.2 MB). Free memory was 162.3 MB in the beginning and 275.8 MB in the end (delta: -113.5 MB). Peak memory consumption was 63.7 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 [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 [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); [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 [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); [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 [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 [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); [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); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=3, x=4] [L37] int result = fibo1(x); [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, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 337 SDslu, 1423 SDs, 0 SdLazy, 1903 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 70 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 52071 SizeOfPredicates, 25 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 330/432 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...