/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:01:59,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:01:59,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:01:59,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:01:59,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:01:59,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:01:59,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:01:59,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:01:59,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:01:59,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:01:59,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:01:59,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:01:59,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:01:59,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:01:59,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:01:59,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:01:59,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:01:59,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:01:59,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:01:59,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:01:59,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:01:59,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:01:59,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:01:59,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:01:59,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:01:59,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:01:59,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:01:59,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:01:59,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:01:59,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:01:59,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:01:59,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:01:59,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:01:59,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:01:59,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:01:59,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:01:59,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:01:59,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:01:59,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:01:59,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:01:59,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:01:59,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:01:59,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:01:59,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:01:59,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:01:59,989 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:01:59,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:01:59,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:01:59,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:01:59,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:01:59,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:01:59,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:01:59,990 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:01:59,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:01:59,991 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:01:59,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:01:59,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:01:59,991 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:01:59,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:01:59,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:01:59,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:01:59,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:01:59,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:01:59,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:01:59,993 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:02:00,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:02:00,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:02:00,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:02:00,309 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:02:00,310 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:02:00,311 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 22:02:00,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55ef1685/62683f64b45f4612bfa01dfbf5109f79/FLAG7f7554b80 [2020-07-08 22:02:00,817 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:02:00,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-08 22:02:00,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55ef1685/62683f64b45f4612bfa01dfbf5109f79/FLAG7f7554b80 [2020-07-08 22:02:01,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55ef1685/62683f64b45f4612bfa01dfbf5109f79 [2020-07-08 22:02:01,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:02:01,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:02:01,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:02:01,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:02:01,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:02:01,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bb58da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01, skipping insertion in model container [2020-07-08 22:02:01,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:02:01,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:02:01,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:02:01,393 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:02:01,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:02:01,428 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:02:01,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01 WrapperNode [2020-07-08 22:02:01,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:02:01,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:02:01,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:02:01,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:02:01,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (1/1) ... [2020-07-08 22:02:01,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:02:01,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:02:01,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:02:01,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:02:01,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (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 22:02:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:02:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:02:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-08 22:02:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-08 22:02:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:02:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:02:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:02:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-08 22:02:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-08 22:02:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:02:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:02:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:02:01,963 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:02:01,963 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:02:01,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:02:01 BoogieIcfgContainer [2020-07-08 22:02:01,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:02:01,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:02:01,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:02:01,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:02:01,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:02:01" (1/3) ... [2020-07-08 22:02:01,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677c1a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:02:01, skipping insertion in model container [2020-07-08 22:02:01,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:02:01" (2/3) ... [2020-07-08 22:02:01,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677c1a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:02:01, skipping insertion in model container [2020-07-08 22:02:01,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:02:01" (3/3) ... [2020-07-08 22:02:01,981 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-07-08 22:02:01,995 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:02:02,010 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:02:02,040 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:02:02,092 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:02:02,093 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:02:02,093 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:02:02,093 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:02:02,093 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:02:02,094 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:02:02,094 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:02:02,094 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:02:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-08 22:02:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 22:02:02,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:02,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:02,161 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-08 22:02:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:02,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006887302] [2020-07-08 22:02:02,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:02,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:02:02,451 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-08 22:02:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:02,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:02,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:02,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:02,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:02,522 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-08 22:02:02,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2020-07-08 22:02:02,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:02:02,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-08 22:02:02,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2020-07-08 22:02:02,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} ~x~0 := 2; {52#(<= 2 main_~x~0)} is VALID [2020-07-08 22:02:02,526 INFO L263 TraceCheckUtils]: 5: Hoare triple {52#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {48#true} is VALID [2020-07-08 22:02:02,527 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:02,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:02,531 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:02,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:02,535 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-08 22:02:02,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {49#false} is VALID [2020-07-08 22:02:02,536 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#false} ~result~0 := #t~ret4; {49#false} is VALID [2020-07-08 22:02:02,537 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#false} havoc #t~ret4; {49#false} is VALID [2020-07-08 22:02:02,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#false} assume 1 != ~result~0; {49#false} is VALID [2020-07-08 22:02:02,538 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-08 22:02:02,540 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 22:02:02,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006887302] [2020-07-08 22:02:02,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:02:02,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:02:02,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935733827] [2020-07-08 22:02:02,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:02:02,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:02,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:02:02,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:02,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:02:02,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:02:02,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:02:02,606 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-08 22:02:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:03,082 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-08 22:02:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:02:03,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 22:02:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:02:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-08 22:02:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:02:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-08 22:02:03,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-08 22:02:03,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:03,262 INFO L225 Difference]: With dead ends: 58 [2020-07-08 22:02:03,263 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 22:02:03,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:02:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 22:02:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-08 22:02:03,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:03,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-08 22:02:03,356 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-08 22:02:03,356 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-08 22:02:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:03,364 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 22:02:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:02:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:03,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:03,366 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-08 22:02:03,366 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-08 22:02:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:03,372 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-08 22:02:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:02:03,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:03,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:03,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:03,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:02:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-08 22:02:03,380 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-08 22:02:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:03,381 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-08 22:02:03,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:02:03,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-08 22:02:03,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:02:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 22:02:03,445 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:03,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:03,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:02:03,445 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-08 22:02:03,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:03,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1388761426] [2020-07-08 22:02:03,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:03,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-08 22:02:03,490 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-08 22:02:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:03,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:03,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:03,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:02:03,556 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:02:03,557 INFO L280 TraceCheckUtils]: 4: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:02:03,558 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-08 22:02:03,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-08 22:02:03,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-08 22:02:03,559 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-08 22:02:03,559 INFO L263 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2020-07-08 22:02:03,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 2; {352#(<= 2 main_~x~0)} is VALID [2020-07-08 22:02:03,561 INFO L263 TraceCheckUtils]: 5: Hoare triple {352#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {348#true} is VALID [2020-07-08 22:02:03,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:03,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:03,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:02:03,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:02:03,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-08 22:02:03,566 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-08 22:02:03,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {349#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {349#false} is VALID [2020-07-08 22:02:03,566 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} ~result~0 := #t~ret4; {349#false} is VALID [2020-07-08 22:02:03,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {349#false} havoc #t~ret4; {349#false} is VALID [2020-07-08 22:02:03,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {349#false} assume 1 != ~result~0; {349#false} is VALID [2020-07-08 22:02:03,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-08 22:02:03,568 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 22:02:03,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1388761426] [2020-07-08 22:02:03,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:02:03,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:02:03,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723930701] [2020-07-08 22:02:03,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-08 22:02:03,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:03,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:02:03,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:03,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:02:03,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:02:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:02:03,593 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-08 22:02:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:03,838 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-08 22:02:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:02:03,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-08 22:02:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:02:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-08 22:02:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:02:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-08 22:02:03,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-08 22:02:03,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:03,917 INFO L225 Difference]: With dead ends: 50 [2020-07-08 22:02:03,918 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 22:02:03,919 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 22:02:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 22:02:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-08 22:02:03,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:03,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-08 22:02:03,964 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-08 22:02:03,964 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-08 22:02:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:03,969 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-08 22:02:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-08 22:02:03,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:03,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:03,971 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-08 22:02:03,971 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-08 22:02:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:03,976 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-08 22:02:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-08 22:02:03,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:03,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:03,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:03,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:02:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-08 22:02:03,982 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-08 22:02:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:03,982 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-08 22:02:03,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:02:03,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-08 22:02:04,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-08 22:02:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 22:02:04,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:04,061 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:04,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:02:04,062 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-08 22:02:04,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:04,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1135666153] [2020-07-08 22:02:04,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:04,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:02:04,115 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-08 22:02:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:04,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:04,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,213 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,215 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-08 22:02:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:04,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:02:04,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-08 22:02:04,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-08 22:02:04,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:02:04,227 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-08 22:02:04,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:02:04,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-08 22:02:04,229 INFO L280 TraceCheckUtils]: 2: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-08 22:02:04,229 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-08 22:02:04,230 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:04,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,234 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-08 22:02:04,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-08 22:02:04,234 INFO L263 TraceCheckUtils]: 10: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-08 22:02:04,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:02:04,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-08 22:02:04,235 INFO L280 TraceCheckUtils]: 13: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-08 22:02:04,235 INFO L280 TraceCheckUtils]: 14: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:02:04,236 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-08 22:02:04,236 INFO L280 TraceCheckUtils]: 16: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-08 22:02:04,236 INFO L280 TraceCheckUtils]: 17: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-08 22:02:04,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-08 22:02:04,237 INFO L280 TraceCheckUtils]: 19: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-08 22:02:04,237 INFO L280 TraceCheckUtils]: 20: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-08 22:02:04,238 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-08 22:02:04,239 INFO L263 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2020-07-08 22:02:04,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:02:04,239 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-08 22:02:04,240 INFO L263 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret5 := main(); {637#true} is VALID [2020-07-08 22:02:04,241 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 2; {641#(<= 2 main_~x~0)} is VALID [2020-07-08 22:02:04,241 INFO L263 TraceCheckUtils]: 5: Hoare triple {641#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {637#true} is VALID [2020-07-08 22:02:04,241 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:02:04,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-08 22:02:04,243 INFO L280 TraceCheckUtils]: 8: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-08 22:02:04,243 INFO L263 TraceCheckUtils]: 9: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-08 22:02:04,244 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:04,245 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,245 INFO L280 TraceCheckUtils]: 12: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,246 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-08 22:02:04,247 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-08 22:02:04,248 INFO L280 TraceCheckUtils]: 15: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-08 22:02:04,248 INFO L263 TraceCheckUtils]: 16: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-08 22:02:04,248 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-08 22:02:04,248 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-08 22:02:04,249 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-08 22:02:04,249 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-08 22:02:04,249 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-08 22:02:04,250 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-08 22:02:04,250 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-08 22:02:04,250 INFO L280 TraceCheckUtils]: 24: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-08 22:02:04,251 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-08 22:02:04,251 INFO L280 TraceCheckUtils]: 26: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-08 22:02:04,251 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-08 22:02:04,251 INFO L280 TraceCheckUtils]: 28: Hoare triple {638#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {638#false} is VALID [2020-07-08 22:02:04,252 INFO L280 TraceCheckUtils]: 29: Hoare triple {638#false} ~result~0 := #t~ret4; {638#false} is VALID [2020-07-08 22:02:04,252 INFO L280 TraceCheckUtils]: 30: Hoare triple {638#false} havoc #t~ret4; {638#false} is VALID [2020-07-08 22:02:04,252 INFO L280 TraceCheckUtils]: 31: Hoare triple {638#false} assume 1 != ~result~0; {638#false} is VALID [2020-07-08 22:02:04,253 INFO L280 TraceCheckUtils]: 32: Hoare triple {638#false} assume !false; {638#false} is VALID [2020-07-08 22:02:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 22:02:04,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1135666153] [2020-07-08 22:02:04,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:02:04,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 22:02:04,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051636119] [2020-07-08 22:02:04,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-08 22:02:04,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:04,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:02:04,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:04,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:02:04,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:02:04,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:02:04,293 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-08 22:02:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:04,615 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-08 22:02:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 22:02:04,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-08 22:02:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:02:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-08 22:02:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:02:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-08 22:02:04,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-08 22:02:04,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:04,756 INFO L225 Difference]: With dead ends: 82 [2020-07-08 22:02:04,756 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 22:02:04,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:02:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 22:02:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-08 22:02:04,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:04,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-08 22:02:04,827 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-08 22:02:04,827 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-08 22:02:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:04,833 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-08 22:02:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 22:02:04,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:04,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:04,835 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-08 22:02:04,835 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-08 22:02:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:04,842 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-08 22:02:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-08 22:02:04,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:04,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:04,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:04,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 22:02:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-08 22:02:04,852 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-08 22:02:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:04,852 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-08 22:02:04,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:02:04,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-08 22:02:04,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-08 22:02:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 22:02:04,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:04,921 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:04,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:02:04,921 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-08 22:02:04,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:04,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549904186] [2020-07-08 22:02:04,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:05,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-08 22:02:05,029 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1026#true} {1026#true} #59#return; {1026#true} is VALID [2020-07-08 22:02:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:05,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-08 22:02:05,167 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} assume 1 == ~n; {1026#true} is VALID [2020-07-08 22:02:05,168 INFO L280 TraceCheckUtils]: 3: Hoare triple {1026#true} #res := 1; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 22:02:05,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 22:02:05,170 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {1026#true} #69#return; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 22:02:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:05,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-08 22:02:05,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} #res := 0; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 22:02:05,200 INFO L280 TraceCheckUtils]: 3: Hoare triple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 22:02:05,203 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #71#return; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 22:02:05,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-08 22:02:05,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} assume !(1 == ~n); {1026#true} is VALID [2020-07-08 22:02:05,205 INFO L263 TraceCheckUtils]: 3: Hoare triple {1026#true} call #t~ret0 := fibo2(~n - 1); {1026#true} is VALID [2020-07-08 22:02:05,205 INFO L280 TraceCheckUtils]: 4: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-08 22:02:05,205 INFO L280 TraceCheckUtils]: 6: Hoare triple {1026#true} assume 1 == ~n; {1026#true} is VALID [2020-07-08 22:02:05,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {1026#true} #res := 1; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 22:02:05,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 22:02:05,209 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {1026#true} #69#return; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 22:02:05,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 22:02:05,211 INFO L263 TraceCheckUtils]: 11: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {1026#true} is VALID [2020-07-08 22:02:05,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-08 22:02:05,212 INFO L280 TraceCheckUtils]: 14: Hoare triple {1026#true} #res := 0; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 22:02:05,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 22:02:05,215 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #71#return; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 22:02:05,216 INFO L280 TraceCheckUtils]: 17: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 22:02:05,218 INFO L280 TraceCheckUtils]: 18: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} #res := #t~ret0 + #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,220 INFO L280 TraceCheckUtils]: 19: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret0; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,221 INFO L280 TraceCheckUtils]: 20: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,222 INFO L280 TraceCheckUtils]: 21: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,223 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {1026#true} #63#return; {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-08 22:02:05,224 INFO L263 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2020-07-08 22:02:05,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-08 22:02:05,225 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1026#true} {1026#true} #59#return; {1026#true} is VALID [2020-07-08 22:02:05,225 INFO L263 TraceCheckUtils]: 3: Hoare triple {1026#true} call #t~ret5 := main(); {1026#true} is VALID [2020-07-08 22:02:05,225 INFO L280 TraceCheckUtils]: 4: Hoare triple {1026#true} ~x~0 := 2; {1026#true} is VALID [2020-07-08 22:02:05,226 INFO L263 TraceCheckUtils]: 5: Hoare triple {1026#true} call #t~ret4 := fibo1(~x~0); {1026#true} is VALID [2020-07-08 22:02:05,226 INFO L280 TraceCheckUtils]: 6: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,226 INFO L280 TraceCheckUtils]: 7: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-08 22:02:05,226 INFO L280 TraceCheckUtils]: 8: Hoare triple {1026#true} assume !(1 == ~n); {1026#true} is VALID [2020-07-08 22:02:05,227 INFO L263 TraceCheckUtils]: 9: Hoare triple {1026#true} call #t~ret0 := fibo2(~n - 1); {1026#true} is VALID [2020-07-08 22:02:05,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-08 22:02:05,227 INFO L280 TraceCheckUtils]: 12: Hoare triple {1026#true} assume 1 == ~n; {1026#true} is VALID [2020-07-08 22:02:05,228 INFO L280 TraceCheckUtils]: 13: Hoare triple {1026#true} #res := 1; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 22:02:05,229 INFO L280 TraceCheckUtils]: 14: Hoare triple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-08 22:02:05,230 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {1026#true} #69#return; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 22:02:05,231 INFO L280 TraceCheckUtils]: 16: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-08 22:02:05,231 INFO L263 TraceCheckUtils]: 17: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {1026#true} is VALID [2020-07-08 22:02:05,231 INFO L280 TraceCheckUtils]: 18: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-08 22:02:05,231 INFO L280 TraceCheckUtils]: 19: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-08 22:02:05,232 INFO L280 TraceCheckUtils]: 20: Hoare triple {1026#true} #res := 0; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 22:02:05,233 INFO L280 TraceCheckUtils]: 21: Hoare triple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-08 22:02:05,234 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #71#return; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 22:02:05,235 INFO L280 TraceCheckUtils]: 23: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-08 22:02:05,236 INFO L280 TraceCheckUtils]: 24: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} #res := #t~ret0 + #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,237 INFO L280 TraceCheckUtils]: 25: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret0; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,237 INFO L280 TraceCheckUtils]: 26: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,238 INFO L280 TraceCheckUtils]: 27: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-08 22:02:05,239 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {1026#true} #63#return; {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-08 22:02:05,240 INFO L280 TraceCheckUtils]: 29: Hoare triple {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-08 22:02:05,241 INFO L280 TraceCheckUtils]: 30: Hoare triple {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} ~result~0 := #t~ret4; {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-08 22:02:05,241 INFO L280 TraceCheckUtils]: 31: Hoare triple {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} havoc #t~ret4; {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-08 22:02:05,242 INFO L280 TraceCheckUtils]: 32: Hoare triple {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {1027#false} is VALID [2020-07-08 22:02:05,242 INFO L280 TraceCheckUtils]: 33: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2020-07-08 22:02:05,245 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 22:02:05,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549904186] [2020-07-08 22:02:05,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:02:05,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 22:02:05,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992817235] [2020-07-08 22:02:05,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-07-08 22:02:05,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:05,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 22:02:05,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:05,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 22:02:05,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:05,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 22:02:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:02:05,285 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 9 states. [2020-07-08 22:02:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:05,851 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-08 22:02:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 22:02:05,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-07-08 22:02:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:02:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2020-07-08 22:02:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:02:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2020-07-08 22:02:05,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2020-07-08 22:02:05,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:05,966 INFO L225 Difference]: With dead ends: 65 [2020-07-08 22:02:05,967 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 22:02:05,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-08 22:02:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 22:02:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2020-07-08 22:02:06,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:06,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 52 states. [2020-07-08 22:02:06,053 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 52 states. [2020-07-08 22:02:06,053 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 52 states. [2020-07-08 22:02:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:06,063 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-07-08 22:02:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2020-07-08 22:02:06,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:06,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:06,064 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 59 states. [2020-07-08 22:02:06,065 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 59 states. [2020-07-08 22:02:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:06,072 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-07-08 22:02:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2020-07-08 22:02:06,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:06,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:06,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:06,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 22:02:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2020-07-08 22:02:06,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 34 [2020-07-08 22:02:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:06,082 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2020-07-08 22:02:06,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 22:02:06,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 63 transitions. [2020-07-08 22:02:06,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-07-08 22:02:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 22:02:06,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:06,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:06,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:02:06,171 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash 186293384, now seen corresponding path program 1 times [2020-07-08 22:02:06,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:06,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347252379] [2020-07-08 22:02:06,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:06,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {1431#true} assume true; {1431#true} is VALID [2020-07-08 22:02:06,228 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1431#true} {1431#true} #59#return; {1431#true} is VALID [2020-07-08 22:02:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:06,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {1431#true} ~n := #in~n; {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {1474#(<= |fibo2_#in~n| 1)} #res := 1; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {1474#(<= |fibo2_#in~n| 1)} assume true; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,315 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1474#(<= |fibo2_#in~n| 1)} {1431#true} #69#return; {1466#(<= fibo1_~n 2)} is VALID [2020-07-08 22:02:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:06,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {1431#true} ~n := #in~n; {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1475#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:06,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {1475#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume 1 == ~n; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {1476#(<= 1 |fibo2_#in~n|)} #res := 1; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,362 INFO L280 TraceCheckUtils]: 4: Hoare triple {1476#(<= 1 |fibo2_#in~n|)} assume true; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,363 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1476#(<= 1 |fibo2_#in~n|)} {1466#(<= fibo1_~n 2)} #71#return; {1432#false} is VALID [2020-07-08 22:02:06,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {1431#true} ~n := #in~n; {1431#true} is VALID [2020-07-08 22:02:06,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {1431#true} assume !(~n < 1); {1431#true} is VALID [2020-07-08 22:02:06,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {1431#true} assume !(1 == ~n); {1431#true} is VALID [2020-07-08 22:02:06,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {1431#true} call #t~ret0 := fibo2(~n - 1); {1431#true} is VALID [2020-07-08 22:02:06,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {1431#true} ~n := #in~n; {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {1474#(<= |fibo2_#in~n| 1)} #res := 1; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {1474#(<= |fibo2_#in~n| 1)} assume true; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,373 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1474#(<= |fibo2_#in~n| 1)} {1431#true} #69#return; {1466#(<= fibo1_~n 2)} is VALID [2020-07-08 22:02:06,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {1466#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1466#(<= fibo1_~n 2)} is VALID [2020-07-08 22:02:06,373 INFO L263 TraceCheckUtils]: 11: Hoare triple {1466#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {1431#true} is VALID [2020-07-08 22:02:06,374 INFO L280 TraceCheckUtils]: 12: Hoare triple {1431#true} ~n := #in~n; {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,375 INFO L280 TraceCheckUtils]: 13: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1475#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:06,375 INFO L280 TraceCheckUtils]: 14: Hoare triple {1475#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume 1 == ~n; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,376 INFO L280 TraceCheckUtils]: 15: Hoare triple {1476#(<= 1 |fibo2_#in~n|)} #res := 1; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,377 INFO L280 TraceCheckUtils]: 16: Hoare triple {1476#(<= 1 |fibo2_#in~n|)} assume true; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,378 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1476#(<= 1 |fibo2_#in~n|)} {1466#(<= fibo1_~n 2)} #71#return; {1432#false} is VALID [2020-07-08 22:02:06,378 INFO L280 TraceCheckUtils]: 18: Hoare triple {1432#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1432#false} is VALID [2020-07-08 22:02:06,378 INFO L280 TraceCheckUtils]: 19: Hoare triple {1432#false} #res := #t~ret0 + #t~ret1; {1432#false} is VALID [2020-07-08 22:02:06,378 INFO L280 TraceCheckUtils]: 20: Hoare triple {1432#false} havoc #t~ret0; {1432#false} is VALID [2020-07-08 22:02:06,379 INFO L280 TraceCheckUtils]: 21: Hoare triple {1432#false} havoc #t~ret1; {1432#false} is VALID [2020-07-08 22:02:06,379 INFO L280 TraceCheckUtils]: 22: Hoare triple {1432#false} assume true; {1432#false} is VALID [2020-07-08 22:02:06,379 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1432#false} {1435#(<= main_~x~0 2)} #63#return; {1432#false} is VALID [2020-07-08 22:02:06,380 INFO L263 TraceCheckUtils]: 0: Hoare triple {1431#true} call ULTIMATE.init(); {1431#true} is VALID [2020-07-08 22:02:06,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {1431#true} assume true; {1431#true} is VALID [2020-07-08 22:02:06,381 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1431#true} {1431#true} #59#return; {1431#true} is VALID [2020-07-08 22:02:06,381 INFO L263 TraceCheckUtils]: 3: Hoare triple {1431#true} call #t~ret5 := main(); {1431#true} is VALID [2020-07-08 22:02:06,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {1431#true} ~x~0 := 2; {1435#(<= main_~x~0 2)} is VALID [2020-07-08 22:02:06,383 INFO L263 TraceCheckUtils]: 5: Hoare triple {1435#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1431#true} is VALID [2020-07-08 22:02:06,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {1431#true} ~n := #in~n; {1431#true} is VALID [2020-07-08 22:02:06,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {1431#true} assume !(~n < 1); {1431#true} is VALID [2020-07-08 22:02:06,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {1431#true} assume !(1 == ~n); {1431#true} is VALID [2020-07-08 22:02:06,384 INFO L263 TraceCheckUtils]: 9: Hoare triple {1431#true} call #t~ret0 := fibo2(~n - 1); {1431#true} is VALID [2020-07-08 22:02:06,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {1431#true} ~n := #in~n; {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,385 INFO L280 TraceCheckUtils]: 11: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,386 INFO L280 TraceCheckUtils]: 12: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,387 INFO L280 TraceCheckUtils]: 13: Hoare triple {1474#(<= |fibo2_#in~n| 1)} #res := 1; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,388 INFO L280 TraceCheckUtils]: 14: Hoare triple {1474#(<= |fibo2_#in~n| 1)} assume true; {1474#(<= |fibo2_#in~n| 1)} is VALID [2020-07-08 22:02:06,389 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1474#(<= |fibo2_#in~n| 1)} {1431#true} #69#return; {1466#(<= fibo1_~n 2)} is VALID [2020-07-08 22:02:06,390 INFO L280 TraceCheckUtils]: 16: Hoare triple {1466#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1466#(<= fibo1_~n 2)} is VALID [2020-07-08 22:02:06,391 INFO L263 TraceCheckUtils]: 17: Hoare triple {1466#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {1431#true} is VALID [2020-07-08 22:02:06,391 INFO L280 TraceCheckUtils]: 18: Hoare triple {1431#true} ~n := #in~n; {1473#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,392 INFO L280 TraceCheckUtils]: 19: Hoare triple {1473#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1475#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:06,393 INFO L280 TraceCheckUtils]: 20: Hoare triple {1475#(and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume 1 == ~n; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,393 INFO L280 TraceCheckUtils]: 21: Hoare triple {1476#(<= 1 |fibo2_#in~n|)} #res := 1; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,394 INFO L280 TraceCheckUtils]: 22: Hoare triple {1476#(<= 1 |fibo2_#in~n|)} assume true; {1476#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:06,395 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1476#(<= 1 |fibo2_#in~n|)} {1466#(<= fibo1_~n 2)} #71#return; {1432#false} is VALID [2020-07-08 22:02:06,395 INFO L280 TraceCheckUtils]: 24: Hoare triple {1432#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1432#false} is VALID [2020-07-08 22:02:06,395 INFO L280 TraceCheckUtils]: 25: Hoare triple {1432#false} #res := #t~ret0 + #t~ret1; {1432#false} is VALID [2020-07-08 22:02:06,395 INFO L280 TraceCheckUtils]: 26: Hoare triple {1432#false} havoc #t~ret0; {1432#false} is VALID [2020-07-08 22:02:06,396 INFO L280 TraceCheckUtils]: 27: Hoare triple {1432#false} havoc #t~ret1; {1432#false} is VALID [2020-07-08 22:02:06,396 INFO L280 TraceCheckUtils]: 28: Hoare triple {1432#false} assume true; {1432#false} is VALID [2020-07-08 22:02:06,396 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1432#false} {1435#(<= main_~x~0 2)} #63#return; {1432#false} is VALID [2020-07-08 22:02:06,396 INFO L280 TraceCheckUtils]: 30: Hoare triple {1432#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1432#false} is VALID [2020-07-08 22:02:06,397 INFO L280 TraceCheckUtils]: 31: Hoare triple {1432#false} ~result~0 := #t~ret4; {1432#false} is VALID [2020-07-08 22:02:06,397 INFO L280 TraceCheckUtils]: 32: Hoare triple {1432#false} havoc #t~ret4; {1432#false} is VALID [2020-07-08 22:02:06,397 INFO L280 TraceCheckUtils]: 33: Hoare triple {1432#false} assume 1 != ~result~0; {1432#false} is VALID [2020-07-08 22:02:06,397 INFO L280 TraceCheckUtils]: 34: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2020-07-08 22:02:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 22:02:06,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347252379] [2020-07-08 22:02:06,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:02:06,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 22:02:06,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024703363] [2020-07-08 22:02:06,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-08 22:02:06,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:06,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 22:02:06,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:06,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 22:02:06,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 22:02:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:02:06,435 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 8 states. [2020-07-08 22:02:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:06,915 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2020-07-08 22:02:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 22:02:06,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-08 22:02:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:02:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2020-07-08 22:02:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:02:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2020-07-08 22:02:06,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2020-07-08 22:02:07,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:07,076 INFO L225 Difference]: With dead ends: 101 [2020-07-08 22:02:07,076 INFO L226 Difference]: Without dead ends: 54 [2020-07-08 22:02:07,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:02:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-08 22:02:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-08 22:02:07,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:07,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-08 22:02:07,176 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-08 22:02:07,176 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-08 22:02:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:07,180 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-08 22:02:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-07-08 22:02:07,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:07,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:07,181 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-08 22:02:07,181 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-08 22:02:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:07,184 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-08 22:02:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-07-08 22:02:07,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:07,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:07,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:07,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 22:02:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2020-07-08 22:02:07,189 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 35 [2020-07-08 22:02:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:07,189 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2020-07-08 22:02:07,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 22:02:07,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2020-07-08 22:02:07,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-07-08 22:02:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 22:02:07,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:07,263 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:07,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 22:02:07,264 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-07-08 22:02:07,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:07,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238800828] [2020-07-08 22:02:07,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,336 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1901#true} {1901#true} #59#return; {1901#true} is VALID [2020-07-08 22:02:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {1901#true} ~n := #in~n; {1984#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:07,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {1984#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {1985#(<= |fibo1_#in~n| 0)} #res := 0; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,477 INFO L280 TraceCheckUtils]: 3: Hoare triple {1985#(<= |fibo1_#in~n| 0)} assume true; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,479 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1985#(<= |fibo1_#in~n| 0)} {1973#(< 1 fibo2_~n)} #65#return; {1902#false} is VALID [2020-07-08 22:02:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,489 INFO L280 TraceCheckUtils]: 3: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,490 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1901#true} {1902#false} #67#return; {1902#false} is VALID [2020-07-08 22:02:07,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} assume !(~n < 1); {1972#(< 0 fibo2_~n)} is VALID [2020-07-08 22:02:07,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#(< 0 fibo2_~n)} assume !(1 == ~n); {1973#(< 1 fibo2_~n)} is VALID [2020-07-08 22:02:07,492 INFO L263 TraceCheckUtils]: 3: Hoare triple {1973#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1901#true} is VALID [2020-07-08 22:02:07,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {1901#true} ~n := #in~n; {1984#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:07,494 INFO L280 TraceCheckUtils]: 5: Hoare triple {1984#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {1985#(<= |fibo1_#in~n| 0)} #res := 0; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {1985#(<= |fibo1_#in~n| 0)} assume true; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,496 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1985#(<= |fibo1_#in~n| 0)} {1973#(< 1 fibo2_~n)} #65#return; {1902#false} is VALID [2020-07-08 22:02:07,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {1902#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,497 INFO L263 TraceCheckUtils]: 10: Hoare triple {1902#false} call #t~ret3 := fibo1(~n - 2); {1901#true} is VALID [2020-07-08 22:02:07,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,498 INFO L280 TraceCheckUtils]: 13: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,498 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1901#true} {1902#false} #67#return; {1902#false} is VALID [2020-07-08 22:02:07,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {1902#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {1902#false} #res := #t~ret2 + #t~ret3; {1902#false} is VALID [2020-07-08 22:02:07,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {1902#false} havoc #t~ret3; {1902#false} is VALID [2020-07-08 22:02:07,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {1902#false} havoc #t~ret2; {1902#false} is VALID [2020-07-08 22:02:07,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {1902#false} assume true; {1902#false} is VALID [2020-07-08 22:02:07,500 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1902#false} {1901#true} #69#return; {1902#false} is VALID [2020-07-08 22:02:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:07,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,509 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1901#true} {1902#false} #71#return; {1902#false} is VALID [2020-07-08 22:02:07,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} assume !(~n < 1); {1901#true} is VALID [2020-07-08 22:02:07,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {1901#true} assume !(1 == ~n); {1901#true} is VALID [2020-07-08 22:02:07,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {1901#true} call #t~ret0 := fibo2(~n - 1); {1901#true} is VALID [2020-07-08 22:02:07,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,512 INFO L280 TraceCheckUtils]: 5: Hoare triple {1901#true} assume !(~n < 1); {1972#(< 0 fibo2_~n)} is VALID [2020-07-08 22:02:07,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {1972#(< 0 fibo2_~n)} assume !(1 == ~n); {1973#(< 1 fibo2_~n)} is VALID [2020-07-08 22:02:07,513 INFO L263 TraceCheckUtils]: 7: Hoare triple {1973#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1901#true} is VALID [2020-07-08 22:02:07,513 INFO L280 TraceCheckUtils]: 8: Hoare triple {1901#true} ~n := #in~n; {1984#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:07,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {1984#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {1985#(<= |fibo1_#in~n| 0)} #res := 0; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {1985#(<= |fibo1_#in~n| 0)} assume true; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,519 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1985#(<= |fibo1_#in~n| 0)} {1973#(< 1 fibo2_~n)} #65#return; {1902#false} is VALID [2020-07-08 22:02:07,519 INFO L280 TraceCheckUtils]: 13: Hoare triple {1902#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,519 INFO L263 TraceCheckUtils]: 14: Hoare triple {1902#false} call #t~ret3 := fibo1(~n - 2); {1901#true} is VALID [2020-07-08 22:02:07,520 INFO L280 TraceCheckUtils]: 15: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,520 INFO L280 TraceCheckUtils]: 16: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,520 INFO L280 TraceCheckUtils]: 17: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,520 INFO L280 TraceCheckUtils]: 18: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,521 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1901#true} {1902#false} #67#return; {1902#false} is VALID [2020-07-08 22:02:07,521 INFO L280 TraceCheckUtils]: 20: Hoare triple {1902#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,521 INFO L280 TraceCheckUtils]: 21: Hoare triple {1902#false} #res := #t~ret2 + #t~ret3; {1902#false} is VALID [2020-07-08 22:02:07,521 INFO L280 TraceCheckUtils]: 22: Hoare triple {1902#false} havoc #t~ret3; {1902#false} is VALID [2020-07-08 22:02:07,521 INFO L280 TraceCheckUtils]: 23: Hoare triple {1902#false} havoc #t~ret2; {1902#false} is VALID [2020-07-08 22:02:07,522 INFO L280 TraceCheckUtils]: 24: Hoare triple {1902#false} assume true; {1902#false} is VALID [2020-07-08 22:02:07,522 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1902#false} {1901#true} #69#return; {1902#false} is VALID [2020-07-08 22:02:07,527 INFO L280 TraceCheckUtils]: 26: Hoare triple {1902#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,528 INFO L263 TraceCheckUtils]: 27: Hoare triple {1902#false} call #t~ret1 := fibo2(~n - 2); {1901#true} is VALID [2020-07-08 22:02:07,528 INFO L280 TraceCheckUtils]: 28: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,528 INFO L280 TraceCheckUtils]: 29: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,529 INFO L280 TraceCheckUtils]: 30: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,529 INFO L280 TraceCheckUtils]: 31: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,529 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1901#true} {1902#false} #71#return; {1902#false} is VALID [2020-07-08 22:02:07,529 INFO L280 TraceCheckUtils]: 33: Hoare triple {1902#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,529 INFO L280 TraceCheckUtils]: 34: Hoare triple {1902#false} #res := #t~ret0 + #t~ret1; {1902#false} is VALID [2020-07-08 22:02:07,530 INFO L280 TraceCheckUtils]: 35: Hoare triple {1902#false} havoc #t~ret0; {1902#false} is VALID [2020-07-08 22:02:07,530 INFO L280 TraceCheckUtils]: 36: Hoare triple {1902#false} havoc #t~ret1; {1902#false} is VALID [2020-07-08 22:02:07,530 INFO L280 TraceCheckUtils]: 37: Hoare triple {1902#false} assume true; {1902#false} is VALID [2020-07-08 22:02:07,532 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1902#false} {1905#(<= main_~x~0 2)} #63#return; {1902#false} is VALID [2020-07-08 22:02:07,534 INFO L263 TraceCheckUtils]: 0: Hoare triple {1901#true} call ULTIMATE.init(); {1901#true} is VALID [2020-07-08 22:02:07,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1901#true} {1901#true} #59#return; {1901#true} is VALID [2020-07-08 22:02:07,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {1901#true} call #t~ret5 := main(); {1901#true} is VALID [2020-07-08 22:02:07,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {1901#true} ~x~0 := 2; {1905#(<= main_~x~0 2)} is VALID [2020-07-08 22:02:07,537 INFO L263 TraceCheckUtils]: 5: Hoare triple {1905#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1901#true} is VALID [2020-07-08 22:02:07,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {1901#true} assume !(~n < 1); {1901#true} is VALID [2020-07-08 22:02:07,538 INFO L280 TraceCheckUtils]: 8: Hoare triple {1901#true} assume !(1 == ~n); {1901#true} is VALID [2020-07-08 22:02:07,538 INFO L263 TraceCheckUtils]: 9: Hoare triple {1901#true} call #t~ret0 := fibo2(~n - 1); {1901#true} is VALID [2020-07-08 22:02:07,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {1901#true} assume !(~n < 1); {1972#(< 0 fibo2_~n)} is VALID [2020-07-08 22:02:07,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {1972#(< 0 fibo2_~n)} assume !(1 == ~n); {1973#(< 1 fibo2_~n)} is VALID [2020-07-08 22:02:07,542 INFO L263 TraceCheckUtils]: 13: Hoare triple {1973#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1901#true} is VALID [2020-07-08 22:02:07,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {1901#true} ~n := #in~n; {1984#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:07,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {1984#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,544 INFO L280 TraceCheckUtils]: 16: Hoare triple {1985#(<= |fibo1_#in~n| 0)} #res := 0; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,545 INFO L280 TraceCheckUtils]: 17: Hoare triple {1985#(<= |fibo1_#in~n| 0)} assume true; {1985#(<= |fibo1_#in~n| 0)} is VALID [2020-07-08 22:02:07,546 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1985#(<= |fibo1_#in~n| 0)} {1973#(< 1 fibo2_~n)} #65#return; {1902#false} is VALID [2020-07-08 22:02:07,546 INFO L280 TraceCheckUtils]: 19: Hoare triple {1902#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,547 INFO L263 TraceCheckUtils]: 20: Hoare triple {1902#false} call #t~ret3 := fibo1(~n - 2); {1901#true} is VALID [2020-07-08 22:02:07,547 INFO L280 TraceCheckUtils]: 21: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,547 INFO L280 TraceCheckUtils]: 22: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,547 INFO L280 TraceCheckUtils]: 23: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,547 INFO L280 TraceCheckUtils]: 24: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,548 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1901#true} {1902#false} #67#return; {1902#false} is VALID [2020-07-08 22:02:07,548 INFO L280 TraceCheckUtils]: 26: Hoare triple {1902#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,548 INFO L280 TraceCheckUtils]: 27: Hoare triple {1902#false} #res := #t~ret2 + #t~ret3; {1902#false} is VALID [2020-07-08 22:02:07,548 INFO L280 TraceCheckUtils]: 28: Hoare triple {1902#false} havoc #t~ret3; {1902#false} is VALID [2020-07-08 22:02:07,548 INFO L280 TraceCheckUtils]: 29: Hoare triple {1902#false} havoc #t~ret2; {1902#false} is VALID [2020-07-08 22:02:07,549 INFO L280 TraceCheckUtils]: 30: Hoare triple {1902#false} assume true; {1902#false} is VALID [2020-07-08 22:02:07,549 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1902#false} {1901#true} #69#return; {1902#false} is VALID [2020-07-08 22:02:07,549 INFO L280 TraceCheckUtils]: 32: Hoare triple {1902#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,549 INFO L263 TraceCheckUtils]: 33: Hoare triple {1902#false} call #t~ret1 := fibo2(~n - 2); {1901#true} is VALID [2020-07-08 22:02:07,550 INFO L280 TraceCheckUtils]: 34: Hoare triple {1901#true} ~n := #in~n; {1901#true} is VALID [2020-07-08 22:02:07,550 INFO L280 TraceCheckUtils]: 35: Hoare triple {1901#true} assume ~n < 1; {1901#true} is VALID [2020-07-08 22:02:07,550 INFO L280 TraceCheckUtils]: 36: Hoare triple {1901#true} #res := 0; {1901#true} is VALID [2020-07-08 22:02:07,550 INFO L280 TraceCheckUtils]: 37: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-08 22:02:07,550 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1901#true} {1902#false} #71#return; {1902#false} is VALID [2020-07-08 22:02:07,551 INFO L280 TraceCheckUtils]: 39: Hoare triple {1902#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,551 INFO L280 TraceCheckUtils]: 40: Hoare triple {1902#false} #res := #t~ret0 + #t~ret1; {1902#false} is VALID [2020-07-08 22:02:07,551 INFO L280 TraceCheckUtils]: 41: Hoare triple {1902#false} havoc #t~ret0; {1902#false} is VALID [2020-07-08 22:02:07,553 INFO L280 TraceCheckUtils]: 42: Hoare triple {1902#false} havoc #t~ret1; {1902#false} is VALID [2020-07-08 22:02:07,553 INFO L280 TraceCheckUtils]: 43: Hoare triple {1902#false} assume true; {1902#false} is VALID [2020-07-08 22:02:07,554 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1902#false} {1905#(<= main_~x~0 2)} #63#return; {1902#false} is VALID [2020-07-08 22:02:07,554 INFO L280 TraceCheckUtils]: 45: Hoare triple {1902#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1902#false} is VALID [2020-07-08 22:02:07,554 INFO L280 TraceCheckUtils]: 46: Hoare triple {1902#false} ~result~0 := #t~ret4; {1902#false} is VALID [2020-07-08 22:02:07,554 INFO L280 TraceCheckUtils]: 47: Hoare triple {1902#false} havoc #t~ret4; {1902#false} is VALID [2020-07-08 22:02:07,555 INFO L280 TraceCheckUtils]: 48: Hoare triple {1902#false} assume 1 != ~result~0; {1902#false} is VALID [2020-07-08 22:02:07,555 INFO L280 TraceCheckUtils]: 49: Hoare triple {1902#false} assume !false; {1902#false} is VALID [2020-07-08 22:02:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 22:02:07,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238800828] [2020-07-08 22:02:07,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:02:07,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 22:02:07,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908658012] [2020-07-08 22:02:07,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2020-07-08 22:02:07,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:07,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:02:07,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:07,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:02:07,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:02:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:02:07,610 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2020-07-08 22:02:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:07,965 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2020-07-08 22:02:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 22:02:07,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2020-07-08 22:02:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:02:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-08 22:02:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:02:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-08 22:02:07,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 98 transitions. [2020-07-08 22:02:08,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:08,090 INFO L225 Difference]: With dead ends: 104 [2020-07-08 22:02:08,090 INFO L226 Difference]: Without dead ends: 56 [2020-07-08 22:02:08,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:02:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-08 22:02:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-08 22:02:08,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:08,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-08 22:02:08,192 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-08 22:02:08,192 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-08 22:02:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:08,196 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-08 22:02:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-07-08 22:02:08,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:08,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:08,197 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-08 22:02:08,197 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-08 22:02:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:08,200 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-08 22:02:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-07-08 22:02:08,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:08,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:08,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:08,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 22:02:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-07-08 22:02:08,205 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 50 [2020-07-08 22:02:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:08,205 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-07-08 22:02:08,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:02:08,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 65 transitions. [2020-07-08 22:02:08,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-07-08 22:02:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 22:02:08,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:02:08,298 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:02:08,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 22:02:08,299 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:02:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:02:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-07-08 22:02:08,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:02:08,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393372767] [2020-07-08 22:02:08,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:02:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,347 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2422#true} {2422#true} #59#return; {2422#true} is VALID [2020-07-08 22:02:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {2422#true} assume !(~n < 1); {2422#true} is VALID [2020-07-08 22:02:08,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {2422#true} assume 1 == ~n; {2422#true} is VALID [2020-07-08 22:02:08,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {2422#true} #res := 1; {2422#true} is VALID [2020-07-08 22:02:08,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,482 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #65#return; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,493 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #67#return; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {2422#true} ~n := #in~n; {2498#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {2498#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2499#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {2499#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,498 INFO L263 TraceCheckUtils]: 3: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret2 := fibo1(~n - 1); {2422#true} is VALID [2020-07-08 22:02:08,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {2422#true} assume !(~n < 1); {2422#true} is VALID [2020-07-08 22:02:08,499 INFO L280 TraceCheckUtils]: 6: Hoare triple {2422#true} assume 1 == ~n; {2422#true} is VALID [2020-07-08 22:02:08,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {2422#true} #res := 1; {2422#true} is VALID [2020-07-08 22:02:08,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,500 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #65#return; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,500 INFO L280 TraceCheckUtils]: 10: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,500 INFO L263 TraceCheckUtils]: 11: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {2422#true} is VALID [2020-07-08 22:02:08,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,501 INFO L280 TraceCheckUtils]: 15: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,502 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #67#return; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,503 INFO L280 TraceCheckUtils]: 19: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,503 INFO L280 TraceCheckUtils]: 20: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,504 INFO L280 TraceCheckUtils]: 21: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} assume true; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,504 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2512#(<= 2 |fibo2_#in~n|)} {2467#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-08 22:02:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:02:08,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,511 INFO L280 TraceCheckUtils]: 3: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,512 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2422#true} {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} #71#return; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {2422#true} ~n := #in~n; {2467#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {2467#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2467#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {2467#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {2467#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,514 INFO L263 TraceCheckUtils]: 3: Hoare triple {2467#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2422#true} is VALID [2020-07-08 22:02:08,514 INFO L280 TraceCheckUtils]: 4: Hoare triple {2422#true} ~n := #in~n; {2498#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,515 INFO L280 TraceCheckUtils]: 5: Hoare triple {2498#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2499#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,516 INFO L280 TraceCheckUtils]: 6: Hoare triple {2499#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,516 INFO L263 TraceCheckUtils]: 7: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret2 := fibo1(~n - 1); {2422#true} is VALID [2020-07-08 22:02:08,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {2422#true} assume !(~n < 1); {2422#true} is VALID [2020-07-08 22:02:08,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {2422#true} assume 1 == ~n; {2422#true} is VALID [2020-07-08 22:02:08,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {2422#true} #res := 1; {2422#true} is VALID [2020-07-08 22:02:08,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,518 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #65#return; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,518 INFO L280 TraceCheckUtils]: 14: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,518 INFO L263 TraceCheckUtils]: 15: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {2422#true} is VALID [2020-07-08 22:02:08,518 INFO L280 TraceCheckUtils]: 16: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,519 INFO L280 TraceCheckUtils]: 17: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,519 INFO L280 TraceCheckUtils]: 18: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,519 INFO L280 TraceCheckUtils]: 19: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,520 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #67#return; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,520 INFO L280 TraceCheckUtils]: 21: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,521 INFO L280 TraceCheckUtils]: 23: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,521 INFO L280 TraceCheckUtils]: 24: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,522 INFO L280 TraceCheckUtils]: 25: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} assume true; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,522 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2512#(<= 2 |fibo2_#in~n|)} {2467#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-08 22:02:08,523 INFO L280 TraceCheckUtils]: 27: Hoare triple {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-08 22:02:08,523 INFO L263 TraceCheckUtils]: 28: Hoare triple {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} call #t~ret1 := fibo2(~n - 2); {2422#true} is VALID [2020-07-08 22:02:08,523 INFO L280 TraceCheckUtils]: 29: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,523 INFO L280 TraceCheckUtils]: 30: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,523 INFO L280 TraceCheckUtils]: 31: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,524 INFO L280 TraceCheckUtils]: 32: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,524 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2422#true} {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} #71#return; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,525 INFO L280 TraceCheckUtils]: 34: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,525 INFO L280 TraceCheckUtils]: 35: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,525 INFO L280 TraceCheckUtils]: 36: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} havoc #t~ret0; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,526 INFO L280 TraceCheckUtils]: 37: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} havoc #t~ret1; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,526 INFO L280 TraceCheckUtils]: 38: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} assume true; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,527 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2497#(<= 3 |fibo1_#in~n|)} {2426#(<= main_~x~0 2)} #63#return; {2423#false} is VALID [2020-07-08 22:02:08,528 INFO L263 TraceCheckUtils]: 0: Hoare triple {2422#true} call ULTIMATE.init(); {2422#true} is VALID [2020-07-08 22:02:08,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,528 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2422#true} {2422#true} #59#return; {2422#true} is VALID [2020-07-08 22:02:08,529 INFO L263 TraceCheckUtils]: 3: Hoare triple {2422#true} call #t~ret5 := main(); {2422#true} is VALID [2020-07-08 22:02:08,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {2422#true} ~x~0 := 2; {2426#(<= main_~x~0 2)} is VALID [2020-07-08 22:02:08,529 INFO L263 TraceCheckUtils]: 5: Hoare triple {2426#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {2422#true} is VALID [2020-07-08 22:02:08,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {2422#true} ~n := #in~n; {2467#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,530 INFO L280 TraceCheckUtils]: 7: Hoare triple {2467#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2467#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {2467#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {2467#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,530 INFO L263 TraceCheckUtils]: 9: Hoare triple {2467#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2422#true} is VALID [2020-07-08 22:02:08,531 INFO L280 TraceCheckUtils]: 10: Hoare triple {2422#true} ~n := #in~n; {2498#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,531 INFO L280 TraceCheckUtils]: 11: Hoare triple {2498#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2499#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,532 INFO L280 TraceCheckUtils]: 12: Hoare triple {2499#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,532 INFO L263 TraceCheckUtils]: 13: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret2 := fibo1(~n - 1); {2422#true} is VALID [2020-07-08 22:02:08,532 INFO L280 TraceCheckUtils]: 14: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,532 INFO L280 TraceCheckUtils]: 15: Hoare triple {2422#true} assume !(~n < 1); {2422#true} is VALID [2020-07-08 22:02:08,532 INFO L280 TraceCheckUtils]: 16: Hoare triple {2422#true} assume 1 == ~n; {2422#true} is VALID [2020-07-08 22:02:08,533 INFO L280 TraceCheckUtils]: 17: Hoare triple {2422#true} #res := 1; {2422#true} is VALID [2020-07-08 22:02:08,533 INFO L280 TraceCheckUtils]: 18: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,533 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #65#return; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,534 INFO L280 TraceCheckUtils]: 20: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-08 22:02:08,534 INFO L263 TraceCheckUtils]: 21: Hoare triple {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret3 := fibo1(~n - 2); {2422#true} is VALID [2020-07-08 22:02:08,534 INFO L280 TraceCheckUtils]: 22: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,534 INFO L280 TraceCheckUtils]: 23: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,534 INFO L280 TraceCheckUtils]: 24: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,534 INFO L280 TraceCheckUtils]: 25: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,535 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2422#true} {2500#(and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #67#return; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,536 INFO L280 TraceCheckUtils]: 27: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,536 INFO L280 TraceCheckUtils]: 28: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,536 INFO L280 TraceCheckUtils]: 29: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,537 INFO L280 TraceCheckUtils]: 30: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,537 INFO L280 TraceCheckUtils]: 31: Hoare triple {2512#(<= 2 |fibo2_#in~n|)} assume true; {2512#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-08 22:02:08,543 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2512#(<= 2 |fibo2_#in~n|)} {2467#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-08 22:02:08,544 INFO L280 TraceCheckUtils]: 33: Hoare triple {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-08 22:02:08,544 INFO L263 TraceCheckUtils]: 34: Hoare triple {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} call #t~ret1 := fibo2(~n - 2); {2422#true} is VALID [2020-07-08 22:02:08,544 INFO L280 TraceCheckUtils]: 35: Hoare triple {2422#true} ~n := #in~n; {2422#true} is VALID [2020-07-08 22:02:08,544 INFO L280 TraceCheckUtils]: 36: Hoare triple {2422#true} assume ~n < 1; {2422#true} is VALID [2020-07-08 22:02:08,544 INFO L280 TraceCheckUtils]: 37: Hoare triple {2422#true} #res := 0; {2422#true} is VALID [2020-07-08 22:02:08,544 INFO L280 TraceCheckUtils]: 38: Hoare triple {2422#true} assume true; {2422#true} is VALID [2020-07-08 22:02:08,545 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2422#true} {2491#(and (<= 3 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} #71#return; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,546 INFO L280 TraceCheckUtils]: 40: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,546 INFO L280 TraceCheckUtils]: 41: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,546 INFO L280 TraceCheckUtils]: 42: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} havoc #t~ret0; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,547 INFO L280 TraceCheckUtils]: 43: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} havoc #t~ret1; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,547 INFO L280 TraceCheckUtils]: 44: Hoare triple {2497#(<= 3 |fibo1_#in~n|)} assume true; {2497#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-08 22:02:08,554 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2497#(<= 3 |fibo1_#in~n|)} {2426#(<= main_~x~0 2)} #63#return; {2423#false} is VALID [2020-07-08 22:02:08,554 INFO L280 TraceCheckUtils]: 46: Hoare triple {2423#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2423#false} is VALID [2020-07-08 22:02:08,555 INFO L280 TraceCheckUtils]: 47: Hoare triple {2423#false} ~result~0 := #t~ret4; {2423#false} is VALID [2020-07-08 22:02:08,555 INFO L280 TraceCheckUtils]: 48: Hoare triple {2423#false} havoc #t~ret4; {2423#false} is VALID [2020-07-08 22:02:08,555 INFO L280 TraceCheckUtils]: 49: Hoare triple {2423#false} assume 1 != ~result~0; {2423#false} is VALID [2020-07-08 22:02:08,555 INFO L280 TraceCheckUtils]: 50: Hoare triple {2423#false} assume !false; {2423#false} is VALID [2020-07-08 22:02:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 22:02:08,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393372767] [2020-07-08 22:02:08,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:02:08,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 22:02:08,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114036237] [2020-07-08 22:02:08,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-08 22:02:08,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:02:08,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 22:02:08,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:08,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 22:02:08,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:02:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 22:02:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:02:08,603 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 10 states. [2020-07-08 22:02:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:09,116 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-08 22:02:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 22:02:09,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2020-07-08 22:02:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:02:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:02:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2020-07-08 22:02:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:02:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2020-07-08 22:02:09,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2020-07-08 22:02:09,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:09,194 INFO L225 Difference]: With dead ends: 56 [2020-07-08 22:02:09,194 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:02:09,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:02:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:02:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:02:09,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:02:09,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:02:09,197 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:02:09,198 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:02:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:09,198 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:02:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:02:09,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:09,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:09,198 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:02:09,199 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:02:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:02:09,199 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:02:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:02:09,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:09,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:02:09,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:02:09,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:02:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:02:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:02:09,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-08 22:02:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:02:09,200 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:02:09,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 22:02:09,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:02:09,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:02:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:02:09,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:02:09,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 22:02:09,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:02:10,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:02:10,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:02:10,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:02:10,448 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:02:10,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:02:10,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:02:10,449 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-07-08 22:02:10,449 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-08 22:02:10,449 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 2 main_~x~0) [2020-07-08 22:02:10,450 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 2 main_~x~0) [2020-07-08 22:02:10,451 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-07-08 22:02:10,451 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~result~0 1) (< 0 main_~result~0) (<= 2 main_~x~0)) [2020-07-08 22:02:10,451 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 22:02:10,451 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1) (<= 2 main_~x~0)) [2020-07-08 22:02:10,451 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 2 main_~x~0) [2020-07-08 22:02:10,452 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1) (<= 2 main_~x~0)) [2020-07-08 22:02:10,452 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= main_~result~0 1) (<= |main_#t~ret4| 1) (< 0 main_~result~0) (<= 2 main_~x~0)) [2020-07-08 22:02:10,452 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-08 22:02:10,452 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 22:02:10,456 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,456 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= |fibo2_#in~n| 1) (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,456 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 22:02:10,456 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (<= 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,456 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,457 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= |fibo2_#in~n| 0) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,457 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,457 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-07-08 22:02:10,457 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,457 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-08 22:02:10,458 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (< 1 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 0) (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|) .cse0) (and (<= 1 |fibo2_#res|) (<= 1 fibo2_~n) (<= |fibo2_#res| 1) .cse0))) [2020-07-08 22:02:10,458 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (< 1 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 0) (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|) .cse0) (and (<= 1 |fibo2_#res|) (<= 1 fibo2_~n) (<= |fibo2_#res| 1) .cse0))) [2020-07-08 22:02:10,458 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-08 22:02:10,458 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 22:02:10,459 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0) (and (<= 3 fibo1_~n) .cse0))) [2020-07-08 22:02:10,459 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-08 22:02:10,459 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0) (and (<= 3 fibo1_~n) .cse0))) [2020-07-08 22:02:10,459 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 fibo1_~n) .cse0) (and (<= |fibo1_#in~n| 1) .cse0) (and .cse0 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))) [2020-07-08 22:02:10,459 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-08 22:02:10,459 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) (<= 1 .cse0) .cse1 (<= .cse0 1))) (and (<= 3 fibo1_~n) .cse1))) [2020-07-08 22:02:10,459 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (<= |fibo1_#in~n| 0)) [2020-07-08 22:02:10,460 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) (<= 1 .cse0) .cse1 (<= .cse0 1))) (and (<= 3 fibo1_~n) .cse1))) [2020-07-08 22:02:10,460 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-07-08 22:02:10,460 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) (<= 1 .cse0) .cse1 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1) (<= .cse0 1))) (and (<= 3 fibo1_~n) .cse1))) [2020-07-08 22:02:10,460 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (< 1 fibo1_~n) .cse0 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)) (and (<= 3 fibo1_~n) .cse0))) [2020-07-08 22:02:10,460 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 fibo1_~n) .cse0) (and (<= |fibo1_#in~n| 1) .cse0) (and .cse0 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))) [2020-07-08 22:02:10,491 INFO L163 areAnnotationChecker]: CFG has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:02:10,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:02:10 BoogieIcfgContainer [2020-07-08 22:02:10,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:02:10,515 INFO L168 Benchmark]: Toolchain (without parser) took 9340.37 ms. Allocated memory was 136.8 MB in the beginning and 332.9 MB in the end (delta: 196.1 MB). Free memory was 100.6 MB in the beginning and 274.4 MB in the end (delta: -173.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:02:10,521 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 22:02:10,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.94 ms. Allocated memory is still 136.8 MB. Free memory was 100.4 MB in the beginning and 90.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:02:10,524 INFO L168 Benchmark]: Boogie Preprocessor took 124.09 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 90.6 MB in the beginning and 181.0 MB in the end (delta: -90.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:02:10,524 INFO L168 Benchmark]: RCFGBuilder took 415.53 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 159.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-07-08 22:02:10,525 INFO L168 Benchmark]: TraceAbstraction took 8539.85 ms. Allocated memory was 201.9 MB in the beginning and 332.9 MB in the end (delta: 131.1 MB). Free memory was 158.9 MB in the beginning and 274.4 MB in the end (delta: -115.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:02:10,534 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.94 ms. Allocated memory is still 136.8 MB. Free memory was 100.4 MB in the beginning and 90.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.09 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 90.6 MB in the beginning and 181.0 MB in the end (delta: -90.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.53 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 159.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8539.85 ms. Allocated memory was 201.9 MB in the beginning and 332.9 MB in the end (delta: 131.1 MB). Free memory was 158.9 MB in the beginning and 274.4 MB in the end (delta: -115.5 MB). Peak memory consumption was 15.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 - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 2 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((1 < n && n == \old(n)) || (((\old(n) <= 0 && \result <= 0) && 0 <= \result) && n == \old(n))) || (((1 <= \result && 1 <= n) && \result <= 1) && n == \old(n)) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((3 <= n && n == \old(n)) || (\old(n) <= 1 && n == \old(n))) || ((n == \old(n) && 1 <= \result) && \result <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 294 SDtfs, 191 SDslu, 1055 SDs, 0 SdLazy, 376 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 297 PreInvPairs, 434 NumberOfFragments, 463 HoareAnnotationTreeSize, 297 FomulaSimplifications, 2012 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 613 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 18079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 28/49 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...