/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:53:07,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:53:07,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:53:07,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:53:07,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:53:07,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:53:07,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:53:07,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:53:07,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:53:07,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:53:07,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:53:07,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:53:07,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:53:07,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:53:07,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:53:07,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:53:07,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:53:07,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:53:07,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:53:07,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:53:07,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:53:07,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:53:07,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:53:07,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:53:07,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:53:07,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:53:07,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:53:07,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:53:07,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:53:07,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:53:07,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:53:07,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:53:07,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:53:07,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:53:07,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:53:07,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:53:07,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:53:07,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:53:07,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:53:07,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:53:07,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:53:07,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:53:07,515 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:53:07,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:53:07,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:53:07,517 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:53:07,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:53:07,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:53:07,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:53:07,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:53:07,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:53:07,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:53:07,518 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:53:07,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:53:07,519 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:53:07,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:53:07,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:53:07,519 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:53:07,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:53:07,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:53:07,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:53:07,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:53:07,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:53:07,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:53:07,521 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-18 04:53:07,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:53:07,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:53:07,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:53:07,860 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:53:07,861 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:53:07,861 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c [2020-07-18 04:53:07,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d30b404/dcdde094497f4b7a9e97600d8128e225/FLAGd25151dde [2020-07-18 04:53:08,510 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:53:08,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c [2020-07-18 04:53:08,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d30b404/dcdde094497f4b7a9e97600d8128e225/FLAGd25151dde [2020-07-18 04:53:08,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d30b404/dcdde094497f4b7a9e97600d8128e225 [2020-07-18 04:53:08,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:53:08,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:53:08,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:53:08,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:53:08,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:53:08,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:53:08" (1/1) ... [2020-07-18 04:53:08,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfc0b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:08, skipping insertion in model container [2020-07-18 04:53:08,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:53:08" (1/1) ... [2020-07-18 04:53:08,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:53:08,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:53:09,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:53:09,111 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:53:09,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:53:09,149 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:53:09,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09 WrapperNode [2020-07-18 04:53:09,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:53:09,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:53:09,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:53:09,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:53:09,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:53:09,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:53:09,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:53:09,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:53:09,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (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-18 04:53:09,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:53:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:53:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-18 04:53:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-18 04:53:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:53:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:53:09,723 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:53:09,724 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:53:09,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:53:09 BoogieIcfgContainer [2020-07-18 04:53:09,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:53:09,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:53:09,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:53:09,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:53:09,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:53:08" (1/3) ... [2020-07-18 04:53:09,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6757df68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:53:09, skipping insertion in model container [2020-07-18 04:53:09,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (2/3) ... [2020-07-18 04:53:09,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6757df68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:53:09, skipping insertion in model container [2020-07-18 04:53:09,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:53:09" (3/3) ... [2020-07-18 04:53:09,744 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2020-07-18 04:53:09,758 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:53:09,767 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:53:09,785 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:53:09,812 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:53:09,812 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:53:09,812 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:53:09,813 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:53:09,813 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:53:09,813 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:53:09,813 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:53:09,814 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:53:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-18 04:53:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-18 04:53:09,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:09,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:09,848 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-18 04:53:09,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:09,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267987284] [2020-07-18 04:53:09,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:10,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 04:53:10,072 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-18 04:53:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:10,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:10,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,156 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,159 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-18 04:53:10,161 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2020-07-18 04:53:10,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 04:53:10,162 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-18 04:53:10,162 INFO L263 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2020-07-18 04:53:10,164 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} ~x~0 := 2; {52#(<= 2 main_~x~0)} is VALID [2020-07-18 04:53:10,164 INFO L263 TraceCheckUtils]: 5: Hoare triple {52#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {48#true} is VALID [2020-07-18 04:53:10,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:10,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,170 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,172 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-18 04:53:10,173 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {49#false} is VALID [2020-07-18 04:53:10,174 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#false} ~result~0 := #t~ret4; {49#false} is VALID [2020-07-18 04:53:10,174 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#false} havoc #t~ret4; {49#false} is VALID [2020-07-18 04:53:10,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#false} assume 1 == ~result~0; {49#false} is VALID [2020-07-18 04:53:10,175 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-18 04:53:10,178 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-18 04:53:10,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267987284] [2020-07-18 04:53:10,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:53:10,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:53:10,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027365295] [2020-07-18 04:53:10,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:53:10,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:10,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:53:10,247 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-18 04:53:10,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:53:10,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:53:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:53:10,262 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-18 04:53:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:10,721 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-18 04:53:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:53:10,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:53:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-18 04:53:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-18 04:53:10,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-18 04:53:10,883 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-18 04:53:10,899 INFO L225 Difference]: With dead ends: 58 [2020-07-18 04:53:10,899 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 04:53:10,904 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-18 04:53:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 04:53:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-18 04:53:11,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:11,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,015 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,016 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,033 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-18 04:53:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,036 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,036 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,059 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-18 04:53:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:11,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:53:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-18 04:53:11,070 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-18 04:53:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:11,071 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-18 04:53:11,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:53:11,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-18 04:53:11,145 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-18 04:53:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-18 04:53:11,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:11,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:11,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:53:11,148 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-18 04:53:11,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:11,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1165403529] [2020-07-18 04:53:11,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:11,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-18 04:53:11,194 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-18 04:53:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:11,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:11,234 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-18 04:53:11,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,237 INFO L280 TraceCheckUtils]: 4: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,239 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-18 04:53:11,240 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-18 04:53:11,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-18 04:53:11,241 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-18 04:53:11,241 INFO L263 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2020-07-18 04:53:11,243 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 2; {352#(<= 2 main_~x~0)} is VALID [2020-07-18 04:53:11,243 INFO L263 TraceCheckUtils]: 5: Hoare triple {352#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {348#true} is VALID [2020-07-18 04:53:11,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:11,245 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-18 04:53:11,246 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,250 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-18 04:53:11,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {349#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {349#false} is VALID [2020-07-18 04:53:11,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} ~result~0 := #t~ret4; {349#false} is VALID [2020-07-18 04:53:11,251 INFO L280 TraceCheckUtils]: 14: Hoare triple {349#false} havoc #t~ret4; {349#false} is VALID [2020-07-18 04:53:11,251 INFO L280 TraceCheckUtils]: 15: Hoare triple {349#false} assume 1 == ~result~0; {349#false} is VALID [2020-07-18 04:53:11,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-18 04:53:11,253 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-18 04:53:11,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1165403529] [2020-07-18 04:53:11,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:53:11,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:53:11,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259844139] [2020-07-18 04:53:11,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-18 04:53:11,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:11,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:53:11,284 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-18 04:53:11,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:53:11,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:53:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:53:11,286 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-18 04:53:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,602 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-18 04:53:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:53:11,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-18 04:53:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-18 04:53:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-18 04:53:11,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-18 04:53:11,725 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-18 04:53:11,729 INFO L225 Difference]: With dead ends: 50 [2020-07-18 04:53:11,730 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 04:53:11,731 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-18 04:53:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 04:53:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-18 04:53:11,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:11,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-18 04:53:11,815 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-18 04:53:11,816 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-18 04:53:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,826 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-18 04:53:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-18 04:53:11,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,835 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-18 04:53:11,836 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-18 04:53:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,849 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-18 04:53:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-18 04:53:11,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:11,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:53:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-18 04:53:11,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-18 04:53:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:11,868 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-18 04:53:11,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:53:11,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-18 04:53:11,959 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-18 04:53:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 04:53:11,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:11,962 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-18 04:53:11,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:53:11,963 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-18 04:53:11,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:11,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181599379] [2020-07-18 04:53:11,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,069 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-18 04:53:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:12,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,209 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-18 04:53:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-18 04:53:12,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-18 04:53:12,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,229 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-18 04:53:12,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-18 04:53:12,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-18 04:53:12,234 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-18 04:53:12,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:12,237 INFO L280 TraceCheckUtils]: 5: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,238 INFO L280 TraceCheckUtils]: 6: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,240 INFO L280 TraceCheckUtils]: 7: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,242 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-18 04:53:12,242 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,242 INFO L263 TraceCheckUtils]: 10: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-18 04:53:12,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,243 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-18 04:53:12,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-18 04:53:12,243 INFO L280 TraceCheckUtils]: 14: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,244 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-18 04:53:12,244 INFO L280 TraceCheckUtils]: 16: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,244 INFO L280 TraceCheckUtils]: 17: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,245 INFO L280 TraceCheckUtils]: 18: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-18 04:53:12,246 INFO L280 TraceCheckUtils]: 20: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-18 04:53:12,246 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-18 04:53:12,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2020-07-18 04:53:12,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,250 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-18 04:53:12,250 INFO L263 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret5 := main(); {637#true} is VALID [2020-07-18 04:53:12,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 2; {641#(<= 2 main_~x~0)} is VALID [2020-07-18 04:53:12,251 INFO L263 TraceCheckUtils]: 5: Hoare triple {641#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {637#true} is VALID [2020-07-18 04:53:12,252 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-18 04:53:12,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-18 04:53:12,261 INFO L263 TraceCheckUtils]: 9: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-18 04:53:12,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:12,265 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,266 INFO L280 TraceCheckUtils]: 12: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,268 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-18 04:53:12,268 INFO L280 TraceCheckUtils]: 15: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,268 INFO L263 TraceCheckUtils]: 16: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-18 04:53:12,269 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,269 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-18 04:53:12,270 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-18 04:53:12,270 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,270 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-18 04:53:12,271 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,271 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,272 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-18 04:53:12,272 INFO L280 TraceCheckUtils]: 26: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-18 04:53:12,272 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-18 04:53:12,272 INFO L280 TraceCheckUtils]: 28: Hoare triple {638#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,273 INFO L280 TraceCheckUtils]: 29: Hoare triple {638#false} ~result~0 := #t~ret4; {638#false} is VALID [2020-07-18 04:53:12,273 INFO L280 TraceCheckUtils]: 30: Hoare triple {638#false} havoc #t~ret4; {638#false} is VALID [2020-07-18 04:53:12,273 INFO L280 TraceCheckUtils]: 31: Hoare triple {638#false} assume 1 == ~result~0; {638#false} is VALID [2020-07-18 04:53:12,273 INFO L280 TraceCheckUtils]: 32: Hoare triple {638#false} assume !false; {638#false} is VALID [2020-07-18 04:53:12,275 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-18 04:53:12,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181599379] [2020-07-18 04:53:12,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:53:12,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:53:12,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566866718] [2020-07-18 04:53:12,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-18 04:53:12,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:12,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:53:12,316 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-18 04:53:12,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:53:12,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:12,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:53:12,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:53:12,318 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-18 04:53:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:12,722 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-18 04:53:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:53:12,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-18 04:53:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-18 04:53:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-18 04:53:12,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-18 04:53:12,893 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-18 04:53:12,899 INFO L225 Difference]: With dead ends: 82 [2020-07-18 04:53:12,899 INFO L226 Difference]: Without dead ends: 46 [2020-07-18 04:53:12,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:53:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-18 04:53:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-18 04:53:12,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:12,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-18 04:53:12,984 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-18 04:53:12,984 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-18 04:53:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:12,991 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-18 04:53:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-18 04:53:12,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:12,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:12,996 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-18 04:53:12,996 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-18 04:53:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:13,006 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-18 04:53:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-18 04:53:13,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:13,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:13,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:13,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-18 04:53:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-18 04:53:13,016 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-18 04:53:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:13,016 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-18 04:53:13,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:53:13,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-18 04:53:13,095 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-18 04:53:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-18 04:53:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 04:53:13,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:13,098 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-18 04:53:13,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:53:13,098 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-18 04:53:13,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:13,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181264224] [2020-07-18 04:53:13,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:53:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:53:13,186 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 04:53:13,186 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 04:53:13,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:53:13,218 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 04:53:13,219 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:53:13,219 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:53:13,219 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 04:53:13,219 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation [2020-07-18 04:53:13,219 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-18 04:53:13,220 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 04:53:13,221 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 04:53:13,222 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 04:53:13,222 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-18 04:53:13,222 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 04:53:13,222 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:53:13,222 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:53:13,222 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-18 04:53:13,223 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-18 04:53:13,223 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-18 04:53:13,223 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-18 04:53:13,223 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-18 04:53:13,223 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-18 04:53:13,223 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-18 04:53:13,224 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2020-07-18 04:53:13,225 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 04:53:13,226 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-18 04:53:13,226 WARN L170 areAnnotationChecker]: L23-5 has no Hoare annotation [2020-07-18 04:53:13,226 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 04:53:13,226 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 04:53:13,226 WARN L170 areAnnotationChecker]: L23-6 has no Hoare annotation [2020-07-18 04:53:13,226 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:53:13,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:53:13 BoogieIcfgContainer [2020-07-18 04:53:13,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:53:13,238 INFO L168 Benchmark]: Toolchain (without parser) took 4361.59 ms. Allocated memory was 137.4 MB in the beginning and 249.6 MB in the end (delta: 112.2 MB). Free memory was 102.7 MB in the beginning and 93.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 121.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:13,239 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:53:13,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.73 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:13,241 INFO L168 Benchmark]: Boogie Preprocessor took 128.81 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 180.6 MB in the end (delta: -88.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:13,242 INFO L168 Benchmark]: RCFGBuilder took 451.34 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 159.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:13,243 INFO L168 Benchmark]: TraceAbstraction took 3497.83 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 159.1 MB in the beginning and 93.3 MB in the end (delta: 65.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:13,256 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 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.73 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.81 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 180.6 MB in the end (delta: -88.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 451.34 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 159.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3497.83 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 159.1 MB in the beginning and 93.3 MB in the end (delta: 65.8 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 2; VAL [x=2] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=1, x=2] [L37] int result = fibo1(x); VAL [fibo1(x)=1, result=1, x=2] [L38] COND TRUE result == 1 VAL [result=1, x=2] [L39] __VERIFIER_error() VAL [result=1, x=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 126 SDtfs, 72 SDslu, 322 SDs, 0 SdLazy, 106 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...