/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:55:39,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:55:39,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:55:39,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:55:39,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:55:39,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:55:39,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:55:39,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:55:39,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:55:39,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:55:39,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:55:39,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:55:39,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:55:39,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:55:39,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:55:39,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:55:39,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:55:39,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:55:39,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:55:39,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:55:39,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:55:39,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:55:39,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:55:39,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:55:39,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:55:39,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:55:39,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:55:39,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:55:39,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:55:39,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:55:39,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:55:39,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:55:39,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:55:39,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:55:39,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:55:39,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:55:39,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:55:39,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:55:39,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:55:39,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:55:39,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:55:39,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:55:39,317 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:55:39,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:55:39,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:55:39,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:55:39,320 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:55:39,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:55:39,320 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:55:39,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:55:39,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:55:39,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:55:39,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:55:39,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:55:39,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:55:39,322 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:55:39,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:55:39,322 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:55:39,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:55:39,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:55:39,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:55:39,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:55:39,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:55:39,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:55:39,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:55:39,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:55:39,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:55:39,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:55:39,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:55:39,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:55:39,325 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:55:39,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:55:39,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:55:39,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:55:39,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:55:39,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:55:39,662 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:55:39,663 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-10 14:55:39,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5270088/5591642b30804487a52a199491a0a3d2/FLAG590f72e53 [2020-07-10 14:55:40,253 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:55:40,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-10 14:55:40,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5270088/5591642b30804487a52a199491a0a3d2/FLAG590f72e53 [2020-07-10 14:55:40,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5270088/5591642b30804487a52a199491a0a3d2 [2020-07-10 14:55:40,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:55:40,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:55:40,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:55:40,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:55:40,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:55:40,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377ccc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40, skipping insertion in model container [2020-07-10 14:55:40,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:55:40,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:55:40,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:55:40,810 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:55:40,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:55:40,847 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:55:40,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40 WrapperNode [2020-07-10 14:55:40,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:55:40,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:55:40,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:55:40,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:55:40,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... [2020-07-10 14:55:40,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:55:40,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:55:40,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:55:40,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:55:40,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:55:41,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:55:41,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:55:41,052 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-10 14:55:41,052 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-10 14:55:41,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:55:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:55:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:55:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-10 14:55:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-10 14:55:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:55:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:55:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:55:41,422 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:55:41,422 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:55:41,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:55:41 BoogieIcfgContainer [2020-07-10 14:55:41,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:55:41,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:55:41,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:55:41,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:55:41,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:55:40" (1/3) ... [2020-07-10 14:55:41,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b8e151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:55:41, skipping insertion in model container [2020-07-10 14:55:41,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:40" (2/3) ... [2020-07-10 14:55:41,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b8e151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:55:41, skipping insertion in model container [2020-07-10 14:55:41,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:55:41" (3/3) ... [2020-07-10 14:55:41,453 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-07-10 14:55:41,468 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:55:41,478 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:55:41,494 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:55:41,521 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:55:41,522 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:55:41,522 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:55:41,522 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:55:41,522 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:55:41,523 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:55:41,523 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:55:41,523 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:55:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 14:55:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:55:41,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:55:41,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:55:41,556 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:55:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:55:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-10 14:55:41,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:55:41,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755420057] [2020-07-10 14:55:41,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:55:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:41,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 14:55:41,786 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-10 14:55:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:41,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:41,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:41,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:41,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID [2020-07-10 14:55:41,870 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-10 14:55:41,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 14:55:41,871 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-10 14:55:41,872 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2020-07-10 14:55:41,874 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 2; {40#(<= 2 main_~x~0)} is VALID [2020-07-10 14:55:41,875 INFO L263 TraceCheckUtils]: 5: Hoare triple {40#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {36#true} is VALID [2020-07-10 14:55:41,876 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:41,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:41,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:41,883 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID [2020-07-10 14:55:41,883 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {37#false} is VALID [2020-07-10 14:55:41,884 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 1 != ~result~0; {37#false} is VALID [2020-07-10 14:55:41,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 14:55:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:55:41,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755420057] [2020-07-10 14:55:41,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:55:41,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:55:41,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154276506] [2020-07-10 14:55:41,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:55:41,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:55:41,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:55:41,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:41,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:55:41,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:55:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:55:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:55:41,951 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-10 14:55:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:42,275 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:55:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:55:42,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:55:42,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:55:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:55:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-10 14:55:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:55:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-10 14:55:42,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-10 14:55:42,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:42,432 INFO L225 Difference]: With dead ends: 44 [2020-07-10 14:55:42,432 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:55:42,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:55:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:55:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 14:55:42,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:55:42,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 14:55:42,491 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:55:42,492 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:55:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:42,499 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-10 14:55:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:55:42,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:42,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:42,502 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 14:55:42,502 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 14:55:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:42,522 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-10 14:55:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:55:42,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:42,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:42,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:55:42,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:55:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:55:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-10 14:55:42,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-10 14:55:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:55:42,531 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-10 14:55:42,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:55:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:55:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 14:55:42,532 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:55:42,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:55:42,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:55:42,533 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:55:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:55:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-10 14:55:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:55:42,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849093615] [2020-07-10 14:55:42,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:55:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:42,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-10 14:55:42,572 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-10 14:55:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:42,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:42,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:42,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:42,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:42,647 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID [2020-07-10 14:55:42,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2020-07-10 14:55:42,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-10 14:55:42,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-10 14:55:42,649 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID [2020-07-10 14:55:42,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 2; {211#(<= 2 main_~x~0)} is VALID [2020-07-10 14:55:42,650 INFO L263 TraceCheckUtils]: 5: Hoare triple {211#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {207#true} is VALID [2020-07-10 14:55:42,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:42,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:42,653 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:42,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:42,655 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID [2020-07-10 14:55:42,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {208#false} is VALID [2020-07-10 14:55:42,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 1 != ~result~0; {208#false} is VALID [2020-07-10 14:55:42,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2020-07-10 14:55:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:55:42,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849093615] [2020-07-10 14:55:42,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:55:42,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:55:42,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446518859] [2020-07-10 14:55:42,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:55:42,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:55:42,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:55:42,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:42,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:55:42,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:55:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:55:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:55:42,687 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-10 14:55:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:42,902 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-10 14:55:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:55:42,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:55:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:55:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:55:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 14:55:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:55:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 14:55:42,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-10 14:55:42,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:42,989 INFO L225 Difference]: With dead ends: 36 [2020-07-10 14:55:42,989 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 14:55:42,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:55:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 14:55:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-10 14:55:43,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:55:43,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-10 14:55:43,021 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-10 14:55:43,021 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-10 14:55:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:43,034 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:55:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-10 14:55:43,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:43,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:43,040 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-10 14:55:43,040 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-10 14:55:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:43,052 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-10 14:55:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-10 14:55:43,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:43,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:43,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:55:43,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:55:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 14:55:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-10 14:55:43,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-10 14:55:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:55:43,058 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-10 14:55:43,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:55:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-10 14:55:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:55:43,060 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:55:43,061 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:55:43,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:55:43,061 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:55:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:55:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-10 14:55:43,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:55:43,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544243748] [2020-07-10 14:55:43,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:55:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,163 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-10 14:55:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:43,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,311 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-10 14:55:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:55:43,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:55:43,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-10 14:55:43,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:55:43,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-10 14:55:43,335 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-10 14:55:43,335 INFO L263 TraceCheckUtils]: 3: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-10 14:55:43,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:43,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,340 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-10 14:55:43,340 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-10 14:55:43,340 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-10 14:55:43,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:55:43,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:55:43,342 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,343 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-10 14:55:43,343 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-10 14:55:43,344 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-10 14:55:43,344 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-10 14:55:43,345 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-10 14:55:43,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-10 14:55:43,346 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-10 14:55:43,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-10 14:55:43,348 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-10 14:55:43,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:55:43,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-10 14:55:43,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-10 14:55:43,350 INFO L263 TraceCheckUtils]: 9: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-10 14:55:43,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:43,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,355 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-10 14:55:43,355 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-10 14:55:43,355 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-10 14:55:43,356 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:55:43,356 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:55:43,356 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,356 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-10 14:55:43,357 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-10 14:55:43,357 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-10 14:55:43,358 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-10 14:55:43,358 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-10 14:55:43,358 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 != ~result~0; {376#false} is VALID [2020-07-10 14:55:43,358 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-10 14:55:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 14:55:43,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544243748] [2020-07-10 14:55:43,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399253320] [2020-07-10 14:55:43,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:55:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:43,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:55:43,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-10 14:55:43,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,605 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-10 14:55:43,605 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-10 14:55:43,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-10 14:55:43,608 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-10 14:55:43,612 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:55:43,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:55:43,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-10 14:55:43,614 INFO L263 TraceCheckUtils]: 9: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-10 14:55:43,622 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-10 14:55:43,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {443#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-10 14:55:43,626 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {430#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:43,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:43,628 INFO L263 TraceCheckUtils]: 15: Hoare triple {453#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-10 14:55:43,628 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-10 14:55:43,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-10 14:55:43,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-10 14:55:43,630 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {453#(<= |fibo1_#in~n| 1)} #59#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:43,631 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:43,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume true; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-10 14:55:43,634 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {453#(<= |fibo1_#in~n| 1)} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-10 14:55:43,634 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-10 14:55:43,635 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 != ~result~0; {376#false} is VALID [2020-07-10 14:55:43,635 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-10 14:55:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 14:55:43,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:55:43,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-10 14:55:43,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440456914] [2020-07-10 14:55:43,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 14:55:43,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:55:43,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:55:43,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:43,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:55:43,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:55:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:55:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:55:43,703 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-10 14:55:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:44,365 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-10 14:55:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 14:55:44,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-10 14:55:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:55:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:55:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-10 14:55:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:55:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-10 14:55:44,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-10 14:55:44,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:44,529 INFO L225 Difference]: With dead ends: 58 [2020-07-10 14:55:44,530 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 14:55:44,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:55:44,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 14:55:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-10 14:55:44,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:55:44,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-10 14:55:44,546 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-10 14:55:44,546 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-10 14:55:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:44,550 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-10 14:55:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-10 14:55:44,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:44,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:44,551 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-10 14:55:44,551 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-10 14:55:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:44,555 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-10 14:55:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-10 14:55:44,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:44,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:44,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:55:44,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:55:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 14:55:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-10 14:55:44,561 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-10 14:55:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:55:44,561 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-10 14:55:44,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:55:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-10 14:55:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:55:44,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:55:44,563 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:55:44,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:55:44,777 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:55:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:55:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-10 14:55:44,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:55:44,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145446552] [2020-07-10 14:55:44,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:55:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:44,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:55:44,882 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-10 14:55:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:45,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,017 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,018 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:45,074 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,075 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,080 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-10 14:55:45,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-10 14:55:45,081 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-10 14:55:45,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,087 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,088 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,089 INFO L263 TraceCheckUtils]: 10: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-10 14:55:45,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,096 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,097 INFO L280 TraceCheckUtils]: 13: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,099 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-10 14:55:45,101 INFO L280 TraceCheckUtils]: 15: Hoare triple {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-10 14:55:45,101 INFO L280 TraceCheckUtils]: 16: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-10 14:55:45,103 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-10 14:55:45,105 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-10 14:55:45,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:55:45,105 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-10 14:55:45,106 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-10 14:55:45,106 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 2; {685#true} is VALID [2020-07-10 14:55:45,106 INFO L263 TraceCheckUtils]: 5: Hoare triple {685#true} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-10 14:55:45,106 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,107 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-10 14:55:45,107 INFO L263 TraceCheckUtils]: 9: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-10 14:55:45,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,109 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,110 INFO L280 TraceCheckUtils]: 13: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,112 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,112 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,113 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-10 14:55:45,113 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,114 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,114 INFO L280 TraceCheckUtils]: 19: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,116 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-10 14:55:45,117 INFO L280 TraceCheckUtils]: 21: Hoare triple {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-10 14:55:45,118 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-10 14:55:45,119 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-10 14:55:45,120 INFO L280 TraceCheckUtils]: 24: Hoare triple {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-10 14:55:45,121 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {686#false} is VALID [2020-07-10 14:55:45,121 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-10 14:55:45,122 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-10 14:55:45,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145446552] [2020-07-10 14:55:45,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758842691] [2020-07-10 14:55:45,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:45,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-10 14:55:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:45,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:55:45,332 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-10 14:55:45,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-10 14:55:45,332 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-10 14:55:45,333 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-10 14:55:45,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 2; {685#true} is VALID [2020-07-10 14:55:45,333 INFO L263 TraceCheckUtils]: 5: Hoare triple {685#true} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-10 14:55:45,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-10 14:55:45,334 INFO L263 TraceCheckUtils]: 9: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-10 14:55:45,334 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,334 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-10 14:55:45,335 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-10 14:55:45,337 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,338 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-10 14:55:45,339 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-10 14:55:45,340 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-10 14:55:45,341 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {786#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-10 14:55:45,342 INFO L280 TraceCheckUtils]: 21: Hoare triple {786#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-10 14:55:45,343 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-10 14:55:45,343 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-10 14:55:45,345 INFO L280 TraceCheckUtils]: 24: Hoare triple {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-10 14:55:45,347 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {686#false} is VALID [2020-07-10 14:55:45,347 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-10 14:55:45,349 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-10 14:55:45,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:55:45,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-10 14:55:45,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192565993] [2020-07-10 14:55:45,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:55:45,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:55:45,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:55:45,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:45,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:55:45,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:55:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:55:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:55:45,396 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2020-07-10 14:55:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:45,793 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-07-10 14:55:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:55:45,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:55:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:55:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:55:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-10 14:55:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:55:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-10 14:55:45,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2020-07-10 14:55:45,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:45,878 INFO L225 Difference]: With dead ends: 46 [2020-07-10 14:55:45,878 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 14:55:45,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:55:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 14:55:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2020-07-10 14:55:45,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:55:45,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 37 states. [2020-07-10 14:55:45,904 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 37 states. [2020-07-10 14:55:45,905 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 37 states. [2020-07-10 14:55:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:45,914 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-10 14:55:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-10 14:55:45,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:45,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:45,916 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 42 states. [2020-07-10 14:55:45,916 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 42 states. [2020-07-10 14:55:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:45,925 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-10 14:55:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-10 14:55:45,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:45,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:45,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:55:45,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:55:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 14:55:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-10 14:55:45,930 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2020-07-10 14:55:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:55:45,930 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-10 14:55:45,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:55:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-10 14:55:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 14:55:45,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:55:45,932 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:55:46,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:46,144 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:55:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:55:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1725129826, now seen corresponding path program 1 times [2020-07-10 14:55:46,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:55:46,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803294769] [2020-07-10 14:55:46,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:55:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-10 14:55:46,212 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-10 14:55:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:55:46,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:55:46,304 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-10 14:55:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,328 INFO L280 TraceCheckUtils]: 3: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,330 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-10 14:55:46,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-10 14:55:46,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-10 14:55:46,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {995#true} assume !(1 == ~n); {995#true} is VALID [2020-07-10 14:55:46,331 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-10 14:55:46,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,334 INFO L280 TraceCheckUtils]: 5: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:55:46,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:55:46,337 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-10 14:55:46,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {1024#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1024#(<= fibo1_~n 2)} is VALID [2020-07-10 14:55:46,339 INFO L263 TraceCheckUtils]: 10: Hoare triple {1024#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-10 14:55:46,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,342 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,344 INFO L280 TraceCheckUtils]: 14: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,346 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-10 14:55:46,346 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {996#false} is VALID [2020-07-10 14:55:46,346 INFO L280 TraceCheckUtils]: 17: Hoare triple {996#false} assume true; {996#false} is VALID [2020-07-10 14:55:46,346 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {996#false} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-10 14:55:46,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2020-07-10 14:55:46,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-10 14:55:46,348 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-10 14:55:46,348 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret5 := main(); {995#true} is VALID [2020-07-10 14:55:46,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~x~0 := 2; {999#(<= main_~x~0 2)} is VALID [2020-07-10 14:55:46,349 INFO L263 TraceCheckUtils]: 5: Hoare triple {999#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {995#true} is VALID [2020-07-10 14:55:46,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-10 14:55:46,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-10 14:55:46,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {995#true} assume !(1 == ~n); {995#true} is VALID [2020-07-10 14:55:46,350 INFO L263 TraceCheckUtils]: 9: Hoare triple {995#true} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-10 14:55:46,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:55:46,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-10 14:55:46,355 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-10 14:55:46,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {1024#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1024#(<= fibo1_~n 2)} is VALID [2020-07-10 14:55:46,357 INFO L263 TraceCheckUtils]: 16: Hoare triple {1024#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-10 14:55:46,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,359 INFO L280 TraceCheckUtils]: 18: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,360 INFO L280 TraceCheckUtils]: 20: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,361 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-10 14:55:46,362 INFO L280 TraceCheckUtils]: 22: Hoare triple {996#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {996#false} is VALID [2020-07-10 14:55:46,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {996#false} assume true; {996#false} is VALID [2020-07-10 14:55:46,362 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {996#false} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-10 14:55:46,363 INFO L280 TraceCheckUtils]: 25: Hoare triple {996#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {996#false} is VALID [2020-07-10 14:55:46,363 INFO L280 TraceCheckUtils]: 26: Hoare triple {996#false} assume 1 != ~result~0; {996#false} is VALID [2020-07-10 14:55:46,363 INFO L280 TraceCheckUtils]: 27: Hoare triple {996#false} assume !false; {996#false} is VALID [2020-07-10 14:55:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:55:46,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803294769] [2020-07-10 14:55:46,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667747681] [2020-07-10 14:55:46,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:55:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:46,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:55:46,497 INFO L263 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2020-07-10 14:55:46,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-10 14:55:46,498 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-10 14:55:46,498 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret5 := main(); {995#true} is VALID [2020-07-10 14:55:46,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~x~0 := 2; {999#(<= main_~x~0 2)} is VALID [2020-07-10 14:55:46,499 INFO L263 TraceCheckUtils]: 5: Hoare triple {999#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {995#true} is VALID [2020-07-10 14:55:46,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#true} ~n := #in~n; {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,501 INFO L280 TraceCheckUtils]: 7: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,502 INFO L263 TraceCheckUtils]: 9: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-10 14:55:46,502 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-10 14:55:46,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-10 14:55:46,502 INFO L280 TraceCheckUtils]: 12: Hoare triple {995#true} assume 1 == ~n;#res := 1; {995#true} is VALID [2020-07-10 14:55:46,502 INFO L280 TraceCheckUtils]: 13: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-10 14:55:46,503 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {995#true} {1054#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,504 INFO L280 TraceCheckUtils]: 15: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,504 INFO L263 TraceCheckUtils]: 16: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-10 14:55:46,505 INFO L280 TraceCheckUtils]: 17: Hoare triple {995#true} ~n := #in~n; {1088#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,506 INFO L280 TraceCheckUtils]: 18: Hoare triple {1088#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,506 INFO L280 TraceCheckUtils]: 19: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,507 INFO L280 TraceCheckUtils]: 20: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:46,508 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1054#(<= fibo1_~n |fibo1_#in~n|)} #59#return; {1101#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,509 INFO L280 TraceCheckUtils]: 22: Hoare triple {1101#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1101#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,509 INFO L280 TraceCheckUtils]: 23: Hoare triple {1101#(<= 3 |fibo1_#in~n|)} assume true; {1101#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:46,510 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1101#(<= 3 |fibo1_#in~n|)} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-10 14:55:46,511 INFO L280 TraceCheckUtils]: 25: Hoare triple {996#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {996#false} is VALID [2020-07-10 14:55:46,511 INFO L280 TraceCheckUtils]: 26: Hoare triple {996#false} assume 1 != ~result~0; {996#false} is VALID [2020-07-10 14:55:46,511 INFO L280 TraceCheckUtils]: 27: Hoare triple {996#false} assume !false; {996#false} is VALID [2020-07-10 14:55:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 14:55:46,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:55:46,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2020-07-10 14:55:46,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917842413] [2020-07-10 14:55:46,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 14:55:46,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:55:46,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:55:46,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:46,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:55:46,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:55:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:55:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:55:46,545 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 7 states. [2020-07-10 14:55:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:46,930 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2020-07-10 14:55:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:55:46,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 14:55:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:55:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:55:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-10 14:55:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:55:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-10 14:55:46,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-10 14:55:47,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:47,002 INFO L225 Difference]: With dead ends: 44 [2020-07-10 14:55:47,003 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:55:47,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:55:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:55:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-10 14:55:47,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:55:47,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-10 14:55:47,041 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-10 14:55:47,041 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-10 14:55:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:47,044 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-10 14:55:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2020-07-10 14:55:47,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:47,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:47,046 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-10 14:55:47,046 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-10 14:55:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:47,050 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-10 14:55:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2020-07-10 14:55:47,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:47,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:47,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:55:47,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:55:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 14:55:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-10 14:55:47,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 28 [2020-07-10 14:55:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:55:47,055 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-10 14:55:47,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:55:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-10 14:55:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 14:55:47,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:55:47,057 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:55:47,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:47,270 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:55:47,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:55:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-10 14:55:47,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:55:47,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347119627] [2020-07-10 14:55:47,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:55:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,335 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1309#true} {1309#true} #47#return; {1309#true} is VALID [2020-07-10 14:55:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,444 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-10 14:55:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,451 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-10 14:55:47,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume !(~n < 1); {1365#(< 0 fibo2_~n)} is VALID [2020-07-10 14:55:47,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {1365#(< 0 fibo2_~n)} assume !(1 == ~n); {1366#(< 1 fibo2_~n)} is VALID [2020-07-10 14:55:47,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {1366#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,455 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,458 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-10 14:55:47,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {1310#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1310#false} is VALID [2020-07-10 14:55:47,459 INFO L263 TraceCheckUtils]: 9: Hoare triple {1310#false} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,460 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-10 14:55:47,461 INFO L280 TraceCheckUtils]: 14: Hoare triple {1310#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1310#false} is VALID [2020-07-10 14:55:47,461 INFO L280 TraceCheckUtils]: 15: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-10 14:55:47,462 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1310#false} {1309#true} #57#return; {1310#false} is VALID [2020-07-10 14:55:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,468 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1309#true} {1310#false} #59#return; {1310#false} is VALID [2020-07-10 14:55:47,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume !(~n < 1); {1309#true} is VALID [2020-07-10 14:55:47,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {1309#true} assume !(1 == ~n); {1309#true} is VALID [2020-07-10 14:55:47,470 INFO L263 TraceCheckUtils]: 3: Hoare triple {1309#true} call #t~ret0 := fibo2(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {1309#true} assume !(~n < 1); {1365#(< 0 fibo2_~n)} is VALID [2020-07-10 14:55:47,472 INFO L280 TraceCheckUtils]: 6: Hoare triple {1365#(< 0 fibo2_~n)} assume !(1 == ~n); {1366#(< 1 fibo2_~n)} is VALID [2020-07-10 14:55:47,473 INFO L263 TraceCheckUtils]: 7: Hoare triple {1366#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,474 INFO L280 TraceCheckUtils]: 9: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,475 INFO L280 TraceCheckUtils]: 10: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,476 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-10 14:55:47,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {1310#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1310#false} is VALID [2020-07-10 14:55:47,477 INFO L263 TraceCheckUtils]: 13: Hoare triple {1310#false} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,477 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,478 INFO L280 TraceCheckUtils]: 15: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,478 INFO L280 TraceCheckUtils]: 16: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,478 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-10 14:55:47,478 INFO L280 TraceCheckUtils]: 18: Hoare triple {1310#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1310#false} is VALID [2020-07-10 14:55:47,479 INFO L280 TraceCheckUtils]: 19: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-10 14:55:47,479 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1310#false} {1309#true} #57#return; {1310#false} is VALID [2020-07-10 14:55:47,479 INFO L280 TraceCheckUtils]: 21: Hoare triple {1310#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1310#false} is VALID [2020-07-10 14:55:47,480 INFO L263 TraceCheckUtils]: 22: Hoare triple {1310#false} call #t~ret1 := fibo2(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,480 INFO L280 TraceCheckUtils]: 23: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,480 INFO L280 TraceCheckUtils]: 24: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,480 INFO L280 TraceCheckUtils]: 25: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,481 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1309#true} {1310#false} #59#return; {1310#false} is VALID [2020-07-10 14:55:47,481 INFO L280 TraceCheckUtils]: 27: Hoare triple {1310#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1310#false} is VALID [2020-07-10 14:55:47,481 INFO L280 TraceCheckUtils]: 28: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-10 14:55:47,482 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1310#false} {1313#(<= main_~x~0 2)} #51#return; {1310#false} is VALID [2020-07-10 14:55:47,483 INFO L263 TraceCheckUtils]: 0: Hoare triple {1309#true} call ULTIMATE.init(); {1309#true} is VALID [2020-07-10 14:55:47,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,484 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1309#true} {1309#true} #47#return; {1309#true} is VALID [2020-07-10 14:55:47,484 INFO L263 TraceCheckUtils]: 3: Hoare triple {1309#true} call #t~ret5 := main(); {1309#true} is VALID [2020-07-10 14:55:47,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~x~0 := 2; {1313#(<= main_~x~0 2)} is VALID [2020-07-10 14:55:47,486 INFO L263 TraceCheckUtils]: 5: Hoare triple {1313#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1309#true} is VALID [2020-07-10 14:55:47,486 INFO L280 TraceCheckUtils]: 6: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {1309#true} assume !(~n < 1); {1309#true} is VALID [2020-07-10 14:55:47,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {1309#true} assume !(1 == ~n); {1309#true} is VALID [2020-07-10 14:55:47,487 INFO L263 TraceCheckUtils]: 9: Hoare triple {1309#true} call #t~ret0 := fibo2(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,487 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,488 INFO L280 TraceCheckUtils]: 11: Hoare triple {1309#true} assume !(~n < 1); {1365#(< 0 fibo2_~n)} is VALID [2020-07-10 14:55:47,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {1365#(< 0 fibo2_~n)} assume !(1 == ~n); {1366#(< 1 fibo2_~n)} is VALID [2020-07-10 14:55:47,489 INFO L263 TraceCheckUtils]: 13: Hoare triple {1366#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-10 14:55:47,493 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-10 14:55:47,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {1310#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1310#false} is VALID [2020-07-10 14:55:47,494 INFO L263 TraceCheckUtils]: 19: Hoare triple {1310#false} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,494 INFO L280 TraceCheckUtils]: 21: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,495 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-10 14:55:47,495 INFO L280 TraceCheckUtils]: 24: Hoare triple {1310#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1310#false} is VALID [2020-07-10 14:55:47,495 INFO L280 TraceCheckUtils]: 25: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-10 14:55:47,496 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1310#false} {1309#true} #57#return; {1310#false} is VALID [2020-07-10 14:55:47,496 INFO L280 TraceCheckUtils]: 27: Hoare triple {1310#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1310#false} is VALID [2020-07-10 14:55:47,496 INFO L263 TraceCheckUtils]: 28: Hoare triple {1310#false} call #t~ret1 := fibo2(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,497 INFO L280 TraceCheckUtils]: 29: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,497 INFO L280 TraceCheckUtils]: 30: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,497 INFO L280 TraceCheckUtils]: 31: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,498 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1309#true} {1310#false} #59#return; {1310#false} is VALID [2020-07-10 14:55:47,498 INFO L280 TraceCheckUtils]: 33: Hoare triple {1310#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1310#false} is VALID [2020-07-10 14:55:47,498 INFO L280 TraceCheckUtils]: 34: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-10 14:55:47,498 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1310#false} {1313#(<= main_~x~0 2)} #51#return; {1310#false} is VALID [2020-07-10 14:55:47,499 INFO L280 TraceCheckUtils]: 36: Hoare triple {1310#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1310#false} is VALID [2020-07-10 14:55:47,499 INFO L280 TraceCheckUtils]: 37: Hoare triple {1310#false} assume 1 != ~result~0; {1310#false} is VALID [2020-07-10 14:55:47,499 INFO L280 TraceCheckUtils]: 38: Hoare triple {1310#false} assume !false; {1310#false} is VALID [2020-07-10 14:55:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 14:55:47,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347119627] [2020-07-10 14:55:47,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285051314] [2020-07-10 14:55:47,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 14:55:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:55:47,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:55:47,744 INFO L263 TraceCheckUtils]: 0: Hoare triple {1309#true} call ULTIMATE.init(); {1309#true} is VALID [2020-07-10 14:55:47,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1309#true} {1309#true} #47#return; {1309#true} is VALID [2020-07-10 14:55:47,745 INFO L263 TraceCheckUtils]: 3: Hoare triple {1309#true} call #t~ret5 := main(); {1309#true} is VALID [2020-07-10 14:55:47,745 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~x~0 := 2; {1313#(<= main_~x~0 2)} is VALID [2020-07-10 14:55:47,746 INFO L263 TraceCheckUtils]: 5: Hoare triple {1313#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1309#true} is VALID [2020-07-10 14:55:47,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {1309#true} ~n := #in~n; {1398#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {1398#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1398#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,747 INFO L280 TraceCheckUtils]: 8: Hoare triple {1398#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1398#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,747 INFO L263 TraceCheckUtils]: 9: Hoare triple {1398#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,747 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#true} ~n := #in~n; {1411#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,748 INFO L280 TraceCheckUtils]: 11: Hoare triple {1411#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1415#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2020-07-10 14:55:47,749 INFO L280 TraceCheckUtils]: 12: Hoare triple {1415#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume !(1 == ~n); {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,749 INFO L263 TraceCheckUtils]: 13: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-10 14:55:47,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,750 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1309#true} {1419#(<= 2 |fibo2_#in~n|)} #53#return; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,751 INFO L263 TraceCheckUtils]: 19: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,752 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1309#true} {1419#(<= 2 |fibo2_#in~n|)} #55#return; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,752 INFO L280 TraceCheckUtils]: 25: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} assume true; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-10 14:55:47,753 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1419#(<= 2 |fibo2_#in~n|)} {1398#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,754 INFO L280 TraceCheckUtils]: 27: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,754 INFO L263 TraceCheckUtils]: 28: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {1309#true} is VALID [2020-07-10 14:55:47,754 INFO L280 TraceCheckUtils]: 29: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-10 14:55:47,755 INFO L280 TraceCheckUtils]: 30: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-10 14:55:47,755 INFO L280 TraceCheckUtils]: 31: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-10 14:55:47,756 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1309#true} {1462#(<= 3 |fibo1_#in~n|)} #59#return; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,756 INFO L280 TraceCheckUtils]: 33: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,757 INFO L280 TraceCheckUtils]: 34: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} assume true; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-10 14:55:47,757 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1462#(<= 3 |fibo1_#in~n|)} {1313#(<= main_~x~0 2)} #51#return; {1310#false} is VALID [2020-07-10 14:55:47,758 INFO L280 TraceCheckUtils]: 36: Hoare triple {1310#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1310#false} is VALID [2020-07-10 14:55:47,758 INFO L280 TraceCheckUtils]: 37: Hoare triple {1310#false} assume 1 != ~result~0; {1310#false} is VALID [2020-07-10 14:55:47,758 INFO L280 TraceCheckUtils]: 38: Hoare triple {1310#false} assume !false; {1310#false} is VALID [2020-07-10 14:55:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:55:47,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:55:47,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-10 14:55:47,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938552063] [2020-07-10 14:55:47,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-10 14:55:47,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:55:47,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:55:47,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:47,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:55:47,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:55:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:55:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:55:47,852 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 12 states. [2020-07-10 14:55:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:48,542 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2020-07-10 14:55:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:55:48,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-10 14:55:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:55:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:55:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-10 14:55:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:55:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-10 14:55:48,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2020-07-10 14:55:48,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:55:48,664 INFO L225 Difference]: With dead ends: 69 [2020-07-10 14:55:48,664 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:55:48,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:55:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:55:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:55:48,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:55:48,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:55:48,668 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:55:48,668 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:55:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:48,669 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:55:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:55:48,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:48,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:48,669 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:55:48,669 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:55:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:55:48,669 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:55:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:55:48,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:48,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:55:48,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:55:48,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:55:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:55:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:55:48,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-07-10 14:55:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:55:48,670 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:55:48,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:55:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:55:48,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:55:48,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:55:48,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:55:49,064 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:55:49,065 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:55:49,065 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:55:49,065 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:55:49,065 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:55:49,065 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:55:49,065 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-10 14:55:49,065 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-10 14:55:49,066 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2020-07-10 14:55:49,066 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2020-07-10 14:55:49,066 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-10 14:55:49,066 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-10 14:55:49,066 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 2) (<= 2 main_~x~0)) [2020-07-10 14:55:49,066 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-10 14:55:49,066 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-07-10 14:55:49,066 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-10 14:55:49,067 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-10 14:55:49,067 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-10 14:55:49,067 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-10 14:55:49,067 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-10 14:55:49,067 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-07-10 14:55:49,067 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-07-10 14:55:49,067 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-07-10 14:55:49,067 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-07-10 14:55:49,068 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-10 14:55:49,068 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-10 14:55:49,068 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-10 14:55:49,068 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0))) [2020-07-10 14:55:49,068 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-07-10 14:55:49,068 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-07-10 14:55:49,068 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-10 14:55:49,069 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-07-10 14:55:49,069 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-07-10 14:55:49,074 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:55:49,075 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 14:55:49,076 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-10 14:55:49,077 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 14:55:49,078 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-10 14:55:49,079 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:55:49,079 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:55:49,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:55:49 BoogieIcfgContainer [2020-07-10 14:55:49,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:55:49,085 INFO L168 Benchmark]: Toolchain (without parser) took 8480.26 ms. Allocated memory was 138.4 MB in the beginning and 307.2 MB in the end (delta: 168.8 MB). Free memory was 102.5 MB in the beginning and 235.2 MB in the end (delta: -132.7 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:55:49,085 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:55:49,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.22 ms. Allocated memory is still 138.4 MB. Free memory was 102.3 MB in the beginning and 92.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:55:49,087 INFO L168 Benchmark]: Boogie Preprocessor took 33.75 ms. Allocated memory is still 138.4 MB. Free memory was 92.4 MB in the beginning and 90.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:55:49,087 INFO L168 Benchmark]: RCFGBuilder took 544.41 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 90.9 MB in the beginning and 162.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:55:49,088 INFO L168 Benchmark]: TraceAbstraction took 7651.18 ms. Allocated memory was 201.9 MB in the beginning and 307.2 MB in the end (delta: 105.4 MB). Free memory was 161.7 MB in the beginning and 235.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:55:49,091 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.22 ms. Allocated memory is still 138.4 MB. Free memory was 102.3 MB in the beginning and 92.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.75 ms. Allocated memory is still 138.4 MB. Free memory was 92.4 MB in the beginning and 90.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 544.41 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 90.9 MB in the beginning and 162.3 MB in the end (delta: -71.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7651.18 ms. Allocated memory was 201.9 MB in the beginning and 307.2 MB in the end (delta: 105.4 MB). Free memory was 161.7 MB in the beginning and 235.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 168 SDtfs, 101 SDslu, 753 SDs, 0 SdLazy, 446 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 50 PreInvPairs, 59 NumberOfFragments, 55 HoareAnnotationTreeSize, 50 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 15275 SizeOfPredicates, 10 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 35/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...