/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:13:09,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:13:09,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:13:09,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:13:09,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:13:09,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:13:09,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:13:09,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:13:09,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:13:09,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:13:09,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:13:09,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:13:09,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:13:09,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:13:09,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:13:09,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:13:09,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:13:09,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:13:09,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:13:09,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:13:09,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:13:09,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:13:09,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:13:09,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:13:09,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:13:09,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:13:09,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:13:09,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:13:09,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:13:09,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:13:09,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:13:09,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:13:09,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:13:09,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:13:09,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:13:09,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:13:09,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:13:09,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:13:09,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:13:09,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:13:09,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:13:09,469 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-08 12:13:09,511 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:13:09,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:13:09,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:13:09,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:13:09,513 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:13:09,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:13:09,516 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:13:09,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:13:09,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:13:09,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:13:09,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:13:09,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:13:09,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:13:09,517 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:13:09,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:13:09,518 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:13:09,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:13:09,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:13:09,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:13:09,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:13:09,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:13:09,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:13:09,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:13:09,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:13:09,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:13:09,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:13:09,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:13:09,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:13:09,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:13:09,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:13:09,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:13:09,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:13:09,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:13:09,817 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:13:09,817 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:13:09,818 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-08 12:13:09,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f144e4a/6afade031b644ceda4195f5ea60bb2fd/FLAGecd39cbd0 [2020-07-08 12:13:10,388 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:13:10,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-08 12:13:10,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f144e4a/6afade031b644ceda4195f5ea60bb2fd/FLAGecd39cbd0 [2020-07-08 12:13:10,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f144e4a/6afade031b644ceda4195f5ea60bb2fd [2020-07-08 12:13:10,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:13:10,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:13:10,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:13:10,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:13:10,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:13:10,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:13:10" (1/1) ... [2020-07-08 12:13:10,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d12798b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:10, skipping insertion in model container [2020-07-08 12:13:10,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:13:10" (1/1) ... [2020-07-08 12:13:10,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:13:10,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:13:10,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:13:10,982 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:13:11,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:13:11,020 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:13:11,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11 WrapperNode [2020-07-08 12:13:11,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:13:11,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:13:11,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:13:11,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:13:11,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... [2020-07-08 12:13:11,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:13:11,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:13:11,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:13:11,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:13:11,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:13:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:13:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:13:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-08 12:13:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-08 12:13:11,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:13:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:13:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:13:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-08 12:13:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-08 12:13:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:13:11,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:13:11,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:13:11,564 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:13:11,565 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:13:11,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:13:11 BoogieIcfgContainer [2020-07-08 12:13:11,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:13:11,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:13:11,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:13:11,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:13:11,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:13:10" (1/3) ... [2020-07-08 12:13:11,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bea2144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:13:11, skipping insertion in model container [2020-07-08 12:13:11,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:13:11" (2/3) ... [2020-07-08 12:13:11,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bea2144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:13:11, skipping insertion in model container [2020-07-08 12:13:11,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:13:11" (3/3) ... [2020-07-08 12:13:11,583 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-07-08 12:13:11,600 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:13:11,609 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:13:11,631 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:13:11,664 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:13:11,664 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:13:11,665 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:13:11,665 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:13:11,665 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:13:11,665 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:13:11,666 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:13:11,666 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:13:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-08 12:13:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:13:11,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:13:11,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:13:11,699 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:13:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:13:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-08 12:13:11,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:13:11,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415267957] [2020-07-08 12:13:11,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:13:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:11,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-08 12:13:11,957 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-08 12:13:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:12,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:12,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:12,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:12,048 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID [2020-07-08 12:13:12,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-08 12:13:12,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-08 12:13:12,050 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-08 12:13:12,051 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2020-07-08 12:13:12,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 2; {40#(<= 2 main_~x~0)} is VALID [2020-07-08 12:13:12,053 INFO L263 TraceCheckUtils]: 5: Hoare triple {40#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {36#true} is VALID [2020-07-08 12:13:12,054 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:12,056 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:12,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:12,060 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID [2020-07-08 12:13:12,061 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {37#false} is VALID [2020-07-08 12:13:12,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 1 != ~result~0; {37#false} is VALID [2020-07-08 12:13:12,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-08 12:13:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:13:12,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415267957] [2020-07-08 12:13:12,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:13:12,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:13:12,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123693210] [2020-07-08 12:13:12,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:13:12,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:13:12,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:13:12,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:12,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:13:12,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:13:12,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:13:12,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:13:12,128 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-08 12:13:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:12,503 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-08 12:13:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:13:12,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:13:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:13:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:13:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-08 12:13:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:13:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-08 12:13:12,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-08 12:13:12,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:12,639 INFO L225 Difference]: With dead ends: 44 [2020-07-08 12:13:12,639 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:13:12,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:13:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:13:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 12:13:12,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:13:12,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 12:13:12,719 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:13:12,719 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:13:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:12,726 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-08 12:13:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-08 12:13:12,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:12,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:12,728 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:13:12,729 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:13:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:12,735 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-08 12:13:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-08 12:13:12,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:12,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:12,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:13:12,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:13:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:13:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-08 12:13:12,743 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-08 12:13:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:13:12,744 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-08 12:13:12,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:13:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-08 12:13:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:13:12,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:13:12,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:13:12,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:13:12,746 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:13:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:13:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-08 12:13:12,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:13:12,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298139432] [2020-07-08 12:13:12,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:13:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:12,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-08 12:13:12,782 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-08 12:13:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:12,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:12,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:12,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:12,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:12,822 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID [2020-07-08 12:13:12,823 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2020-07-08 12:13:12,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-08 12:13:12,824 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-08 12:13:12,824 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID [2020-07-08 12:13:12,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 2; {211#(<= 2 main_~x~0)} is VALID [2020-07-08 12:13:12,826 INFO L263 TraceCheckUtils]: 5: Hoare triple {211#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {207#true} is VALID [2020-07-08 12:13:12,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:12,827 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:12,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:12,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:12,831 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID [2020-07-08 12:13:12,831 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {208#false} is VALID [2020-07-08 12:13:12,832 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 1 != ~result~0; {208#false} is VALID [2020-07-08 12:13:12,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2020-07-08 12:13:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:13:12,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298139432] [2020-07-08 12:13:12,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:13:12,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:13:12,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026222217] [2020-07-08 12:13:12,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 12:13:12,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:13:12,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:13:12,854 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-08 12:13:12,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:13:12,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:13:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:13:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:13:12,856 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-08 12:13:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:13,070 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-08 12:13:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:13:13,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 12:13:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:13:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:13:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-08 12:13:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:13:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-08 12:13:13,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-08 12:13:13,148 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-08 12:13:13,153 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:13:13,154 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 12:13:13,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:13:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 12:13:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-08 12:13:13,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:13:13,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-08 12:13:13,181 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-08 12:13:13,182 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-08 12:13:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:13,193 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-08 12:13:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-08 12:13:13,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:13,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:13,195 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-08 12:13:13,195 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-08 12:13:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:13,204 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-08 12:13:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-08 12:13:13,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:13,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:13,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:13:13,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:13:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:13:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-08 12:13:13,212 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-08 12:13:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:13:13,213 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-08 12:13:13,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:13:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-08 12:13:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:13:13,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:13:13,218 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:13:13,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:13:13,221 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:13:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:13:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-08 12:13:13,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:13:13,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315019345] [2020-07-08 12:13:13,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:13:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,336 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-08 12:13:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:13,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,453 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-08 12:13:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-08 12:13:13,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-08 12:13:13,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,460 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-08 12:13:13,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-08 12:13:13,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-08 12:13:13,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-08 12:13:13,463 INFO L263 TraceCheckUtils]: 3: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-08 12:13:13,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:13,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,466 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-08 12:13:13,467 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-08 12:13:13,467 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-08 12:13:13,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-08 12:13:13,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-08 12:13:13,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,468 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-08 12:13:13,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-08 12:13:13,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-08 12:13:13,470 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-08 12:13:13,471 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-08 12:13:13,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,471 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-08 12:13:13,472 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-08 12:13:13,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-08 12:13:13,473 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-08 12:13:13,473 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-08 12:13:13,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-08 12:13:13,475 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-08 12:13:13,475 INFO L263 TraceCheckUtils]: 9: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-08 12:13:13,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:13,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,479 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-08 12:13:13,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-08 12:13:13,480 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-08 12:13:13,480 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-08 12:13:13,480 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-08 12:13:13,480 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,481 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-08 12:13:13,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-08 12:13:13,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-08 12:13:13,482 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-08 12:13:13,482 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-08 12:13:13,482 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 != ~result~0; {376#false} is VALID [2020-07-08 12:13:13,483 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-08 12:13:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:13:13,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315019345] [2020-07-08 12:13:13,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987803275] [2020-07-08 12:13:13,485 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-08 12:13:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:13:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:13,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:13:13,701 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-08 12:13:13,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,702 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-08 12:13:13,702 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-08 12:13:13,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-08 12:13:13,703 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-08 12:13:13,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-08 12:13:13,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-08 12:13:13,706 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-08 12:13:13,706 INFO L263 TraceCheckUtils]: 9: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-08 12:13:13,707 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-08 12:13:13,708 INFO L280 TraceCheckUtils]: 11: Hoare triple {443#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 12:13:13,711 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {430#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:13,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:13,712 INFO L263 TraceCheckUtils]: 15: Hoare triple {453#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-08 12:13:13,712 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-08 12:13:13,713 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-08 12:13:13,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-08 12:13:13,714 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {453#(<= |fibo1_#in~n| 1)} #59#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:13,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:13,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume true; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 12:13:13,717 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {453#(<= |fibo1_#in~n| 1)} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-08 12:13:13,718 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-08 12:13:13,718 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 != ~result~0; {376#false} is VALID [2020-07-08 12:13:13,718 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-08 12:13:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:13:13,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:13:13,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-08 12:13:13,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028182347] [2020-07-08 12:13:13,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-08 12:13:13,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:13:13,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:13:13,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:13,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:13:13,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:13:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:13:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:13:13,778 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-08 12:13:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:14,357 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-08 12:13:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:13:14,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-08 12:13:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:13:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:13:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-08 12:13:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:13:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-08 12:13:14,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-08 12:13:14,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:14,483 INFO L225 Difference]: With dead ends: 58 [2020-07-08 12:13:14,483 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:13:14,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:13:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:13:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-08 12:13:14,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:13:14,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-08 12:13:14,507 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-08 12:13:14,507 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-08 12:13:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:14,512 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-08 12:13:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-08 12:13:14,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:14,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:14,514 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-08 12:13:14,514 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-08 12:13:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:14,518 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-08 12:13:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-08 12:13:14,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:14,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:14,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:13:14,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:13:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:13:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-08 12:13:14,524 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-08 12:13:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:13:14,524 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-08 12:13:14,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:13:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-08 12:13:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:13:14,526 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:13:14,526 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:13:14,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:13:14,743 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:13:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:13:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-08 12:13:14,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:13:14,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49805570] [2020-07-08 12:13:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:13:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:14,864 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-08 12:13:14,865 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-08 12:13:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:14,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:14,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:14,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:14,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:14,987 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:15,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,031 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 12:13:15,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:15,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-08 12:13:15,032 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-08 12:13:15,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:15,035 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:15,036 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:15,037 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,038 INFO L263 TraceCheckUtils]: 10: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-08 12:13:15,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,038 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,040 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 12:13:15,041 INFO L280 TraceCheckUtils]: 15: Hoare triple {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 12:13:15,042 INFO L280 TraceCheckUtils]: 16: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 12:13:15,048 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-08 12:13:15,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-08 12:13:15,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-08 12:13:15,050 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-08 12:13:15,050 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-08 12:13:15,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 2; {685#true} is VALID [2020-07-08 12:13:15,051 INFO L263 TraceCheckUtils]: 5: Hoare triple {685#true} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-08 12:13:15,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,051 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:15,051 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-08 12:13:15,052 INFO L263 TraceCheckUtils]: 9: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-08 12:13:15,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:15,053 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:15,054 INFO L280 TraceCheckUtils]: 13: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:15,054 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,055 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,055 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-08 12:13:15,056 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,057 INFO L280 TraceCheckUtils]: 19: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,059 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 12:13:15,059 INFO L280 TraceCheckUtils]: 21: Hoare triple {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 12:13:15,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 12:13:15,061 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-08 12:13:15,062 INFO L280 TraceCheckUtils]: 24: Hoare triple {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-08 12:13:15,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {686#false} is VALID [2020-07-08 12:13:15,064 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-08 12:13:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:13:15,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49805570] [2020-07-08 12:13:15,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426530952] [2020-07-08 12:13:15,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:13:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:15,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-08 12:13:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:15,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:13:15,301 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-08 12:13:15,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-08 12:13:15,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-08 12:13:15,303 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-08 12:13:15,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 2; {685#true} is VALID [2020-07-08 12:13:15,303 INFO L263 TraceCheckUtils]: 5: Hoare triple {685#true} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-08 12:13:15,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:15,304 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-08 12:13:15,304 INFO L263 TraceCheckUtils]: 9: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-08 12:13:15,305 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-08 12:13:15,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:15,307 INFO L280 TraceCheckUtils]: 13: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 12:13:15,308 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,309 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,309 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-08 12:13:15,309 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-08 12:13:15,312 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,312 INFO L280 TraceCheckUtils]: 19: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 12:13:15,314 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {786#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 12:13:15,315 INFO L280 TraceCheckUtils]: 21: Hoare triple {786#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 12:13:15,316 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 12:13:15,317 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-08 12:13:15,320 INFO L280 TraceCheckUtils]: 24: Hoare triple {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-08 12:13:15,324 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {686#false} is VALID [2020-07-08 12:13:15,325 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-08 12:13:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:13:15,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:13:15,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-08 12:13:15,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511426977] [2020-07-08 12:13:15,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-08 12:13:15,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:13:15,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:13:15,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:15,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:13:15,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:13:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:13:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:13:15,381 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2020-07-08 12:13:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:15,787 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-07-08 12:13:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:13:15,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-08 12:13:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:13:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:13:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-08 12:13:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:13:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-08 12:13:15,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2020-07-08 12:13:15,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:15,870 INFO L225 Difference]: With dead ends: 46 [2020-07-08 12:13:15,871 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 12:13:15,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:13:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 12:13:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2020-07-08 12:13:15,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:13:15,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 37 states. [2020-07-08 12:13:15,891 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 37 states. [2020-07-08 12:13:15,891 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 37 states. [2020-07-08 12:13:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:15,896 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-08 12:13:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-08 12:13:15,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:15,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:15,898 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 42 states. [2020-07-08 12:13:15,898 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 42 states. [2020-07-08 12:13:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:15,902 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-08 12:13:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-08 12:13:15,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:15,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:15,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:13:15,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:13:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 12:13:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-08 12:13:15,908 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2020-07-08 12:13:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:13:15,908 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-08 12:13:15,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:13:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-08 12:13:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:13:15,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:13:15,910 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:13:16,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:13:16,124 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:13:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:13:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1725129826, now seen corresponding path program 1 times [2020-07-08 12:13:16,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:13:16,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447807931] [2020-07-08 12:13:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:13:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-08 12:13:16,187 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-08 12:13:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 12:13:16,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 12:13:16,241 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-08 12:13:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 12:13:16,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume 1 == ~n;#res := 1; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,280 INFO L280 TraceCheckUtils]: 3: Hoare triple {1033#(<= 1 |fibo2_#in~n|)} assume true; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,281 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1033#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-08 12:13:16,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-08 12:13:16,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-08 12:13:16,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {995#true} assume !(1 == ~n); {995#true} is VALID [2020-07-08 12:13:16,282 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-08 12:13:16,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 12:13:16,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 12:13:16,285 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-08 12:13:16,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {1024#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1024#(<= fibo1_~n 2)} is VALID [2020-07-08 12:13:16,286 INFO L263 TraceCheckUtils]: 10: Hoare triple {1024#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-08 12:13:16,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,290 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 12:13:16,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {1032#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume 1 == ~n;#res := 1; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {1033#(<= 1 |fibo2_#in~n|)} assume true; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,295 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1033#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-08 12:13:16,296 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {996#false} is VALID [2020-07-08 12:13:16,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {996#false} assume true; {996#false} is VALID [2020-07-08 12:13:16,296 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {996#false} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-08 12:13:16,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2020-07-08 12:13:16,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-08 12:13:16,297 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-08 12:13:16,297 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret5 := main(); {995#true} is VALID [2020-07-08 12:13:16,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~x~0 := 2; {999#(<= main_~x~0 2)} is VALID [2020-07-08 12:13:16,299 INFO L263 TraceCheckUtils]: 5: Hoare triple {999#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {995#true} is VALID [2020-07-08 12:13:16,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-08 12:13:16,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-08 12:13:16,299 INFO L280 TraceCheckUtils]: 8: Hoare triple {995#true} assume !(1 == ~n); {995#true} is VALID [2020-07-08 12:13:16,300 INFO L263 TraceCheckUtils]: 9: Hoare triple {995#true} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-08 12:13:16,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 12:13:16,303 INFO L280 TraceCheckUtils]: 13: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 12:13:16,304 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-08 12:13:16,304 INFO L280 TraceCheckUtils]: 15: Hoare triple {1024#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1024#(<= fibo1_~n 2)} is VALID [2020-07-08 12:13:16,305 INFO L263 TraceCheckUtils]: 16: Hoare triple {1024#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-08 12:13:16,305 INFO L280 TraceCheckUtils]: 17: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,308 INFO L280 TraceCheckUtils]: 18: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 12:13:16,310 INFO L280 TraceCheckUtils]: 19: Hoare triple {1032#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume 1 == ~n;#res := 1; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,311 INFO L280 TraceCheckUtils]: 20: Hoare triple {1033#(<= 1 |fibo2_#in~n|)} assume true; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,313 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1033#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-08 12:13:16,313 INFO L280 TraceCheckUtils]: 22: Hoare triple {996#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {996#false} is VALID [2020-07-08 12:13:16,314 INFO L280 TraceCheckUtils]: 23: Hoare triple {996#false} assume true; {996#false} is VALID [2020-07-08 12:13:16,314 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {996#false} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-08 12:13:16,314 INFO L280 TraceCheckUtils]: 25: Hoare triple {996#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {996#false} is VALID [2020-07-08 12:13:16,315 INFO L280 TraceCheckUtils]: 26: Hoare triple {996#false} assume 1 != ~result~0; {996#false} is VALID [2020-07-08 12:13:16,315 INFO L280 TraceCheckUtils]: 27: Hoare triple {996#false} assume !false; {996#false} is VALID [2020-07-08 12:13:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:13:16,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447807931] [2020-07-08 12:13:16,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696800127] [2020-07-08 12:13:16,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:13:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:13:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:16,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:13:16,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2020-07-08 12:13:16,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-08 12:13:16,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-08 12:13:16,455 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret5 := main(); {995#true} is VALID [2020-07-08 12:13:16,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~x~0 := 2; {999#(<= main_~x~0 2)} is VALID [2020-07-08 12:13:16,456 INFO L263 TraceCheckUtils]: 5: Hoare triple {999#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {995#true} is VALID [2020-07-08 12:13:16,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#true} ~n := #in~n; {1055#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,458 INFO L280 TraceCheckUtils]: 7: Hoare triple {1055#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1055#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {1055#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1055#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,459 INFO L263 TraceCheckUtils]: 9: Hoare triple {1055#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-08 12:13:16,459 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-08 12:13:16,459 INFO L280 TraceCheckUtils]: 11: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-08 12:13:16,459 INFO L280 TraceCheckUtils]: 12: Hoare triple {995#true} assume 1 == ~n;#res := 1; {995#true} is VALID [2020-07-08 12:13:16,460 INFO L280 TraceCheckUtils]: 13: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-08 12:13:16,460 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {995#true} {1055#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {1055#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,461 INFO L280 TraceCheckUtils]: 15: Hoare triple {1055#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1055#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,461 INFO L263 TraceCheckUtils]: 16: Hoare triple {1055#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-08 12:13:16,462 INFO L280 TraceCheckUtils]: 17: Hoare triple {995#true} ~n := #in~n; {1089#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {1089#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,463 INFO L280 TraceCheckUtils]: 19: Hoare triple {1033#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,464 INFO L280 TraceCheckUtils]: 20: Hoare triple {1033#(<= 1 |fibo2_#in~n|)} assume true; {1033#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:16,465 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1033#(<= 1 |fibo2_#in~n|)} {1055#(<= fibo1_~n |fibo1_#in~n|)} #59#return; {1102#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,466 INFO L280 TraceCheckUtils]: 22: Hoare triple {1102#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1102#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {1102#(<= 3 |fibo1_#in~n|)} assume true; {1102#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:16,468 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1102#(<= 3 |fibo1_#in~n|)} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-08 12:13:16,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {996#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {996#false} is VALID [2020-07-08 12:13:16,469 INFO L280 TraceCheckUtils]: 26: Hoare triple {996#false} assume 1 != ~result~0; {996#false} is VALID [2020-07-08 12:13:16,469 INFO L280 TraceCheckUtils]: 27: Hoare triple {996#false} assume !false; {996#false} is VALID [2020-07-08 12:13:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:13:16,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:13:16,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2020-07-08 12:13:16,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404370867] [2020-07-08 12:13:16,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-08 12:13:16,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:13:16,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:13:16,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:16,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:13:16,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:13:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:13:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:13:16,503 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 7 states. [2020-07-08 12:13:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:16,920 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2020-07-08 12:13:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:13:16,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-08 12:13:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:13:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:13:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 12:13:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:13:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 12:13:16,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-08 12:13:16,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:17,000 INFO L225 Difference]: With dead ends: 44 [2020-07-08 12:13:17,000 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 12:13:17,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:13:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 12:13:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-08 12:13:17,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:13:17,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-08 12:13:17,020 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-08 12:13:17,020 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-08 12:13:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:17,024 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-08 12:13:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2020-07-08 12:13:17,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:17,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:17,025 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-08 12:13:17,025 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-08 12:13:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:17,028 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-08 12:13:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2020-07-08 12:13:17,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:17,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:17,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:13:17,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:13:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 12:13:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-08 12:13:17,033 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 28 [2020-07-08 12:13:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:13:17,033 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-08 12:13:17,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:13:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-08 12:13:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 12:13:17,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:13:17,035 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:13:17,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:13:17,250 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:13:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:13:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-08 12:13:17,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:13:17,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359888689] [2020-07-08 12:13:17,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:13:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,282 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1310#true} {1310#true} #47#return; {1310#true} is VALID [2020-07-08 12:13:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#true} ~n := #in~n; {1376#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {1376#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {1377#(<= |fibo1_#in~n| 0)} assume true; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1377#(<= |fibo1_#in~n| 0)} {1367#(< 1 fibo2_~n)} #53#return; {1311#false} is VALID [2020-07-08 12:13:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1310#true} {1311#false} #55#return; {1311#false} is VALID [2020-07-08 12:13:17,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#true} assume !(~n < 1); {1366#(< 0 fibo2_~n)} is VALID [2020-07-08 12:13:17,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#(< 0 fibo2_~n)} assume !(1 == ~n); {1367#(< 1 fibo2_~n)} is VALID [2020-07-08 12:13:17,394 INFO L263 TraceCheckUtils]: 3: Hoare triple {1367#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {1310#true} ~n := #in~n; {1376#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,400 INFO L280 TraceCheckUtils]: 5: Hoare triple {1376#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {1377#(<= |fibo1_#in~n| 0)} assume true; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,402 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1377#(<= |fibo1_#in~n| 0)} {1367#(< 1 fibo2_~n)} #53#return; {1311#false} is VALID [2020-07-08 12:13:17,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {1311#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1311#false} is VALID [2020-07-08 12:13:17,402 INFO L263 TraceCheckUtils]: 9: Hoare triple {1311#false} call #t~ret3 := fibo1(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,403 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1310#true} {1311#false} #55#return; {1311#false} is VALID [2020-07-08 12:13:17,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {1311#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1311#false} is VALID [2020-07-08 12:13:17,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {1311#false} assume true; {1311#false} is VALID [2020-07-08 12:13:17,403 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1311#false} {1310#true} #57#return; {1311#false} is VALID [2020-07-08 12:13:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,410 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1310#true} {1311#false} #59#return; {1311#false} is VALID [2020-07-08 12:13:17,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#true} assume !(~n < 1); {1310#true} is VALID [2020-07-08 12:13:17,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {1310#true} assume !(1 == ~n); {1310#true} is VALID [2020-07-08 12:13:17,411 INFO L263 TraceCheckUtils]: 3: Hoare triple {1310#true} call #t~ret0 := fibo2(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,412 INFO L280 TraceCheckUtils]: 5: Hoare triple {1310#true} assume !(~n < 1); {1366#(< 0 fibo2_~n)} is VALID [2020-07-08 12:13:17,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {1366#(< 0 fibo2_~n)} assume !(1 == ~n); {1367#(< 1 fibo2_~n)} is VALID [2020-07-08 12:13:17,413 INFO L263 TraceCheckUtils]: 7: Hoare triple {1367#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {1310#true} ~n := #in~n; {1376#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {1376#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {1377#(<= |fibo1_#in~n| 0)} assume true; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,415 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1377#(<= |fibo1_#in~n| 0)} {1367#(< 1 fibo2_~n)} #53#return; {1311#false} is VALID [2020-07-08 12:13:17,415 INFO L280 TraceCheckUtils]: 12: Hoare triple {1311#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1311#false} is VALID [2020-07-08 12:13:17,415 INFO L263 TraceCheckUtils]: 13: Hoare triple {1311#false} call #t~ret3 := fibo1(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,416 INFO L280 TraceCheckUtils]: 16: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,416 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1310#true} {1311#false} #55#return; {1311#false} is VALID [2020-07-08 12:13:17,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {1311#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1311#false} is VALID [2020-07-08 12:13:17,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {1311#false} assume true; {1311#false} is VALID [2020-07-08 12:13:17,417 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1311#false} {1310#true} #57#return; {1311#false} is VALID [2020-07-08 12:13:17,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {1311#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1311#false} is VALID [2020-07-08 12:13:17,417 INFO L263 TraceCheckUtils]: 22: Hoare triple {1311#false} call #t~ret1 := fibo2(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,418 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1310#true} {1311#false} #59#return; {1311#false} is VALID [2020-07-08 12:13:17,418 INFO L280 TraceCheckUtils]: 27: Hoare triple {1311#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1311#false} is VALID [2020-07-08 12:13:17,418 INFO L280 TraceCheckUtils]: 28: Hoare triple {1311#false} assume true; {1311#false} is VALID [2020-07-08 12:13:17,419 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1311#false} {1314#(<= main_~x~0 2)} #51#return; {1311#false} is VALID [2020-07-08 12:13:17,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {1310#true} call ULTIMATE.init(); {1310#true} is VALID [2020-07-08 12:13:17,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,420 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1310#true} {1310#true} #47#return; {1310#true} is VALID [2020-07-08 12:13:17,420 INFO L263 TraceCheckUtils]: 3: Hoare triple {1310#true} call #t~ret5 := main(); {1310#true} is VALID [2020-07-08 12:13:17,421 INFO L280 TraceCheckUtils]: 4: Hoare triple {1310#true} ~x~0 := 2; {1314#(<= main_~x~0 2)} is VALID [2020-07-08 12:13:17,421 INFO L263 TraceCheckUtils]: 5: Hoare triple {1314#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1310#true} is VALID [2020-07-08 12:13:17,422 INFO L280 TraceCheckUtils]: 6: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {1310#true} assume !(~n < 1); {1310#true} is VALID [2020-07-08 12:13:17,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {1310#true} assume !(1 == ~n); {1310#true} is VALID [2020-07-08 12:13:17,422 INFO L263 TraceCheckUtils]: 9: Hoare triple {1310#true} call #t~ret0 := fibo2(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,422 INFO L280 TraceCheckUtils]: 10: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {1310#true} assume !(~n < 1); {1366#(< 0 fibo2_~n)} is VALID [2020-07-08 12:13:17,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {1366#(< 0 fibo2_~n)} assume !(1 == ~n); {1367#(< 1 fibo2_~n)} is VALID [2020-07-08 12:13:17,424 INFO L263 TraceCheckUtils]: 13: Hoare triple {1367#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,425 INFO L280 TraceCheckUtils]: 14: Hoare triple {1310#true} ~n := #in~n; {1376#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,425 INFO L280 TraceCheckUtils]: 15: Hoare triple {1376#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,426 INFO L280 TraceCheckUtils]: 16: Hoare triple {1377#(<= |fibo1_#in~n| 0)} assume true; {1377#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 12:13:17,427 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1377#(<= |fibo1_#in~n| 0)} {1367#(< 1 fibo2_~n)} #53#return; {1311#false} is VALID [2020-07-08 12:13:17,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {1311#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1311#false} is VALID [2020-07-08 12:13:17,427 INFO L263 TraceCheckUtils]: 19: Hoare triple {1311#false} call #t~ret3 := fibo1(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,428 INFO L280 TraceCheckUtils]: 20: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,428 INFO L280 TraceCheckUtils]: 21: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,428 INFO L280 TraceCheckUtils]: 22: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,428 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1310#true} {1311#false} #55#return; {1311#false} is VALID [2020-07-08 12:13:17,428 INFO L280 TraceCheckUtils]: 24: Hoare triple {1311#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1311#false} is VALID [2020-07-08 12:13:17,429 INFO L280 TraceCheckUtils]: 25: Hoare triple {1311#false} assume true; {1311#false} is VALID [2020-07-08 12:13:17,429 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1311#false} {1310#true} #57#return; {1311#false} is VALID [2020-07-08 12:13:17,429 INFO L280 TraceCheckUtils]: 27: Hoare triple {1311#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1311#false} is VALID [2020-07-08 12:13:17,429 INFO L263 TraceCheckUtils]: 28: Hoare triple {1311#false} call #t~ret1 := fibo2(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,430 INFO L280 TraceCheckUtils]: 30: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,430 INFO L280 TraceCheckUtils]: 31: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,430 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1310#true} {1311#false} #59#return; {1311#false} is VALID [2020-07-08 12:13:17,431 INFO L280 TraceCheckUtils]: 33: Hoare triple {1311#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1311#false} is VALID [2020-07-08 12:13:17,431 INFO L280 TraceCheckUtils]: 34: Hoare triple {1311#false} assume true; {1311#false} is VALID [2020-07-08 12:13:17,431 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1311#false} {1314#(<= main_~x~0 2)} #51#return; {1311#false} is VALID [2020-07-08 12:13:17,431 INFO L280 TraceCheckUtils]: 36: Hoare triple {1311#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1311#false} is VALID [2020-07-08 12:13:17,431 INFO L280 TraceCheckUtils]: 37: Hoare triple {1311#false} assume 1 != ~result~0; {1311#false} is VALID [2020-07-08 12:13:17,432 INFO L280 TraceCheckUtils]: 38: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2020-07-08 12:13:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 12:13:17,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359888689] [2020-07-08 12:13:17,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810048387] [2020-07-08 12:13:17,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:13:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:13:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:13:17,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:13:17,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {1310#true} call ULTIMATE.init(); {1310#true} is VALID [2020-07-08 12:13:17,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,655 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1310#true} {1310#true} #47#return; {1310#true} is VALID [2020-07-08 12:13:17,655 INFO L263 TraceCheckUtils]: 3: Hoare triple {1310#true} call #t~ret5 := main(); {1310#true} is VALID [2020-07-08 12:13:17,656 INFO L280 TraceCheckUtils]: 4: Hoare triple {1310#true} ~x~0 := 2; {1314#(<= main_~x~0 2)} is VALID [2020-07-08 12:13:17,656 INFO L263 TraceCheckUtils]: 5: Hoare triple {1314#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1310#true} is VALID [2020-07-08 12:13:17,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {1310#true} ~n := #in~n; {1399#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,657 INFO L280 TraceCheckUtils]: 7: Hoare triple {1399#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1399#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {1399#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1399#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,657 INFO L263 TraceCheckUtils]: 9: Hoare triple {1399#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {1310#true} ~n := #in~n; {1412#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {1412#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1416#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2020-07-08 12:13:17,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {1416#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume !(1 == ~n); {1420#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,659 INFO L263 TraceCheckUtils]: 13: Hoare triple {1420#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1310#true} is VALID [2020-07-08 12:13:17,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,660 INFO L280 TraceCheckUtils]: 15: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,660 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1310#true} {1420#(<= 2 |fibo2_#in~n|)} #53#return; {1420#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,661 INFO L280 TraceCheckUtils]: 18: Hoare triple {1420#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1420#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,661 INFO L263 TraceCheckUtils]: 19: Hoare triple {1420#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,661 INFO L280 TraceCheckUtils]: 21: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,661 INFO L280 TraceCheckUtils]: 22: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,662 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1310#true} {1420#(<= 2 |fibo2_#in~n|)} #55#return; {1420#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,662 INFO L280 TraceCheckUtils]: 24: Hoare triple {1420#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1420#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,663 INFO L280 TraceCheckUtils]: 25: Hoare triple {1420#(<= 2 |fibo2_#in~n|)} assume true; {1420#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 12:13:17,664 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1420#(<= 2 |fibo2_#in~n|)} {1399#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {1463#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,664 INFO L280 TraceCheckUtils]: 27: Hoare triple {1463#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1463#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,664 INFO L263 TraceCheckUtils]: 28: Hoare triple {1463#(<= 3 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {1310#true} is VALID [2020-07-08 12:13:17,664 INFO L280 TraceCheckUtils]: 29: Hoare triple {1310#true} ~n := #in~n; {1310#true} is VALID [2020-07-08 12:13:17,664 INFO L280 TraceCheckUtils]: 30: Hoare triple {1310#true} assume ~n < 1;#res := 0; {1310#true} is VALID [2020-07-08 12:13:17,665 INFO L280 TraceCheckUtils]: 31: Hoare triple {1310#true} assume true; {1310#true} is VALID [2020-07-08 12:13:17,665 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1310#true} {1463#(<= 3 |fibo1_#in~n|)} #59#return; {1463#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,666 INFO L280 TraceCheckUtils]: 33: Hoare triple {1463#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1463#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,666 INFO L280 TraceCheckUtils]: 34: Hoare triple {1463#(<= 3 |fibo1_#in~n|)} assume true; {1463#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 12:13:17,668 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1463#(<= 3 |fibo1_#in~n|)} {1314#(<= main_~x~0 2)} #51#return; {1311#false} is VALID [2020-07-08 12:13:17,668 INFO L280 TraceCheckUtils]: 36: Hoare triple {1311#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1311#false} is VALID [2020-07-08 12:13:17,668 INFO L280 TraceCheckUtils]: 37: Hoare triple {1311#false} assume 1 != ~result~0; {1311#false} is VALID [2020-07-08 12:13:17,668 INFO L280 TraceCheckUtils]: 38: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2020-07-08 12:13:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 12:13:17,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:13:17,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-08 12:13:17,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648609409] [2020-07-08 12:13:17,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-08 12:13:17,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:13:17,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 12:13:17,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 12:13:17,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:13:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 12:13:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:13:17,750 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 12 states. [2020-07-08 12:13:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:18,418 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2020-07-08 12:13:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:13:18,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-08 12:13:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:13:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:13:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-08 12:13:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:13:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-08 12:13:18,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2020-07-08 12:13:18,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:13:18,515 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:13:18,516 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:13:18,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-07-08 12:13:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:13:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:13:18,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:13:18,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:13:18,519 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:13:18,519 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:13:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:18,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:13:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:13:18,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:18,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:18,520 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:13:18,520 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:13:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:13:18,521 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:13:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:13:18,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:18,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:13:18,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:13:18,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:13:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:13:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:13:18,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-07-08 12:13:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:13:18,522 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:13:18,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 12:13:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:13:18,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:13:18,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:13:18,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:13:18,919 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:13:18,919 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:13:18,919 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:13:18,919 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:13:18,919 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:13:18,919 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:13:18,920 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-08 12:13:18,920 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-08 12:13:18,920 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2020-07-08 12:13:18,920 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2020-07-08 12:13:18,920 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-08 12:13:18,920 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-08 12:13:18,920 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 2) (<= 2 main_~x~0)) [2020-07-08 12:13:18,920 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-08 12:13:18,921 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-07-08 12:13:18,921 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-08 12:13:18,922 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-08 12:13:18,922 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-08 12:13:18,922 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0))) [2020-07-08 12:13:18,922 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-07-08 12:13:18,922 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-07-08 12:13:18,922 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-08 12:13:18,922 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-07-08 12:13:18,922 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-07-08 12:13:18,926 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:13:18,927 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:13:18,928 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:13:18,929 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:13:18,930 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:13:18,930 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-08 12:13:18,930 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:13:18,930 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:13:18,930 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-08 12:13:18,930 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:13:18,930 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:13:18,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:13:18 BoogieIcfgContainer [2020-07-08 12:13:18,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:13:18,937 INFO L168 Benchmark]: Toolchain (without parser) took 8182.75 ms. Allocated memory was 146.3 MB in the beginning and 293.6 MB in the end (delta: 147.3 MB). Free memory was 103.7 MB in the beginning and 161.4 MB in the end (delta: -57.7 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:13:18,938 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:13:18,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.79 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:13:18,939 INFO L168 Benchmark]: Boogie Preprocessor took 35.99 ms. Allocated memory is still 146.3 MB. Free memory was 93.7 MB in the beginning and 92.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:13:18,940 INFO L168 Benchmark]: RCFGBuilder took 514.30 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 92.4 MB in the beginning and 164.8 MB in the end (delta: -72.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:13:18,940 INFO L168 Benchmark]: TraceAbstraction took 7359.72 ms. Allocated memory was 204.5 MB in the beginning and 293.6 MB in the end (delta: 89.1 MB). Free memory was 163.8 MB in the beginning and 161.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:13:18,943 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.28 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.79 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.99 ms. Allocated memory is still 146.3 MB. Free memory was 93.7 MB in the beginning and 92.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 514.30 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 92.4 MB in the beginning and 164.8 MB in the end (delta: -72.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7359.72 ms. Allocated memory was 204.5 MB in the beginning and 293.6 MB in the end (delta: 89.1 MB). Free memory was 163.8 MB in the beginning and 161.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: 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 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 168 SDtfs, 95 SDslu, 767 SDs, 0 SdLazy, 457 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 50 PreInvPairs, 59 NumberOfFragments, 55 HoareAnnotationTreeSize, 50 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 15383 SizeOfPredicates, 10 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 36/58 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...