/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/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:06:54,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:06:54,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:06:54,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:06:54,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:06:54,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:06:54,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:06:54,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:06:54,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:06:54,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:06:54,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:06:54,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:06:54,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:06:54,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:06:54,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:06:54,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:06:54,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:06:54,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:06:54,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:06:54,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:06:54,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:06:54,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:06:54,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:06:54,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:06:54,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:06:54,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:06:54,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:06:54,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:06:54,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:06:54,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:06:54,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:06:54,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:06:54,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:06:54,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:06:54,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:06:54,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:06:54,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:06:54,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:06:54,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:06:54,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:06:54,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:06:54,714 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-17 22:06:54,734 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:06:54,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:06:54,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:06:54,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:06:54,737 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:06:54,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:06:54,737 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:06:54,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:06:54,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:06:54,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:06:54,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:06:54,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:06:54,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:06:54,740 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:06:54,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:06:54,740 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:06:54,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:06:54,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:06:54,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:06:54,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:06:54,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:06:54,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:06:54,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:06:54,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:06:54,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:06:54,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:06:54,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:06:54,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:06:54,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:06:54,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:06:55,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:06:55,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:06:55,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:06:55,037 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:06:55,037 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:06:55,039 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-17 22:06:55,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cff0e4b3/4dac0ad52cbd4551a03dfc6b90f742d7/FLAG5a5e73287 [2020-07-17 22:06:55,593 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:06:55,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-17 22:06:55,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cff0e4b3/4dac0ad52cbd4551a03dfc6b90f742d7/FLAG5a5e73287 [2020-07-17 22:06:56,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cff0e4b3/4dac0ad52cbd4551a03dfc6b90f742d7 [2020-07-17 22:06:56,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:06:56,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:06:56,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:56,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:06:56,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:06:56,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786be218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56, skipping insertion in model container [2020-07-17 22:06:56,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:06:56,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:06:56,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:56,303 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:06:56,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:56,333 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:06:56,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56 WrapperNode [2020-07-17 22:06:56,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:56,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:06:56,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:06:56,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:06:56,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (1/1) ... [2020-07-17 22:06:56,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:06:56,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:06:56,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:06:56,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:06:56,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (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-17 22:06:56,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:06:56,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:06:56,506 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-17 22:06:56,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:06:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:06:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:06:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-17 22:06:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:06:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:06:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:06:56,841 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:06:56,841 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:06:56,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:56 BoogieIcfgContainer [2020-07-17 22:06:56,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:06:56,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:06:56,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:06:56,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:06:56,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:06:56" (1/3) ... [2020-07-17 22:06:56,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39071a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:56, skipping insertion in model container [2020-07-17 22:06:56,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:56" (2/3) ... [2020-07-17 22:06:56,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39071a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:56, skipping insertion in model container [2020-07-17 22:06:56,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:56" (3/3) ... [2020-07-17 22:06:56,858 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-07-17 22:06:56,868 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:06:56,875 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:06:56,886 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:06:56,908 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:06:56,909 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:06:56,909 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:06:56,909 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:06:56,909 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:06:56,909 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:06:56,910 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:06:56,910 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:06:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-17 22:06:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:06:56,934 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:56,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:56,935 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:56,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2020-07-17 22:06:56,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:56,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500949921] [2020-07-17 22:06:56,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:57,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-17 22:06:57,168 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #38#return; {27#true} is VALID [2020-07-17 22:06:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:57,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} ~n := #in~n; {37#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:57,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:57,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:57,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} {27#true} #42#return; {35#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-17 22:06:57,244 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-17 22:06:57,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-17 22:06:57,245 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #38#return; {27#true} is VALID [2020-07-17 22:06:57,245 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2020-07-17 22:06:57,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {27#true} is VALID [2020-07-17 22:06:57,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {27#true} is VALID [2020-07-17 22:06:57,246 INFO L263 TraceCheckUtils]: 6: Hoare triple {27#true} call #t~ret3 := fibonacci(~x~0); {27#true} is VALID [2020-07-17 22:06:57,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} ~n := #in~n; {37#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:57,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:57,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:57,252 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} {27#true} #42#return; {35#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-17 22:06:57,254 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#(<= main_~x~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {36#(<= main_~x~0 main_~result~0)} is VALID [2020-07-17 22:06:57,256 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#(<= main_~x~0 main_~result~0)} assume !(~result~0 >= ~x~0 - 1); {28#false} is VALID [2020-07-17 22:06:57,256 INFO L280 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-17 22:06:57,258 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-17 22:06:57,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500949921] [2020-07-17 22:06:57,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:57,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:06:57,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795478814] [2020-07-17 22:06:57,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-17 22:06:57,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:57,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:57,307 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-17 22:06:57,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:57,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:57,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:57,320 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2020-07-17 22:06:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:57,666 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-17 22:06:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:06:57,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-17 22:06:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-17 22:06:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-17 22:06:57,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-17 22:06:57,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:57,775 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:06:57,776 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:06:57,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:06:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:06:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-17 22:06:57,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:57,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-17 22:06:57,827 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:06:57,827 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:06:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:57,833 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-17 22:06:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:06:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:57,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:57,835 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:06:57,835 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:06:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:57,840 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-17 22:06:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:06:57,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:57,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:57,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:57,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:06:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-17 22:06:57,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2020-07-17 22:06:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:57,847 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-17 22:06:57,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-17 22:06:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:06:57,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:57,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:57,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:06:57,850 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2020-07-17 22:06:57,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:57,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924090575] [2020-07-17 22:06:57,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:57,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-17 22:06:57,901 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-17 22:06:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:58,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:58,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {192#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:06:58,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:06:58,022 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-17 22:06:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:58,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-17 22:06:58,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-17 22:06:58,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-17 22:06:58,030 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-17 22:06:58,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-17 22:06:58,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume !(~n < 1); {182#(< 0 fibonacci_~n)} is VALID [2020-07-17 22:06:58,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {182#(< 0 fibonacci_~n)} assume !(1 == ~n); {183#(< 1 fibonacci_~n)} is VALID [2020-07-17 22:06:58,033 INFO L263 TraceCheckUtils]: 3: Hoare triple {183#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-17 22:06:58,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:58,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {192#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:06:58,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:06:58,037 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-17 22:06:58,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {162#false} is VALID [2020-07-17 22:06:58,038 INFO L263 TraceCheckUtils]: 9: Hoare triple {162#false} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-17 22:06:58,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-17 22:06:58,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-17 22:06:58,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-17 22:06:58,039 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-17 22:06:58,039 INFO L280 TraceCheckUtils]: 14: Hoare triple {162#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {162#false} is VALID [2020-07-17 22:06:58,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#false} assume true; {162#false} is VALID [2020-07-17 22:06:58,040 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {162#false} {161#true} #42#return; {162#false} is VALID [2020-07-17 22:06:58,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2020-07-17 22:06:58,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-17 22:06:58,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-17 22:06:58,043 INFO L263 TraceCheckUtils]: 3: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2020-07-17 22:06:58,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2020-07-17 22:06:58,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {161#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {161#true} is VALID [2020-07-17 22:06:58,044 INFO L263 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret3 := fibonacci(~x~0); {161#true} is VALID [2020-07-17 22:06:58,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-17 22:06:58,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {161#true} assume !(~n < 1); {182#(< 0 fibonacci_~n)} is VALID [2020-07-17 22:06:58,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(< 0 fibonacci_~n)} assume !(1 == ~n); {183#(< 1 fibonacci_~n)} is VALID [2020-07-17 22:06:58,047 INFO L263 TraceCheckUtils]: 10: Hoare triple {183#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-17 22:06:58,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:58,048 INFO L280 TraceCheckUtils]: 12: Hoare triple {192#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:06:58,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:06:58,050 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-17 22:06:58,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {162#false} is VALID [2020-07-17 22:06:58,051 INFO L263 TraceCheckUtils]: 16: Hoare triple {162#false} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-17 22:06:58,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-17 22:06:58,052 INFO L280 TraceCheckUtils]: 18: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-17 22:06:58,052 INFO L280 TraceCheckUtils]: 19: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-17 22:06:58,052 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-17 22:06:58,053 INFO L280 TraceCheckUtils]: 21: Hoare triple {162#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {162#false} is VALID [2020-07-17 22:06:58,053 INFO L280 TraceCheckUtils]: 22: Hoare triple {162#false} assume true; {162#false} is VALID [2020-07-17 22:06:58,053 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {162#false} {161#true} #42#return; {162#false} is VALID [2020-07-17 22:06:58,053 INFO L280 TraceCheckUtils]: 24: Hoare triple {162#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {162#false} is VALID [2020-07-17 22:06:58,054 INFO L280 TraceCheckUtils]: 25: Hoare triple {162#false} assume !(~result~0 >= ~x~0 - 1); {162#false} is VALID [2020-07-17 22:06:58,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {162#false} assume !false; {162#false} is VALID [2020-07-17 22:06:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:06:58,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924090575] [2020-07-17 22:06:58,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952612107] [2020-07-17 22:06:58,057 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-17 22:06:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:58,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:06:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:58,108 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:58,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2020-07-17 22:06:58,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-17 22:06:58,401 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-17 22:06:58,402 INFO L263 TraceCheckUtils]: 3: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2020-07-17 22:06:58,402 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2020-07-17 22:06:58,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {161#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {161#true} is VALID [2020-07-17 22:06:58,403 INFO L263 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret3 := fibonacci(~x~0); {161#true} is VALID [2020-07-17 22:06:58,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#true} ~n := #in~n; {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:58,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:58,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:58,406 INFO L263 TraceCheckUtils]: 10: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-17 22:06:58,407 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} ~n := #in~n; {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:58,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} is VALID [2020-07-17 22:06:58,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} assume true; {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} is VALID [2020-07-17 22:06:58,411 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} {218#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:06:58,412 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:06:58,413 INFO L263 TraceCheckUtils]: 16: Hoare triple {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-17 22:06:58,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-17 22:06:58,414 INFO L280 TraceCheckUtils]: 18: Hoare triple {161#true} assume ~n < 1;#res := 0; {254#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:58,415 INFO L280 TraceCheckUtils]: 19: Hoare triple {254#(<= 0 |fibonacci_#res|)} assume true; {254#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:58,416 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {254#(<= 0 |fibonacci_#res|)} {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} #36#return; {261#(and (<= 0 |fibonacci_#t~ret1|) (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:06:58,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {261#(and (<= 0 |fibonacci_#t~ret1|) (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2020-07-17 22:06:58,418 INFO L280 TraceCheckUtils]: 22: Hoare triple {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} assume true; {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2020-07-17 22:06:58,420 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} {161#true} #42#return; {272#(and (<= 0 |main_#t~ret3|) (<= main_~x~0 1))} is VALID [2020-07-17 22:06:58,421 INFO L280 TraceCheckUtils]: 24: Hoare triple {272#(and (<= 0 |main_#t~ret3|) (<= main_~x~0 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {276#(and (<= 0 main_~result~0) (<= main_~x~0 1))} is VALID [2020-07-17 22:06:58,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {276#(and (<= 0 main_~result~0) (<= main_~x~0 1))} assume !(~result~0 >= ~x~0 - 1); {162#false} is VALID [2020-07-17 22:06:58,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {162#false} assume !false; {162#false} is VALID [2020-07-17 22:06:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:06:58,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:58,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2020-07-17 22:06:58,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000762659] [2020-07-17 22:06:58,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-17 22:06:58,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:58,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:06:58,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:58,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:06:58,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:06:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:06:58,487 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2020-07-17 22:06:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:59,081 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-17 22:06:59,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:06:59,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-17 22:06:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:06:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-17 22:06:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:06:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-17 22:06:59,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-17 22:06:59,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:59,166 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:06:59,166 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:06:59,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:06:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:06:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-17 22:06:59,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:59,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-17 22:06:59,185 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:06:59,186 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:06:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:59,189 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-17 22:06:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-17 22:06:59,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:59,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:59,190 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-17 22:06:59,191 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-17 22:06:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:59,194 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-17 22:06:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-17 22:06:59,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:59,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:59,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:59,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:06:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-17 22:06:59,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2020-07-17 22:06:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:59,200 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-17 22:06:59,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:06:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-17 22:06:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:06:59,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:59,202 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:59,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:06:59,418 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2020-07-17 22:06:59,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:59,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148983848] [2020-07-17 22:06:59,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-17 22:06:59,477 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-17 22:06:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,579 INFO L280 TraceCheckUtils]: 3: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,581 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-17 22:06:59,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,607 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,609 INFO L263 TraceCheckUtils]: 3: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-17 22:06:59,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,610 INFO L280 TraceCheckUtils]: 5: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,611 INFO L280 TraceCheckUtils]: 6: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,613 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,615 INFO L263 TraceCheckUtils]: 10: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-17 22:06:59,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-17 22:06:59,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,623 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,624 INFO L280 TraceCheckUtils]: 15: Hoare triple {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:06:59,626 INFO L280 TraceCheckUtils]: 16: Hoare triple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:06:59,628 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {422#true} #42#return; {444#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-17 22:06:59,629 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-17 22:06:59,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-17 22:06:59,630 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-17 22:06:59,630 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-17 22:06:59,630 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {422#true} is VALID [2020-07-17 22:06:59,630 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {422#true} is VALID [2020-07-17 22:06:59,631 INFO L263 TraceCheckUtils]: 6: Hoare triple {422#true} call #t~ret3 := fibonacci(~x~0); {422#true} is VALID [2020-07-17 22:06:59,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,632 INFO L280 TraceCheckUtils]: 8: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,633 INFO L263 TraceCheckUtils]: 10: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-17 22:06:59,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:06:59,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,637 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,638 INFO L263 TraceCheckUtils]: 17: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-17 22:06:59,639 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-17 22:06:59,639 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,640 INFO L280 TraceCheckUtils]: 20: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:06:59,642 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:06:59,643 INFO L280 TraceCheckUtils]: 22: Hoare triple {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:06:59,643 INFO L280 TraceCheckUtils]: 23: Hoare triple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:06:59,644 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {422#true} #42#return; {444#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-17 22:06:59,645 INFO L280 TraceCheckUtils]: 25: Hoare triple {444#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {445#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-17 22:06:59,646 INFO L280 TraceCheckUtils]: 26: Hoare triple {445#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {423#false} is VALID [2020-07-17 22:06:59,646 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-17 22:06:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:06:59,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148983848] [2020-07-17 22:06:59,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948303540] [2020-07-17 22:06:59,649 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) [2020-07-17 22:06:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:59,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:59,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-17 22:06:59,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-17 22:06:59,989 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-17 22:06:59,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-17 22:06:59,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {422#true} is VALID [2020-07-17 22:06:59,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {422#true} is VALID [2020-07-17 22:06:59,991 INFO L263 TraceCheckUtils]: 6: Hoare triple {422#true} call #t~ret3 := fibonacci(~x~0); {422#true} is VALID [2020-07-17 22:06:59,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} ~n := #in~n; {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:59,993 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:59,994 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:59,994 INFO L263 TraceCheckUtils]: 10: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-17 22:06:59,995 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:59,995 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:06:59,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:06:59,997 INFO L280 TraceCheckUtils]: 14: Hoare triple {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:06:59,998 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {485#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-17 22:06:59,999 INFO L280 TraceCheckUtils]: 16: Hoare triple {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-17 22:06:59,999 INFO L263 TraceCheckUtils]: 17: Hoare triple {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-17 22:07:00,000 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-17 22:07:00,001 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:00,001 INFO L280 TraceCheckUtils]: 20: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:00,002 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} #36#return; {530#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-17 22:07:00,004 INFO L280 TraceCheckUtils]: 22: Hoare triple {530#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-17 22:07:00,006 INFO L280 TraceCheckUtils]: 23: Hoare triple {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} assume true; {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-17 22:07:00,007 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} {422#true} #42#return; {541#(and (<= 1 |main_#t~ret3|) (<= main_~x~0 2))} is VALID [2020-07-17 22:07:00,008 INFO L280 TraceCheckUtils]: 25: Hoare triple {541#(and (<= 1 |main_#t~ret3|) (<= main_~x~0 2))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {545#(and (<= 1 main_~result~0) (<= main_~x~0 2))} is VALID [2020-07-17 22:07:00,009 INFO L280 TraceCheckUtils]: 26: Hoare triple {545#(and (<= 1 main_~result~0) (<= main_~x~0 2))} assume !(~result~0 >= ~x~0 - 1); {423#false} is VALID [2020-07-17 22:07:00,009 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-17 22:07:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:07:00,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:00,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-07-17 22:07:00,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679896937] [2020-07-17 22:07:00,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-17 22:07:00,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:00,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-17 22:07:00,069 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-17 22:07:00,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 22:07:00,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 22:07:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:07:00,071 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 17 states. [2020-07-17 22:07:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:00,750 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-17 22:07:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:07:00,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-17 22:07:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:07:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-17 22:07:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:07:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-17 22:07:00,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-17 22:07:00,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:00,818 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:07:00,818 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:07:00,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-07-17 22:07:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:07:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-17 22:07:00,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:00,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-17 22:07:00,832 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-17 22:07:00,832 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-17 22:07:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:00,836 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-17 22:07:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-17 22:07:00,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:00,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:00,837 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-17 22:07:00,837 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-17 22:07:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:00,841 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-17 22:07:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-17 22:07:00,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:00,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:00,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:00,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:07:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-17 22:07:00,846 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2020-07-17 22:07:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:00,847 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-17 22:07:00,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 22:07:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-07-17 22:07:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 22:07:00,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:00,849 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:01,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:01,064 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2020-07-17 22:07:01,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:01,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651597962] [2020-07-17 22:07:01,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,119 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-17 22:07:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-17 22:07:01,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,208 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-17 22:07:01,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,215 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-17 22:07:01,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,218 INFO L263 TraceCheckUtils]: 3: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-17 22:07:01,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,220 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,221 INFO L263 TraceCheckUtils]: 10: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,221 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,221 INFO L280 TraceCheckUtils]: 12: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-17 22:07:01,221 INFO L280 TraceCheckUtils]: 13: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,222 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,223 INFO L280 TraceCheckUtils]: 15: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,224 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,246 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-17 22:07:01,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-17 22:07:01,247 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-17 22:07:01,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,248 INFO L263 TraceCheckUtils]: 7: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-17 22:07:01,249 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,253 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,255 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,255 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-17 22:07:01,255 INFO L280 TraceCheckUtils]: 17: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,257 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,258 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,262 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,264 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,264 INFO L280 TraceCheckUtils]: 22: Hoare triple {755#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,265 INFO L263 TraceCheckUtils]: 23: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,266 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,267 INFO L280 TraceCheckUtils]: 25: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,268 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,269 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-17 22:07:01,270 INFO L280 TraceCheckUtils]: 28: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {703#false} is VALID [2020-07-17 22:07:01,270 INFO L280 TraceCheckUtils]: 29: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-17 22:07:01,270 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-17 22:07:01,271 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-17 22:07:01,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-17 22:07:01,272 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret4 := main(); {702#true} is VALID [2020-07-17 22:07:01,272 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {702#true} is VALID [2020-07-17 22:07:01,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {702#true} is VALID [2020-07-17 22:07:01,273 INFO L263 TraceCheckUtils]: 6: Hoare triple {702#true} call #t~ret3 := fibonacci(~x~0); {702#true} is VALID [2020-07-17 22:07:01,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,274 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-17 22:07:01,274 INFO L263 TraceCheckUtils]: 10: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-17 22:07:01,276 INFO L280 TraceCheckUtils]: 13: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,277 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,277 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,277 INFO L280 TraceCheckUtils]: 16: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,277 INFO L280 TraceCheckUtils]: 17: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-17 22:07:01,278 INFO L280 TraceCheckUtils]: 18: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,279 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,279 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,279 INFO L263 TraceCheckUtils]: 21: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,280 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,280 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-17 22:07:01,280 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,281 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,282 INFO L280 TraceCheckUtils]: 26: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,282 INFO L280 TraceCheckUtils]: 27: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,284 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,284 INFO L280 TraceCheckUtils]: 29: Hoare triple {755#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,284 INFO L263 TraceCheckUtils]: 30: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,285 INFO L280 TraceCheckUtils]: 31: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,286 INFO L280 TraceCheckUtils]: 32: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,286 INFO L280 TraceCheckUtils]: 33: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,288 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-17 22:07:01,288 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {703#false} is VALID [2020-07-17 22:07:01,288 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-17 22:07:01,288 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-17 22:07:01,288 INFO L280 TraceCheckUtils]: 38: Hoare triple {703#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {703#false} is VALID [2020-07-17 22:07:01,289 INFO L280 TraceCheckUtils]: 39: Hoare triple {703#false} assume !(~result~0 >= ~x~0 - 1); {703#false} is VALID [2020-07-17 22:07:01,289 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-17 22:07:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 22:07:01,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651597962] [2020-07-17 22:07:01,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234718013] [2020-07-17 22:07:01,291 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 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-17 22:07:01,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:07:01,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:07:01,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:07:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:01,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:01,464 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-17 22:07:01,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,464 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-17 22:07:01,464 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret4 := main(); {702#true} is VALID [2020-07-17 22:07:01,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {702#true} is VALID [2020-07-17 22:07:01,465 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {702#true} is VALID [2020-07-17 22:07:01,465 INFO L263 TraceCheckUtils]: 6: Hoare triple {702#true} call #t~ret3 := fibonacci(~x~0); {702#true} is VALID [2020-07-17 22:07:01,465 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,465 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-17 22:07:01,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-17 22:07:01,466 INFO L263 TraceCheckUtils]: 10: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,467 INFO L263 TraceCheckUtils]: 14: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-17 22:07:01,468 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,468 INFO L280 TraceCheckUtils]: 16: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {825#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,469 INFO L280 TraceCheckUtils]: 17: Hoare triple {825#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {825#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,469 INFO L280 TraceCheckUtils]: 18: Hoare triple {825#(<= 1 |fibonacci_#in~n|)} assume true; {825#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,473 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {825#(<= 1 |fibonacci_#in~n|)} {809#(<= fibonacci_~n |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,474 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,474 INFO L263 TraceCheckUtils]: 21: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,475 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-17 22:07:01,475 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-17 22:07:01,475 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-17 22:07:01,476 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,477 INFO L280 TraceCheckUtils]: 26: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,477 INFO L280 TraceCheckUtils]: 27: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:01,478 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,479 INFO L280 TraceCheckUtils]: 29: Hoare triple {755#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:01,479 INFO L263 TraceCheckUtils]: 30: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-17 22:07:01,480 INFO L280 TraceCheckUtils]: 31: Hoare triple {702#true} ~n := #in~n; {871#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:01,481 INFO L280 TraceCheckUtils]: 32: Hoare triple {871#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,482 INFO L280 TraceCheckUtils]: 33: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:01,483 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-17 22:07:01,483 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {703#false} is VALID [2020-07-17 22:07:01,484 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-17 22:07:01,484 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-17 22:07:01,484 INFO L280 TraceCheckUtils]: 38: Hoare triple {703#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {703#false} is VALID [2020-07-17 22:07:01,484 INFO L280 TraceCheckUtils]: 39: Hoare triple {703#false} assume !(~result~0 >= ~x~0 - 1); {703#false} is VALID [2020-07-17 22:07:01,485 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-17 22:07:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:07:01,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:01,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2020-07-17 22:07:01,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077451328] [2020-07-17 22:07:01,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2020-07-17 22:07:01,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:01,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:07:01,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:01,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:07:01,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:07:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:07:01,543 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 10 states. [2020-07-17 22:07:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:01,942 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2020-07-17 22:07:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:07:01,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2020-07-17 22:07:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:07:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-17 22:07:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:07:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-17 22:07:01,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-17 22:07:02,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:02,025 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:07:02,025 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:07:02,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:07:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:07:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-17 22:07:02,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:02,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2020-07-17 22:07:02,042 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2020-07-17 22:07:02,042 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2020-07-17 22:07:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:02,046 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-17 22:07:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-17 22:07:02,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:02,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:02,048 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2020-07-17 22:07:02,048 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2020-07-17 22:07:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:02,051 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-17 22:07:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-17 22:07:02,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:02,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:02,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:02,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:07:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-07-17 22:07:02,055 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 41 [2020-07-17 22:07:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:02,056 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-17 22:07:02,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:07:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-17 22:07:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:07:02,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:02,057 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:02,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:02,271 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2020-07-17 22:07:02,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:02,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114645386] [2020-07-17 22:07:02,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} assume true; {1085#true} is VALID [2020-07-17 22:07:02,337 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1085#true} {1085#true} #38#return; {1085#true} is VALID [2020-07-17 22:07:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,481 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,513 INFO L263 TraceCheckUtils]: 3: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:02,514 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,515 INFO L280 TraceCheckUtils]: 5: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,516 INFO L280 TraceCheckUtils]: 6: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,518 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,519 INFO L263 TraceCheckUtils]: 10: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:02,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,523 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,527 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-17 22:07:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-17 22:07:02,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,556 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,558 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,561 INFO L263 TraceCheckUtils]: 3: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:02,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,563 INFO L280 TraceCheckUtils]: 5: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,564 INFO L263 TraceCheckUtils]: 7: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:02,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,568 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,569 INFO L263 TraceCheckUtils]: 14: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:02,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,572 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,575 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-17 22:07:02,576 INFO L280 TraceCheckUtils]: 22: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-17 22:07:02,576 INFO L263 TraceCheckUtils]: 23: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:02,577 INFO L280 TraceCheckUtils]: 24: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-17 22:07:02,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,580 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,581 INFO L280 TraceCheckUtils]: 29: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,581 INFO L280 TraceCheckUtils]: 30: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,582 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1085#true} #42#return; {1121#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-17 22:07:02,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2020-07-17 22:07:02,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2020-07-17 22:07:02,584 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #38#return; {1085#true} is VALID [2020-07-17 22:07:02,584 INFO L263 TraceCheckUtils]: 3: Hoare triple {1085#true} call #t~ret4 := main(); {1085#true} is VALID [2020-07-17 22:07:02,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1085#true} is VALID [2020-07-17 22:07:02,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {1085#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1085#true} is VALID [2020-07-17 22:07:02,585 INFO L263 TraceCheckUtils]: 6: Hoare triple {1085#true} call #t~ret3 := fibonacci(~x~0); {1085#true} is VALID [2020-07-17 22:07:02,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,587 INFO L263 TraceCheckUtils]: 10: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:02,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,589 INFO L263 TraceCheckUtils]: 14: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:02,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,590 INFO L280 TraceCheckUtils]: 16: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:02,591 INFO L280 TraceCheckUtils]: 17: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,591 INFO L280 TraceCheckUtils]: 18: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,593 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,594 INFO L263 TraceCheckUtils]: 21: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:02,594 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,595 INFO L280 TraceCheckUtils]: 23: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,595 INFO L280 TraceCheckUtils]: 24: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,597 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,598 INFO L280 TraceCheckUtils]: 26: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,598 INFO L280 TraceCheckUtils]: 27: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,600 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-17 22:07:02,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-17 22:07:02,601 INFO L263 TraceCheckUtils]: 30: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:02,601 INFO L280 TraceCheckUtils]: 31: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:02,601 INFO L280 TraceCheckUtils]: 32: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-17 22:07:02,602 INFO L280 TraceCheckUtils]: 33: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,602 INFO L280 TraceCheckUtils]: 34: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:02,604 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-17 22:07:02,605 INFO L280 TraceCheckUtils]: 36: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,605 INFO L280 TraceCheckUtils]: 37: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-17 22:07:02,606 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1085#true} #42#return; {1121#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-17 22:07:02,607 INFO L280 TraceCheckUtils]: 39: Hoare triple {1121#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1122#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-17 22:07:02,607 INFO L280 TraceCheckUtils]: 40: Hoare triple {1122#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {1086#false} is VALID [2020-07-17 22:07:02,608 INFO L280 TraceCheckUtils]: 41: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2020-07-17 22:07:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-17 22:07:02,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114645386] [2020-07-17 22:07:02,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272375021] [2020-07-17 22:07:02,611 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-17 22:07:02,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:07:02,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:07:02,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:07:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:02,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:03,067 INFO L263 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2020-07-17 22:07:03,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2020-07-17 22:07:03,068 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #38#return; {1085#true} is VALID [2020-07-17 22:07:03,068 INFO L263 TraceCheckUtils]: 3: Hoare triple {1085#true} call #t~ret4 := main(); {1085#true} is VALID [2020-07-17 22:07:03,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1085#true} is VALID [2020-07-17 22:07:03,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {1085#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1085#true} is VALID [2020-07-17 22:07:03,069 INFO L263 TraceCheckUtils]: 6: Hoare triple {1085#true} call #t~ret3 := fibonacci(~x~0); {1085#true} is VALID [2020-07-17 22:07:03,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {1085#true} ~n := #in~n; {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:03,072 INFO L280 TraceCheckUtils]: 8: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:03,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:03,073 INFO L263 TraceCheckUtils]: 10: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:03,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:03,073 INFO L280 TraceCheckUtils]: 12: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-17 22:07:03,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {1085#true} assume !(1 == ~n); {1085#true} is VALID [2020-07-17 22:07:03,073 INFO L263 TraceCheckUtils]: 14: Hoare triple {1085#true} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-17 22:07:03,074 INFO L280 TraceCheckUtils]: 15: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:03,074 INFO L280 TraceCheckUtils]: 16: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-17 22:07:03,075 INFO L280 TraceCheckUtils]: 17: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:03,075 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:03,076 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1085#true} #34#return; {1224#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-17 22:07:03,077 INFO L280 TraceCheckUtils]: 20: Hoare triple {1224#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1224#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-17 22:07:03,078 INFO L263 TraceCheckUtils]: 21: Hoare triple {1224#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:03,078 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-17 22:07:03,079 INFO L280 TraceCheckUtils]: 23: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:03,079 INFO L280 TraceCheckUtils]: 24: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-17 22:07:03,080 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1224#(<= 1 |fibonacci_#t~ret0|)} #36#return; {1243#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|))} is VALID [2020-07-17 22:07:03,081 INFO L280 TraceCheckUtils]: 26: Hoare triple {1243#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:03,082 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-17 22:07:03,083 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1187#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2020-07-17 22:07:03,084 INFO L280 TraceCheckUtils]: 29: Hoare triple {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2020-07-17 22:07:03,084 INFO L263 TraceCheckUtils]: 30: Hoare triple {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-17 22:07:03,085 INFO L280 TraceCheckUtils]: 31: Hoare triple {1085#true} ~n := #in~n; {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:03,085 INFO L280 TraceCheckUtils]: 32: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:03,086 INFO L280 TraceCheckUtils]: 33: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:07:03,087 INFO L280 TraceCheckUtils]: 34: Hoare triple {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-17 22:07:03,088 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} #36#return; {1276#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 3) (<= 1 |fibonacci_#t~ret1|))} is VALID [2020-07-17 22:07:03,089 INFO L280 TraceCheckUtils]: 36: Hoare triple {1276#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 3) (<= 1 |fibonacci_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2020-07-17 22:07:03,091 INFO L280 TraceCheckUtils]: 37: Hoare triple {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} assume true; {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2020-07-17 22:07:03,092 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} {1085#true} #42#return; {1287#(and (<= main_~x~0 3) (<= 2 |main_#t~ret3|))} is VALID [2020-07-17 22:07:03,093 INFO L280 TraceCheckUtils]: 39: Hoare triple {1287#(and (<= main_~x~0 3) (<= 2 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1291#(and (<= main_~x~0 3) (<= 2 main_~result~0))} is VALID [2020-07-17 22:07:03,093 INFO L280 TraceCheckUtils]: 40: Hoare triple {1291#(and (<= main_~x~0 3) (<= 2 main_~result~0))} assume !(~result~0 >= ~x~0 - 1); {1086#false} is VALID [2020-07-17 22:07:03,094 INFO L280 TraceCheckUtils]: 41: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2020-07-17 22:07:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-17 22:07:03,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:03,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2020-07-17 22:07:03,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456426897] [2020-07-17 22:07:03,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2020-07-17 22:07:03,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:03,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:07:03,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:03,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:07:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:07:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:07:03,166 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 21 states. [2020-07-17 22:07:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:04,213 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2020-07-17 22:07:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 22:07:04,213 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2020-07-17 22:07:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:07:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2020-07-17 22:07:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:07:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2020-07-17 22:07:04,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2020-07-17 22:07:04,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:04,296 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:07:04,296 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:07:04,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2020-07-17 22:07:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:07:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:07:04,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:04,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:04,299 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:04,299 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:04,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:07:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:07:04,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:04,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:04,301 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:04,301 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:07:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:04,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:07:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:07:04,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:04,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:04,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:04,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:07:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:07:04,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-17 22:07:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:04,303 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:07:04,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:07:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:07:04,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:04,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:04,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:07:04,684 INFO L268 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2020-07-17 22:07:04,684 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-17 22:07:04,685 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 2 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 1 |fibonacci_#t~ret0|) (<= 2 |fibonacci_#in~n|) .cse0 (<= |fibonacci_#in~n| 2)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:07:04,685 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:07:04,685 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point L31(lines 31 35) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-17 22:07:04,686 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 25 36) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 25 36) no Hoare annotation was computed. [2020-07-17 22:07:04,686 INFO L268 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:07:04,690 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: fibonacciFINAL has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-17 22:07:04,691 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:07:04,692 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-17 22:07:04,693 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:07:04,693 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:07:04,693 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:07:04,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:07:04 BoogieIcfgContainer [2020-07-17 22:07:04,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:07:04,698 INFO L168 Benchmark]: Toolchain (without parser) took 8661.47 ms. Allocated memory was 145.8 MB in the beginning and 303.6 MB in the end (delta: 157.8 MB). Free memory was 103.4 MB in the beginning and 226.4 MB in the end (delta: -122.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:04,699 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.8 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-17 22:07:04,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.63 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:04,700 INFO L168 Benchmark]: Boogie Preprocessor took 110.16 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 93.5 MB in the beginning and 181.3 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:04,701 INFO L168 Benchmark]: RCFGBuilder took 399.93 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 164.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:04,702 INFO L168 Benchmark]: TraceAbstraction took 7844.45 ms. Allocated memory was 202.4 MB in the beginning and 303.6 MB in the end (delta: 101.2 MB). Free memory was 163.4 MB in the beginning and 226.4 MB in the end (delta: -63.0 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:04,704 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.50 ms. Allocated memory is still 145.8 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 295.63 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.16 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 93.5 MB in the beginning and 181.3 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.93 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 164.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7844.45 ms. Allocated memory was 202.4 MB in the beginning and 303.6 MB in the end (delta: 101.2 MB). Free memory was 163.4 MB in the beginning and 226.4 MB in the end (delta: -63.0 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.5s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 88 SDtfs, 73 SDslu, 403 SDs, 0 SdLazy, 594 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 35 PreInvPairs, 50 NumberOfFragments, 39 HoareAnnotationTreeSize, 35 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 113 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 24318 SizeOfPredicates, 16 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 164/244 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 correct! Received shutdown request...