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_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:01,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:01,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:01,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:01,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:01,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:01,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:01,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:01,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:01,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:01,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:01,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:01,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:01,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:01,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:01,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:01,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:01,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:01,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:01,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:01,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:01,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:01,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:01,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:01,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:01,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:01,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:01,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:01,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:01,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:01,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:01,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:01,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:01,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:01,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:01,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:01,831 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-03-04 16:53:01,845 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:01,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:01,846 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:01,846 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:01,846 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:01,847 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:01,847 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:01,847 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:01,847 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:01,847 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:01,847 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:01,848 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:01,848 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:01,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:01,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:01,849 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:01,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:01,850 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:01,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:01,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:01,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:01,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:01,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:01,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:01,851 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:01,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:01,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:01,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:01,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:01,852 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:01,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:01,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:01,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:01,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:01,853 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:01,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:01,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:01,853 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:01,854 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:01,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:01,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:01,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:01,915 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:01,916 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:01,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-03-04 16:53:01,917 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-03-04 16:53:01,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:01,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:01,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:01,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:01,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:01,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:01,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:01,999 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:53:01,999 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:53:01,999 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:53:02,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:02,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:02,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:02,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:02,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... [2019-03-04 16:53:02,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:02,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:02,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:02,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:02,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-03-04 16:53:02,101 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-03-04 16:53:02,300 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:53:02,300 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-03-04 16:53:02,301 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:02 BoogieIcfgContainer [2019-03-04 16:53:02,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:02,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:02,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:02,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:02,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:01" (1/2) ... [2019-03-04 16:53:02,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb90164 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:02, skipping insertion in model container [2019-03-04 16:53:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:02" (2/2) ... [2019-03-04 16:53:02,315 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-03-04 16:53:02,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:02,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:53:02,349 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:53:02,382 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:02,382 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:02,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:02,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:02,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:02,383 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:02,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:02,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-03-04 16:53:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:53:02,404 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:02,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:53:02,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-03-04 16:53:02,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:02,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:02,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:02,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:02,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:02,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:02,584 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-03-04 16:53:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:02,632 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-03-04 16:53:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:02,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:53:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:02,647 INFO L225 Difference]: With dead ends: 7 [2019-03-04 16:53:02,647 INFO L226 Difference]: Without dead ends: 4 [2019-03-04 16:53:02,650 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 [2019-03-04 16:53:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-03-04 16:53:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-03-04 16:53:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-03-04 16:53:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-03-04 16:53:02,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-03-04 16:53:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:02,686 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-03-04 16:53:02,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-03-04 16:53:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:02,686 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:02,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:02,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-03-04 16:53:02,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:02,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:02,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:02,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:02,828 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2019-03-04 16:53:02,958 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:02,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:03,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:03,924 INFO L272 AbstractInterpreter]: Visited 3 different actions 17 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:53:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:03,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:03,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:03,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:03,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:53:03,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:04,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2019-03-04 16:53:04,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:04,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:04,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:53:04,320 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-03-04 16:53:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:04,473 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-03-04 16:53:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:04,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:53:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:04,474 INFO L225 Difference]: With dead ends: 6 [2019-03-04 16:53:04,475 INFO L226 Difference]: Without dead ends: 5 [2019-03-04 16:53:04,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:53:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-03-04 16:53:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-03-04 16:53:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-03-04 16:53:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-03-04 16:53:04,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-03-04 16:53:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:04,478 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-03-04 16:53:04,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-03-04 16:53:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:04,478 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:04,479 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-03-04 16:53:04,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-03-04 16:53:04,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:04,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:04,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:04,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:04,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:04,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:04,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:53:04,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:04,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:53:04,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:04,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-03-04 16:53:04,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:04,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:53:04,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:53:04,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:04,841 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-03-04 16:53:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:04,858 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-03-04 16:53:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:53:04,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:53:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:04,861 INFO L225 Difference]: With dead ends: 7 [2019-03-04 16:53:04,862 INFO L226 Difference]: Without dead ends: 6 [2019-03-04 16:53:04,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:53:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-03-04 16:53:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-03-04 16:53:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:53:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-03-04 16:53:04,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-03-04 16:53:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:04,865 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-03-04 16:53:04,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:53:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-03-04 16:53:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:53:04,865 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:04,866 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-03-04 16:53:04,866 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:04,866 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-03-04 16:53:04,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:04,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:05,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:05,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:05,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:05,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:05,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:05,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:05,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:53:05,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:05,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-03-04 16:53:05,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:05,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:53:05,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:53:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:53:05,174 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-03-04 16:53:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:05,216 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-03-04 16:53:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:53:05,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:53:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:05,217 INFO L225 Difference]: With dead ends: 8 [2019-03-04 16:53:05,217 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:53:05,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:53:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:53:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-03-04 16:53:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:53:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:53:05,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-03-04 16:53:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:05,222 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:53:05,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:53:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:53:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:53:05,223 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:05,223 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-03-04 16:53:05,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-03-04 16:53:05,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:05,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:05,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:05,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:05,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:05,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:05,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:05,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:05,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:53:05,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:05,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-03-04 16:53:05,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:05,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:53:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:53:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:53:05,496 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-03-04 16:53:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:05,601 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-03-04 16:53:05,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:53:05,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:53:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:05,603 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:53:05,603 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:53:05,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:53:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:53:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-03-04 16:53:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:53:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-03-04 16:53:05,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-03-04 16:53:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:05,612 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-03-04 16:53:05,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:53:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-03-04 16:53:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:53:05,613 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:05,613 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-03-04 16:53:05,613 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-03-04 16:53:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:05,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:05,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:05,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:05,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:05,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:05,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:05,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:05,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:53:05,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:05,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:53:05,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:05,943 INFO L171 IndexEqualityManager]: detected equality via solver [2019-03-04 16:53:05,950 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-03-04 16:53:05,951 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:06,054 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:06,055 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-03-04 16:53:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-03-04 16:53:06,222 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-03-04 16:53:06,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:06,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2019-03-04 16:53:06,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:06,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:53:06,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:53:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:53:06,306 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-03-04 16:53:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:06,641 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-03-04 16:53:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:53:06,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:53:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:06,642 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:53:06,642 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:53:06,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:53:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:53:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:53:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:53:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:53:06,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-03-04 16:53:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:06,643 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:53:06,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:53:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:53:06,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:53:06,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:53:06,773 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 12 25) the Hoare annotation is: (or (and (< 4 proc_j) (< proc_j 6) (<= proc_i 999) (<= (select proc_a 5) 1000)) (<= proc_i 0)) [2019-03-04 16:53:06,774 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-03-04 16:53:06,774 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-03-04 16:53:06,774 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-03-04 16:53:06,783 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:53:06 BoogieIcfgContainer [2019-03-04 16:53:06,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:53:06,784 INFO L168 Benchmark]: Toolchain (without parser) took 4825.65 ms. Allocated memory was 140.5 MB in the beginning and 259.5 MB in the end (delta: 119.0 MB). Free memory was 106.9 MB in the beginning and 142.0 MB in the end (delta: -35.1 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,786 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:53:06,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.59 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,788 INFO L168 Benchmark]: Boogie Preprocessor took 24.68 ms. Allocated memory is still 140.5 MB. Free memory was 105.0 MB in the beginning and 103.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,789 INFO L168 Benchmark]: RCFGBuilder took 274.52 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 95.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,790 INFO L168 Benchmark]: TraceAbstraction took 4480.98 ms. Allocated memory was 140.5 MB in the beginning and 259.5 MB in the end (delta: 119.0 MB). Free memory was 95.4 MB in the beginning and 142.0 MB in the end (delta: -46.7 MB). Peak memory consumption was 72.4 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,795 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.22 ms. Allocated memory is still 140.5 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.59 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.68 ms. Allocated memory is still 140.5 MB. Free memory was 105.0 MB in the beginning and 103.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 274.52 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 95.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4480.98 ms. Allocated memory was 140.5 MB in the beginning and 259.5 MB in the end (delta: 119.0 MB). Free memory was 95.4 MB in the beginning and 142.0 MB in the end (delta: -46.7 MB). Peak memory consumption was 72.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((4 < j && j < 6) && i <= 999) && a[5] <= 1000) || i <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 38 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 19 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 52 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 5 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 22/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...