java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:19:21,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:19:21,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:19:21,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:19:21,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:19:21,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:19:21,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:19:21,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:19:21,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:19:21,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:19:21,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:19:21,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:19:21,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:19:21,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:19:21,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:19:21,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:19:21,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:19:21,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:19:21,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:19:21,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:19:21,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:19:21,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:19:21,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:19:21,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:19:21,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:19:21,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:19:21,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:19:21,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:19:21,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:19:21,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:19:21,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:19:21,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:19:21,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:19:21,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:19:21,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:19:21,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:19:21,658 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:19:21,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:19:21,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:19:21,679 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:19:21,683 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:19:21,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:19:21,683 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:19:21,683 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:19:21,683 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:19:21,684 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:19:21,684 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:19:21,684 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:19:21,684 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:19:21,684 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:19:21,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:19:21,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:19:21,686 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:19:21,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:19:21,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:19:21,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:19:21,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:19:21,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:19:21,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:19:21,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:19:21,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:19:21,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:19:21,688 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:19:21,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:19:21,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:19:21,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:19:21,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:19:21,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:19:21,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:19:21,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:19:21,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:19:21,689 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:19:21,690 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:19:21,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:19:21,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:19:21,690 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:19:21,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:19:21,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:19:21,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:19:21,748 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:19:21,748 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:19:21,749 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2018-12-03 18:19:21,749 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-12-03 18:19:21,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:19:21,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:19:21,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:19:21,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:19:21,784 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:19:21,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,822 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:19:21,822 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:19:21,822 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:19:21,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:19:21,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:19:21,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:19:21,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:19:21,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/1) ... [2018-12-03 18:19:21,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:19:21,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:19:21,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:19:21,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:19:21,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (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 [2018-12-03 18:19:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-12-03 18:19:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-12-03 18:19:22,214 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:19:22,215 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:19:22,215 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:19:22 BoogieIcfgContainer [2018-12-03 18:19:22,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:19:22,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:19:22,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:19:22,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:19:22,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:21" (1/2) ... [2018-12-03 18:19:22,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1548d798 and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:19:22, skipping insertion in model container [2018-12-03 18:19:22,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:19:22" (2/2) ... [2018-12-03 18:19:22,225 INFO L112 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2018-12-03 18:19:22,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:19:22,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-03 18:19:22,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-03 18:19:22,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:19:22,316 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:19:22,316 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:19:22,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:19:22,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:19:22,317 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:19:22,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:19:22,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:19:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 18:19:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:19:22,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:22,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:19:22,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:22,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2018-12-03 18:19:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:22,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:22,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:19:22,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 18:19:22,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:19:22,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:19:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:19:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:19:22,541 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-03 18:19:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:22,630 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-03 18:19:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:19:22,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 18:19:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:22,644 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:19:22,645 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:19:22,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:19:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:19:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:19:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:19:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-03 18:19:22,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2018-12-03 18:19:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-03 18:19:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:19:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-03 18:19:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:19:22,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:22,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:19:22,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:22,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2018-12-03 18:19:22,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:22,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:22,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:19:22,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 18:19:22,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:19:22,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:19:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:19:22,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:19:22,728 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2018-12-03 18:19:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:22,773 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 18:19:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:19:22,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 18:19:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:22,775 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:19:22,775 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:19:22,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:19:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:19:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:19:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:19:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 18:19:22,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 18:19:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:22,780 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 18:19:22,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:19:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 18:19:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:19:22,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:22,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 18:19:22,782 INFO L423 AbstractCegarLoop]: === Iteration 3 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:22,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2018-12-03 18:19:22,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:22,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:22,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:19:22,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:19:22,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:19:22,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:19:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:19:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:19:22,939 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 18:19:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:23,024 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 18:19:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:19:23,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 18:19:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:23,026 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:19:23,026 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:19:23,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:19:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:19:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:19:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:19:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 18:19:23,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 18:19:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:23,030 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 18:19:23,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:19:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 18:19:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:19:23,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:23,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:19:23,031 INFO L423 AbstractCegarLoop]: === Iteration 4 === [MainErr0ASSERT_VIOLATIONASSERT, MainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:23,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2018-12-03 18:19:23,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:23,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:23,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:23,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:23,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:23,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:23,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:23,131 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 18:19:23,133 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13] [2018-12-03 18:19:23,197 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:19:23,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:19:23,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:19:23,413 INFO L272 AbstractInterpreter]: Visited 7 different actions 21 times. Merged at 4 different actions 8 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 18:19:23,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:23,463 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:19:23,525 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 50% of their original sizes. [2018-12-03 18:19:23,525 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:19:23,635 INFO L418 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-03 18:19:23,635 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:19:23,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:19:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2018-12-03 18:19:23,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:19:23,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:19:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:19:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:19:23,638 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-12-03 18:19:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:23,749 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-12-03 18:19:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:19:23,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-03 18:19:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:23,750 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:19:23,751 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:19:23,751 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:19:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:19:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:19:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:19:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:19:23,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-12-03 18:19:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:23,756 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:19:23,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:19:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:19:23,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:19:23,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:19:24,160 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-12-03 18:19:24,164 INFO L448 ceAbstractionStarter]: For program point MainENTRY(lines 11 25) no Hoare annotation was computed. [2018-12-03 18:19:24,165 INFO L448 ceAbstractionStarter]: For program point MainErr1ASSERT_VIOLATIONASSERT(line 24) no Hoare annotation was computed. [2018-12-03 18:19:24,165 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-03 18:19:24,165 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-12-03 18:19:24,165 INFO L448 ceAbstractionStarter]: For program point MainEXIT(lines 11 25) no Hoare annotation was computed. [2018-12-03 18:19:24,165 INFO L448 ceAbstractionStarter]: For program point L19(lines 15 22) no Hoare annotation was computed. [2018-12-03 18:19:24,166 INFO L444 ceAbstractionStarter]: At program point L15-1(lines 15 18) the Hoare annotation is: (or (let ((.cse0 (* 2 Main_y))) (and (= Main_x 0) (<= 0 .cse0) (<= .cse0 0))) (and (<= Main_y Main_x) (<= Main_x Main_y) (<= 1 Main_x))) [2018-12-03 18:19:24,166 INFO L448 ceAbstractionStarter]: For program point MainFINAL(lines 11 25) no Hoare annotation was computed. [2018-12-03 18:19:24,166 INFO L448 ceAbstractionStarter]: For program point MainErr0ASSERT_VIOLATIONASSERT(line 23) no Hoare annotation was computed. [2018-12-03 18:19:24,174 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:19:24 BoogieIcfgContainer [2018-12-03 18:19:24,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:19:24,175 INFO L168 Benchmark]: Toolchain (without parser) took 2394.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-12-03 18:19:24,177 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:19:24,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:19:24,178 INFO L168 Benchmark]: Boogie Preprocessor took 29.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:19:24,179 INFO L168 Benchmark]: RCFGBuilder took 360.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:19:24,181 INFO L168 Benchmark]: TraceAbstraction took 1957.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-12-03 18:19:24,186 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 360.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1957.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((x == 0 && 0 <= 2 * y) && 2 * y <= 0) || ((y <= x && x <= y) && 1 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 1.8s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 11 SDslu, 7 SDs, 0 SdLazy, 20 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 1.1666666666666667 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 25 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...