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/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:24:46,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:24:46,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:24:46,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:24:46,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:24:46,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:24:46,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:24:46,625 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:24:46,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:24:46,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:24:46,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:24:46,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:24:46,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:24:46,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:24:46,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:24:46,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:24:46,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:24:46,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:24:46,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:24:46,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:24:46,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:24:46,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:24:46,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:24:46,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:24:46,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:24:46,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:24:46,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:24:46,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:24:46,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:24:46,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:24:46,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:24:46,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:24:46,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:24:46,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:24:46,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:24:46,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:24:46,651 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-02-15 11:24:46,663 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:24:46,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:24:46,664 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:24:46,664 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:24:46,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:24:46,666 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:24:46,666 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:24:46,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:24:46,667 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:24:46,667 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:24:46,667 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:24:46,667 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:24:46,667 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:24:46,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:24:46,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:24:46,668 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:24:46,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:24:46,669 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:24:46,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:24:46,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:24:46,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:24:46,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:24:46,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:24:46,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:24:46,670 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:24:46,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:24:46,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:24:46,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:24:46,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:24:46,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:24:46,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:24:46,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:24:46,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:24:46,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:24:46,672 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:24:46,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:24:46,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:24:46,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:24:46,673 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:24:46,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:24:46,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:24:46,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:24:46,720 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:24:46,721 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:24:46,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-02-15 11:24:46,722 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-02-15 11:24:46,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:24:46,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:24:46,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:24:46,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:24:46,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:24:46,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:24:46,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:24:46,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:24:46,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:24:46,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/1) ... [2019-02-15 11:24:46,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:24:46,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:24:46,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:24:46,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:24:46,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (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-02-15 11:24:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:24:46,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:24:47,196 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:24:47,196 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-15 11:24:47,198 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:47 BoogieIcfgContainer [2019-02-15 11:24:47,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:24:47,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:24:47,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:24:47,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:24:47,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:24:46" (1/2) ... [2019-02-15 11:24:47,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d34652e and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:24:47, skipping insertion in model container [2019-02-15 11:24:47,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:24:47" (2/2) ... [2019-02-15 11:24:47,206 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-02-15 11:24:47,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:24:47,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-15 11:24:47,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-15 11:24:47,272 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:24:47,272 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:24:47,272 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:24:47,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:24:47,273 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:24:47,273 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:24:47,273 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:24:47,273 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:24:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-15 11:24:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 11:24:47,295 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:47,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 11:24:47,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-15 11:24:47,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:47,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:47,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:47,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:24:47,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:24:47,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:47,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:24:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:24:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:47,515 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-15 11:24:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:47,744 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-15 11:24:47,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:24:47,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 11:24:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:47,759 INFO L225 Difference]: With dead ends: 21 [2019-02-15 11:24:47,759 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:24:47,762 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-02-15 11:24:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:24:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-15 11:24:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 11:24:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-15 11:24:47,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-15 11:24:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:47,800 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-15 11:24:47,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:24:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-15 11:24:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:47,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:47,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:47,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-15 11:24:47,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:47,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:47,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:47,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:47,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:47,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:47,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:47,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:24:47,922 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-15 11:24:47,975 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:47,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:51,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:24:51,807 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:24:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:51,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:24:51,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:51,814 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-02-15 11:24:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:51,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:51,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:52,040 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 11:24:52,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:24:52,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:24:52,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:24:52,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:24:52,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:52,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:52,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:52,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:52,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:24:52,973 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 11:24:52,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:52,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:24:53,174 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-15 11:24:53,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:53,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:53,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:53,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:24:53,220 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:53,239 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:53,251 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:53,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:53,291 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:24:53,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:53,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:24:53,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:53,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:53,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:24:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:53,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:24:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:24:53,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:24:53,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:24:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:24:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:24:53,772 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-15 11:24:53,988 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-02-15 11:24:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:54,325 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-15 11:24:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:24:54,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:24:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:54,328 INFO L225 Difference]: With dead ends: 31 [2019-02-15 11:24:54,328 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 11:24:54,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:24:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 11:24:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-15 11:24:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:24:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-15 11:24:54,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-15 11:24:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:54,335 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-15 11:24:54,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:24:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-15 11:24:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:54,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:54,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:54,336 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-15 11:24:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:54,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:24:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:24:54,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:54,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:24:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:24:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:24:54,410 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-15 11:24:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:54,452 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-15 11:24:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:24:54,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:24:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:54,454 INFO L225 Difference]: With dead ends: 15 [2019-02-15 11:24:54,454 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 11:24:54,455 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-02-15 11:24:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 11:24:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-15 11:24:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 11:24:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-15 11:24:54,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-15 11:24:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:54,460 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-15 11:24:54,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:24:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-15 11:24:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:54,461 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:54,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:54,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-15 11:24:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:54,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:54,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:54,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:54,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:24:54,509 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-15 11:24:54,512 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:54,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:54,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:24:54,775 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:24:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:54,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:24:54,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:54,776 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-02-15 11:24:54,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:54,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:54,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:54,950 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-02-15 11:24:54,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:24:54,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:24:55,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:24:55,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:24:55,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,198 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 11:24:55,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 11:24:55,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:55,417 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-02-15 11:24:55,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:24:55,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:55,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:55,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 11:24:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:55,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:55,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:24:55,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 11:24:55,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:55,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:24:55,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:24:55,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:24:55,505 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-15 11:24:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:55,610 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-15 11:24:55,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:24:55,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:24:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:55,612 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:24:55,612 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:24:55,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:24:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:24:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 11:24:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:24:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-15 11:24:55,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-15 11:24:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:55,619 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-15 11:24:55,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:24:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-15 11:24:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:24:55,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:55,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:24:55,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-15 11:24:55,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:55,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:55,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:55,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:55,678 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:24:55,678 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-15 11:24:55,680 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:55,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:55,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:24:55,901 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:24:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:55,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:24:55,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:55,902 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-02-15 11:24:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:55,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:55,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:55,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 11:24:56,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:56,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:56,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 11:24:56,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:24:56,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:24:56,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:24:56,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:24:56,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:56,245 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-15 11:24:56,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:56,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:24:56,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:56,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:56,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 11:24:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:56,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:56,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:24:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:24:56,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:24:56,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:24:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:24:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:24:56,346 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-15 11:24:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:56,478 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-15 11:24:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:24:56,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:24:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:56,480 INFO L225 Difference]: With dead ends: 32 [2019-02-15 11:24:56,480 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 11:24:56,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:24:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 11:24:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-15 11:24:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:24:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-15 11:24:56,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-15 11:24:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:56,486 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-15 11:24:56,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:24:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-15 11:24:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:24:56,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:56,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:24:56,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-15 11:24:56,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:56,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:56,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:56,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:56,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:56,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:56,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:24:56,579 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-15 11:24:56,582 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:56,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:58,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:24:58,882 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:24:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:58,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:24:58,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:58,883 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-02-15 11:24:58,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:58,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:58,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:58,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:24:58,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:58,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:58,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:24:59,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:59,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:59,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:59,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:59,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:24:59,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:24:59,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:24:59,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:24:59,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:24:59,087 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:59,165 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:24:59,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:24:59,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:24:59,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:59,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:24:59,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:24:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:59,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:24:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:24:59,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:24:59,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:24:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:24:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:24:59,255 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-15 11:24:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:59,321 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-15 11:24:59,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:24:59,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:24:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:59,322 INFO L225 Difference]: With dead ends: 22 [2019-02-15 11:24:59,322 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 11:24:59,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:24:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 11:24:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-15 11:24:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:24:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-15 11:24:59,329 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-15 11:24:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:59,329 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-15 11:24:59,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:24:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-15 11:24:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:24:59,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:59,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:24:59,330 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:59,330 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-15 11:24:59,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:59,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:59,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:59,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:59,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:59,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:59,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:59,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:24:59,385 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-15 11:24:59,387 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:24:59,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:24:59,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:24:59,946 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:24:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:59,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:24:59,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:59,947 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-02-15 11:24:59,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:59,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:59,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:00,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:00,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:00,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:00,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:00,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:00,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:00,204 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:00,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:00,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:00,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:00,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:00,276 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:00,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 11:25:00,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:00,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:00,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-15 11:25:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:00,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:00,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:00,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:00,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:00,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:00,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:00,374 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-15 11:25:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:00,739 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-15 11:25:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:00,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:00,741 INFO L225 Difference]: With dead ends: 37 [2019-02-15 11:25:00,741 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 11:25:00,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 11:25:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-15 11:25:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:25:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-15 11:25:00,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-15 11:25:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:00,749 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-15 11:25:00,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-15 11:25:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:00,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:00,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:00,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:00,751 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-15 11:25:00,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:00,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:00,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:00,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:00,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:00,833 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:00,833 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-15 11:25:00,835 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:00,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:01,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:01,476 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:01,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:01,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:01,477 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:01,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:01,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:01,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:01,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:01,642 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:01,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:01,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:01,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:01,778 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,794 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,806 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:01,853 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:01,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:01,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:01,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:01,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:01,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:01,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:01,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:02,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:02,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:02,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:02,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:02,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:02,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:02,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:02,153 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-15 11:25:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:02,567 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-02-15 11:25:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:02,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:02,569 INFO L225 Difference]: With dead ends: 46 [2019-02-15 11:25:02,569 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 11:25:02,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 11:25:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-15 11:25:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 11:25:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-15 11:25:02,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-15 11:25:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:02,587 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-15 11:25:02,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-15 11:25:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:02,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:02,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:02,588 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:02,589 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-15 11:25:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:02,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:02,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:02,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:02,732 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:02,732 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-15 11:25:02,734 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:02,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:03,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:03,271 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:03,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:03,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:03,271 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:03,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:03,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:03,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:03,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:03,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:03,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:03,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:03,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:03,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:03,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:03,502 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,520 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:03,540 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:03,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:03,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:03,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:03,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:03,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:03,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:03,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:03,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:03,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:03,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:03,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:03,691 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-15 11:25:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:03,878 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-02-15 11:25:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:03,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:03,881 INFO L225 Difference]: With dead ends: 52 [2019-02-15 11:25:03,881 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 11:25:03,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 11:25:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-02-15 11:25:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:25:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-02-15 11:25:03,890 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-02-15 11:25:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:03,891 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-02-15 11:25:03,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-02-15 11:25:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:03,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:03,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:03,892 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-15 11:25:03,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:03,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:03,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:03,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:03,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:03,952 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:03,952 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-15 11:25:03,954 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:03,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:04,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:04,133 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:04,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:04,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:04,134 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:04,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:04,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:04,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:04,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:04,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 11:25:04,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:04,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:04,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 11:25:04,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:04,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:04,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:04,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:25:04,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,253 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:04,285 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-15 11:25:04,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:04,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:25:04,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:04,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:04,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:04,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:04,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:04,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:04,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:04,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:04,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:04,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:04,415 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-02-15 11:25:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:04,600 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-02-15 11:25:04,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:04,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:25:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:04,602 INFO L225 Difference]: With dead ends: 36 [2019-02-15 11:25:04,602 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 11:25:04,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 11:25:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-02-15 11:25:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 11:25:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-02-15 11:25:04,610 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-02-15 11:25:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:04,610 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-02-15 11:25:04,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-02-15 11:25:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:04,611 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:04,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:04,611 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-15 11:25:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:04,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:04,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:04,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:04,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:04,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:04,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:04,687 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-15 11:25:04,688 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:04,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:04,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:04,930 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:04,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:04,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:04,931 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:04,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:04,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:04,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:04,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:04,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:04,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:05,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:05,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:05,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:05,155 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,163 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:05,193 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:05,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:05,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:05,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:05,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:05,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:05,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:05,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:05,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:05,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:05,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:05,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:05,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:05,376 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-02-15 11:25:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:05,742 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-02-15 11:25:05,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:05,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:25:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:05,744 INFO L225 Difference]: With dead ends: 52 [2019-02-15 11:25:05,744 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 11:25:05,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 11:25:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-02-15 11:25:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 11:25:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-02-15 11:25:05,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-02-15 11:25:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:05,754 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-02-15 11:25:05,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-02-15 11:25:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:25:05,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:05,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:25:05,755 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-15 11:25:05,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:05,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:05,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:05,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:05,790 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:25:05,790 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-15 11:25:05,790 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:05,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:05,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:05,938 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:25:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:05,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:05,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:05,938 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:05,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:05,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:05,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:05,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:05,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:05,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-15 11:25:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:05,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-15 11:25:05,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:06,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:06,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:06,245 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,254 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:06,280 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-02-15 11:25:06,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-02-15 11:25:06,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:06,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-15 11:25:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:06,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:25:06,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:06,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:25:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:25:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:25:06,509 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-02-15 11:25:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:06,650 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-02-15 11:25:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:06,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:25:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:06,651 INFO L225 Difference]: With dead ends: 39 [2019-02-15 11:25:06,652 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 11:25:06,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:25:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 11:25:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-02-15 11:25:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 11:25:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-15 11:25:06,660 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-02-15 11:25:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:06,661 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-15 11:25:06,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:25:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-15 11:25:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:06,661 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:06,662 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 11:25:06,662 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-02-15 11:25:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:06,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:06,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:06,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:06,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:06,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:06,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:06,738 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:06,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:06,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:06,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:06,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:06,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:06,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:06,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:06,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:06,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:06,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:06,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:06,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:06,937 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,951 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,967 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:06,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:06,987 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:07,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:07,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:07,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:07,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 11:25:07,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:07,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-02-15 11:25:07,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:07,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:07,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:07,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:07,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:25:07,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:25:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:25:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:07,189 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-02-15 11:25:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:07,573 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-02-15 11:25:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:07,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 11:25:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:07,575 INFO L225 Difference]: With dead ends: 65 [2019-02-15 11:25:07,575 INFO L226 Difference]: Without dead ends: 60 [2019-02-15 11:25:07,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-15 11:25:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-02-15 11:25:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:25:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-15 11:25:07,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-15 11:25:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:07,587 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-15 11:25:07,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:25:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-15 11:25:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:07,588 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:07,588 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 11:25:07,588 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-02-15 11:25:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:07,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:07,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:07,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:07,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:07,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:07,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:07,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:07,700 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:07,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:07,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:07,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:07,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:07,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:07,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:07,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:07,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:07,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:07,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:07,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:07,903 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,922 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,935 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:07,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:07,962 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:07,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:07,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:07,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:08,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:08,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 11:25:08,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:08,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:08,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-15 11:25:08,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:08,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:08,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:08,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:08,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:08,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:08,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:08,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-15 11:25:08,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:08,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:25:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:25:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:08,316 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-02-15 11:25:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:08,703 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-02-15 11:25:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:08,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 11:25:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:08,704 INFO L225 Difference]: With dead ends: 53 [2019-02-15 11:25:08,705 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 11:25:08,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 11:25:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-02-15 11:25:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:25:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-15 11:25:08,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-15 11:25:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:08,716 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-15 11:25:08,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:25:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-15 11:25:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:08,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:08,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:08,717 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-15 11:25:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:08,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:08,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:08,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:08,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:08,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:08,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:08,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:08,773 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-15 11:25:08,774 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:08,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:09,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:09,344 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:09,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:09,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:09,344 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:09,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:09,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:09,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:09,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:09,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:09,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:09,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:09,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:09,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:09,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:09,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,525 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:09,551 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:09,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:09,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:09,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:09,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:09,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:09,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:09,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:09,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:09,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:09,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:09,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:09,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:09,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:09,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:09,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:09,715 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-02-15 11:25:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:09,968 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-02-15 11:25:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:09,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:09,970 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:25:09,970 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:25:09,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:25:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-02-15 11:25:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 11:25:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-02-15 11:25:09,982 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-02-15 11:25:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:09,982 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-02-15 11:25:09,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-02-15 11:25:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:09,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:09,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:09,984 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-02-15 11:25:09,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:09,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:09,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:09,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:09,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:10,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:10,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:10,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:10,109 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-15 11:25:10,111 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:10,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:10,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:10,858 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:10,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:10,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:10,858 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:10,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:10,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:10,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:10,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:10,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:10,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:10,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:10,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:10,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:25:10,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:10,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:10,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 11:25:11,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 11:25:11,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:11,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:11,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:11,022 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-15 11:25:11,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,196 INFO L303 Elim1Store]: Index analysis took 160 ms [2019-02-15 11:25:11,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:11,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:25:11,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-02-15 11:25:11,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:124 [2019-02-15 11:25:11,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,457 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:11,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-15 11:25:11,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:11,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,515 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:11,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-02-15 11:25:11,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:11,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:11,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2019-02-15 11:25:11,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:11,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-02-15 11:25:11,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:61 [2019-02-15 11:25:12,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,031 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:12,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-02-15 11:25:12,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:12,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-02-15 11:25:12,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:12,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:12,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2019-02-15 11:25:12,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:12,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-02-15 11:25:12,165 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-02-15 11:25:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:12,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:12,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:12,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-02-15 11:25:12,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:12,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:12,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:12,241 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-02-15 11:25:12,455 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 36 [2019-02-15 11:25:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:13,093 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-02-15 11:25:13,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:25:13,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:13,094 INFO L225 Difference]: With dead ends: 81 [2019-02-15 11:25:13,094 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 11:25:13,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:25:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 11:25:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-02-15 11:25:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 11:25:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-02-15 11:25:13,109 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-02-15 11:25:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-02-15 11:25:13,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-02-15 11:25:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:13,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:13,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:13,111 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-15 11:25:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:13,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:13,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:13,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:13,193 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:13,193 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-15 11:25:13,194 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:13,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:14,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:14,202 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:14,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:14,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:14,203 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:14,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:14,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:14,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:14,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:14,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:14,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:14,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:14,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:14,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:14,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:14,462 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,471 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,480 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,499 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:14,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:14,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,596 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:14,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 11:25:14,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:14,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:14,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-02-15 11:25:14,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:14,803 INFO L303 Elim1Store]: Index analysis took 169 ms [2019-02-15 11:25:14,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-15 11:25:14,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:15,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:15,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 11:25:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:15,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:25:16,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:16,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:16,136 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-02-15 11:25:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:16,571 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-15 11:25:16,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:16,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:16,573 INFO L225 Difference]: With dead ends: 66 [2019-02-15 11:25:16,573 INFO L226 Difference]: Without dead ends: 64 [2019-02-15 11:25:16,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:25:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-15 11:25:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-02-15 11:25:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:25:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-15 11:25:16,590 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-15 11:25:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:16,590 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-15 11:25:16,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-15 11:25:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:16,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:16,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:16,591 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-15 11:25:16,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:16,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:16,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:16,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:16,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:16,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:16,669 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-15 11:25:16,670 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:16,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:17,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:17,282 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:17,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:17,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:17,283 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:17,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:17,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:17,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:17,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:17,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:17,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:17,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:17,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-15 11:25:17,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-15 11:25:17,586 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:17,633 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 11:25:17,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:25:17,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:17,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:17,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:17,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:25:17,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:17,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:17,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-15 11:25:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:17,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:17,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:17,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:17,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:17,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:17,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:17,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:17,823 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-02-15 11:25:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:18,041 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-02-15 11:25:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:18,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:18,043 INFO L225 Difference]: With dead ends: 62 [2019-02-15 11:25:18,043 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:25:18,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:25:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-02-15 11:25:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:25:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-02-15 11:25:18,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-02-15 11:25:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:18,055 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-02-15 11:25:18,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-02-15 11:25:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:18,056 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:18,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:18,057 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-15 11:25:18,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:18,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:18,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:18,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:25:18,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:18,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:25:18,179 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-02-15 11:25:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:18,237 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-02-15 11:25:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:25:18,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:25:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:18,238 INFO L225 Difference]: With dead ends: 51 [2019-02-15 11:25:18,238 INFO L226 Difference]: Without dead ends: 46 [2019-02-15 11:25:18,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:25:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-15 11:25:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-02-15 11:25:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 11:25:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-02-15 11:25:18,254 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-02-15 11:25:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:18,254 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-02-15 11:25:18,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-02-15 11:25:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:18,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:18,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:18,255 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-02-15 11:25:18,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:18,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:18,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:18,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:18,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:18,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:18,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:18,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:18,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:18,356 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:18,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:18,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:18,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:18,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:18,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:18,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:18,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:18,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:18,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:18,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:18,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:18,555 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,564 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:18,628 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:18,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:18,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:18,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:18,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 11:25:18,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:18,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:18,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:18,758 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:18,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 11:25:18,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:18,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:18,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:25:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:18,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:18,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:18,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:18,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:18,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:18,894 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-02-15 11:25:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:19,630 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-02-15 11:25:19,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:19,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:25:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:19,632 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:25:19,632 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 11:25:19,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:25:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 11:25:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-02-15 11:25:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:25:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-02-15 11:25:19,653 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-02-15 11:25:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:19,653 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-02-15 11:25:19,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-02-15 11:25:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:19,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:19,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:19,654 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:19,654 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-15 11:25:19,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:19,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:19,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:19,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:19,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:19,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:19,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:19,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:19,752 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-15 11:25:19,753 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:19,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:20,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:20,067 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:20,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:20,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:20,068 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:20,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:20,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:20,233 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 11:25:20,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:20,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:20,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:20,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:20,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:20,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:20,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:20,420 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:20,458 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:20,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:20,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:20,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:20,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:20,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:20,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:20,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:20,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:20,686 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-15 11:25:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:20,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:20,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:20,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:20,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:20,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:20,746 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-02-15 11:25:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:20,921 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-02-15 11:25:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:20,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:20,924 INFO L225 Difference]: With dead ends: 66 [2019-02-15 11:25:20,924 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:25:20,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:25:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-02-15 11:25:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 11:25:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-02-15 11:25:20,952 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-02-15 11:25:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:20,952 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-02-15 11:25:20,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-02-15 11:25:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:20,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:20,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:20,953 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-15 11:25:20,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:20,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:20,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:20,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:21,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:21,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:21,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:25:21,021 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-15 11:25:21,023 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:21,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:21,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:21,353 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:21,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:21,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:21,354 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:21,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:21,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:21,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:21,535 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 11:25:21,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:21,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:21,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:21,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:21,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:21,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:21,649 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:21,698 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:21,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:21,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:21,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:21,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:21,975 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:21,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-15 11:25:21,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:21,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:21,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 11:25:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:22,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:25:22,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:22,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:25:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:25:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:22,052 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-02-15 11:25:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:22,283 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-02-15 11:25:22,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:22,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 11:25:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:22,287 INFO L225 Difference]: With dead ends: 63 [2019-02-15 11:25:22,287 INFO L226 Difference]: Without dead ends: 62 [2019-02-15 11:25:22,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-15 11:25:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-02-15 11:25:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 11:25:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-02-15 11:25:22,305 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-02-15 11:25:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:22,305 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-02-15 11:25:22,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:25:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-02-15 11:25:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:25:22,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:22,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:25:22,307 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-15 11:25:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:22,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:22,523 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-15 11:25:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:22,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:22,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:22,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:22,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:22,536 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:22,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:22,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:25:22,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:22,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:22,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:22,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:22,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:22,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:22,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:22,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:22,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:22,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,714 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,723 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:22,743 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:22,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:22,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:22,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:22,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:22,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:22,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:22,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:22,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:22,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:22,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:22,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:22,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:22,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:22,884 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-02-15 11:25:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:23,085 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-02-15 11:25:23,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:23,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:25:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:23,087 INFO L225 Difference]: With dead ends: 86 [2019-02-15 11:25:23,087 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:25:23,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:25:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-02-15 11:25:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:25:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-02-15 11:25:23,109 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-02-15 11:25:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:23,109 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-02-15 11:25:23,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-02-15 11:25:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:23,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:23,110 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 11:25:23,111 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-02-15 11:25:23,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:23,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:23,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:25:23,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:23,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:23,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:23,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:23,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:23,177 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:23,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:25:23,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:25:23,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:25:23,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:23,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:23,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:23,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:23,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:23,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:23,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:23,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:23,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:23,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,433 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:23,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:23,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:23,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 11:25:23,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-15 11:25:23,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:23,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:23,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:23,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:25:23,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:23,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:23,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:23,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:23,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:23,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-15 11:25:23,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:23,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:25:23,751 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-02-15 11:25:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:24,220 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-02-15 11:25:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:24,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:25:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:24,222 INFO L225 Difference]: With dead ends: 96 [2019-02-15 11:25:24,222 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 11:25:24,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 11:25:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-02-15 11:25:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 11:25:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-02-15 11:25:24,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-02-15 11:25:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:24,248 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-02-15 11:25:24,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-02-15 11:25:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:24,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:24,248 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:25:24,249 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:24,249 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-02-15 11:25:24,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:24,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:24,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:24,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:24,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:24,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:24,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:24,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:24,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:24,346 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:24,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:25:24,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:25:24,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:25:24,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:24,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:24,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:24,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:24,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:24,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:24,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:24,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:24,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:24,528 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,544 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,580 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:24,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:24,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:24,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-15 11:25:24,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-15 11:25:24,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:24,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:24,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:24,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 11:25:24,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:24,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:24,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 11:25:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:24,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:25,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:25,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:25:25,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:25,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:25:25,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:25:25,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:25,001 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-02-15 11:25:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:25,441 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-02-15 11:25:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:25,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:25:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:25,443 INFO L225 Difference]: With dead ends: 107 [2019-02-15 11:25:25,443 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 11:25:25,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 11:25:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-02-15 11:25:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 11:25:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-02-15 11:25:25,475 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-02-15 11:25:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:25,475 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-02-15 11:25:25,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:25:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-02-15 11:25:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:25,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:25,476 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:25:25,476 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-02-15 11:25:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:25,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:25,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:25,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:25,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:25,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:25,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:25,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:25,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:25,625 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:25,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:25,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:25,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:25,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:25,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:25,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:25,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:25,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:25,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:25,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:25,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,800 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:25,828 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:25,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:25,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:25,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:25,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:25,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:25,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:25,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:25:25,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:25,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:25,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:26,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:26,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 11:25:26,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:26,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:26,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 11:25:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:26,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:26,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:26,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:25:26,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:26,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:25:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:25:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:26,138 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-02-15 11:25:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:26,554 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-02-15 11:25:26,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:26,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:25:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:26,557 INFO L225 Difference]: With dead ends: 116 [2019-02-15 11:25:26,557 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 11:25:26,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 11:25:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-02-15 11:25:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:25:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-02-15 11:25:26,579 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-02-15 11:25:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:26,579 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-02-15 11:25:26,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:25:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-02-15 11:25:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:26,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:26,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:26,580 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-15 11:25:26,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:26,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:26,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:26,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:26,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:26,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:26,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:26,649 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:26,649 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-15 11:25:26,650 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:26,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:27,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:27,192 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:27,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:27,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:27,193 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:27,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:27,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:27,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:27,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:27,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:27,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:27,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:27,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:27,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:27,386 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,405 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:27,424 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:27,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:27,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:27,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:27,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:27,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:27,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:27,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:27,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:27,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:27,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:27,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:27,598 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-02-15 11:25:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:27,876 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-02-15 11:25:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:27,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:25:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:27,878 INFO L225 Difference]: With dead ends: 72 [2019-02-15 11:25:27,878 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:25:27,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:25:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-02-15 11:25:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:25:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-02-15 11:25:27,910 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-02-15 11:25:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:27,911 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-02-15 11:25:27,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-02-15 11:25:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:27,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:27,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:27,912 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-15 11:25:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:27,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:28,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:28,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:28,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:28,005 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-15 11:25:28,006 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:28,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:28,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:28,657 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:28,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:28,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:28,657 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:28,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:28,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:28,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:28,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:28,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:28,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:28,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:28,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:28,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:28,860 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,870 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,879 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:28,898 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:28,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:28,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:28,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:28,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:28,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:28,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:28,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:28,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:29,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,020 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:29,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:29,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:25:29,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:29,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:29,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:29,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:29,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:29,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:29,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:29,107 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-02-15 11:25:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:29,477 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-02-15 11:25:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:29,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:25:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:29,479 INFO L225 Difference]: With dead ends: 77 [2019-02-15 11:25:29,479 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 11:25:29,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 11:25:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-15 11:25:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 11:25:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-02-15 11:25:29,507 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-02-15 11:25:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:29,507 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-02-15 11:25:29,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-02-15 11:25:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:29,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:29,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:29,508 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-15 11:25:29,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:29,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:29,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:29,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:29,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:29,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:29,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:29,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:29,633 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-15 11:25:29,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:29,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:30,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:30,243 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:30,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:30,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:30,243 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:30,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:30,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:30,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:30,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:30,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:30,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:30,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:30,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:30,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:30,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:30,432 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,442 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,468 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:30,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:30,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:30,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:30,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:30,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:30,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:30,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:30,655 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:30,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:25:30,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:30,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:30,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:25:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:30,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:30,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:30,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:25:30,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:30,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:30,801 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-02-15 11:25:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:31,143 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-02-15 11:25:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:31,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:25:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:31,145 INFO L225 Difference]: With dead ends: 78 [2019-02-15 11:25:31,145 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:25:31,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:25:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:25:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-02-15 11:25:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:25:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-02-15 11:25:31,181 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-02-15 11:25:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:31,181 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-02-15 11:25:31,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-02-15 11:25:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:31,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:31,182 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:25:31,182 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-02-15 11:25:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:31,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:31,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:31,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:31,249 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:31,249 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-15 11:25:31,250 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:31,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:31,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:31,847 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:31,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:31,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:31,848 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:31,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:31,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:31,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:31,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:31,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:31,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:31,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:31,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:31,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:31,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:31,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:32,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:32,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,016 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,031 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,050 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:32,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:32,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:32,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:32,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:25:32,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:32,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:32,227 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:32,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:25:32,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:32,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:32,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:25:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:32,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:32,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:32,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:25:32,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:32,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:25:32,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:25:32,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:32,335 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-02-15 11:25:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:32,801 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-02-15 11:25:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:32,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:25:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:32,803 INFO L225 Difference]: With dead ends: 95 [2019-02-15 11:25:32,804 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 11:25:32,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 11:25:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-02-15 11:25:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 11:25:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-02-15 11:25:32,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-02-15 11:25:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:32,834 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-02-15 11:25:32,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:25:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-02-15 11:25:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:32,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:32,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:32,835 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-15 11:25:32,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:32,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:32,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:32,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:32,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:32,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:32,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:32,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:32,985 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-15 11:25:32,986 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:32,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:33,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:33,176 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:33,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:33,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:33,176 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:33,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:33,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:33,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:33,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:33,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:33,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:33,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:33,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:33,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:33,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:33,385 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:33,422 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:33,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:33,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:33,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:33,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:33,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:33,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:33,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:33,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:33,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:33,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 11:25:33,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:33,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:25:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:25:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:33,637 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-02-15 11:25:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:34,648 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-02-15 11:25:34,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:34,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:25:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:34,650 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:25:34,650 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 11:25:34,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 11:25:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-02-15 11:25:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-15 11:25:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-02-15 11:25:34,689 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-02-15 11:25:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:34,689 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-02-15 11:25:34,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:25:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-02-15 11:25:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:34,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:34,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:34,690 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:34,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:34,690 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-15 11:25:34,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:34,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:34,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:34,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:34,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:34,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:34,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:34,765 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-15 11:25:34,766 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:34,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:35,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:35,072 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:35,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:35,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:35,073 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:35,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:35,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:35,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:35,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:35,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:35,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:35,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:25:35,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 11:25:35,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 11:25:35,210 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,227 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-15 11:25:35,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:25:35,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,284 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:35,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 11:25:35,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-15 11:25:35,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:35,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:25:35,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:35,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:35,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-15 11:25:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:35,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:35,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:35,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:35,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:35,405 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-02-15 11:25:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:35,729 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-02-15 11:25:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:35,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:25:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:35,731 INFO L225 Difference]: With dead ends: 122 [2019-02-15 11:25:35,731 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 11:25:35,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 11:25:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-02-15 11:25:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 11:25:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-02-15 11:25:35,777 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-02-15 11:25:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:35,777 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-02-15 11:25:35,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-02-15 11:25:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:35,778 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:35,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:35,779 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-15 11:25:35,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:35,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:35,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:35,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:35,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:35,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:35,919 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-15 11:25:35,920 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:35,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:36,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:36,438 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:36,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:36,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:36,438 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:36,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:36,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:36,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:36,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:36,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:36,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:36,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:36,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:36,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-15 11:25:36,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-15 11:25:36,569 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,581 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,589 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,598 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:36,613 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 11:25:36,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:25:36,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:36,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:36,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:36,678 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:36,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-15 11:25:36,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:36,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:36,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-15 11:25:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:36,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:36,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:36,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:36,748 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-02-15 11:25:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:36,979 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-02-15 11:25:36,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:25:36,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:25:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:36,982 INFO L225 Difference]: With dead ends: 113 [2019-02-15 11:25:36,982 INFO L226 Difference]: Without dead ends: 108 [2019-02-15 11:25:36,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-15 11:25:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-02-15 11:25:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 11:25:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-02-15 11:25:37,040 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-02-15 11:25:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:37,041 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-02-15 11:25:37,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-02-15 11:25:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:37,042 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:37,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:37,042 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-15 11:25:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:37,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:37,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:37,358 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-15 11:25:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:37,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:37,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:37,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:37,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:37,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:37,671 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:37,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:37,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:37,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:37,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:37,894 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 11:25:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:37,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:38,084 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 11:25:38,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:38,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:38,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:38,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:38,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:38,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:38,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,198 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,235 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:38,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:38,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:38,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:38,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,347 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:38,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:38,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2019-02-15 11:25:38,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:38,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:38,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:25:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:38,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:38,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:38,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:25:38,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:38,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:25:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:25:38,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:38,440 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-02-15 11:25:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:38,883 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-02-15 11:25:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:38,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 11:25:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:38,885 INFO L225 Difference]: With dead ends: 137 [2019-02-15 11:25:38,885 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 11:25:38,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:25:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 11:25:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-15 11:25:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 11:25:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-02-15 11:25:38,935 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-02-15 11:25:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:38,935 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-02-15 11:25:38,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:25:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-02-15 11:25:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:38,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:38,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:38,936 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:38,936 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-15 11:25:38,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:38,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:38,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:39,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:39,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:39,033 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-15 11:25:39,034 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:39,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:39,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:39,499 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:39,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:39,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:39,500 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:39,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:39,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:39,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:39,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-15 11:25:39,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-15 11:25:39,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-02-15 11:25:39,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:39,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:39,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 11:25:39,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:25:39,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,607 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:39,633 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-02-15 11:25:39,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:39,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-15 11:25:39,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:39,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:25:39,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:39,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:39,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-15 11:25:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:39,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:39,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:25:39,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:39,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:39,893 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-02-15 11:25:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:40,098 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-02-15 11:25:40,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:25:40,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:25:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:40,100 INFO L225 Difference]: With dead ends: 110 [2019-02-15 11:25:40,100 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 11:25:40,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:25:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 11:25:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-02-15 11:25:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-15 11:25:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-02-15 11:25:40,150 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-02-15 11:25:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:40,150 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-02-15 11:25:40,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-02-15 11:25:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:40,151 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:40,151 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 11:25:40,151 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:40,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-02-15 11:25:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:40,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:40,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:40,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:40,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:40,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:40,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:40,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:40,249 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:40,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:40,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:40,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:40,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:40,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:40,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:40,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:40,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:40,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:40,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:40,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:40,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:40,417 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,433 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,452 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:40,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:40,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:40,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,564 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:40,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-15 11:25:40,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 11:25:40,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:40,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:25:40,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:40,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:40,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:40,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:40,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:40,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:25:40,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:40,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:25:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:25:40,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:25:40,744 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-02-15 11:25:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:41,175 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-02-15 11:25:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:41,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 11:25:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:41,178 INFO L225 Difference]: With dead ends: 124 [2019-02-15 11:25:41,178 INFO L226 Difference]: Without dead ends: 116 [2019-02-15 11:25:41,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-15 11:25:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-02-15 11:25:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 11:25:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-02-15 11:25:41,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-02-15 11:25:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:41,234 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-02-15 11:25:41,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:25:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-02-15 11:25:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:41,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:41,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:41,235 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:41,235 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-02-15 11:25:41,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:41,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:41,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:41,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:41,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:41,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:41,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:41,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:25:41,308 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-15 11:25:41,310 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:41,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:42,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:42,056 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:25:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:42,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:42,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:42,056 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:42,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:42,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:42,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:42,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:42,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:42,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:42,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:42,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:42,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:42,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:42,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,305 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,333 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:42,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:42,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:42,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:42,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:42,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:42,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:25:42,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,456 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:42,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-15 11:25:42,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:42,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:42,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:42,516 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:42,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 11:25:42,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:42,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:42,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:25:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:42,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:25:42,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:25:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:25:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:42,624 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-02-15 11:25:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:43,154 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-02-15 11:25:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:43,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:25:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:43,156 INFO L225 Difference]: With dead ends: 137 [2019-02-15 11:25:43,156 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 11:25:43,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:25:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 11:25:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-02-15 11:25:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 11:25:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-02-15 11:25:43,215 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-02-15 11:25:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:43,216 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-02-15 11:25:43,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:25:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-02-15 11:25:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:43,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:43,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:43,217 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-02-15 11:25:43,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:43,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:43,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:43,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:43,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:43,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:43,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:43,392 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:43,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:43,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:43,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:43,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:43,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:43,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:43,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:43,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:43,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:43,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:43,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:43,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:43,584 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,594 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,620 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:43,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:43,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:43,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:43,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,734 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:43,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:25:43,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:43,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-15 11:25:43,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:43,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:43,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-15 11:25:43,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,929 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:43,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:43,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:25:43,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:43,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:43,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-15 11:25:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:43,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:44,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:44,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:25:44,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:44,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:25:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:25:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:44,118 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-02-15 11:25:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:44,771 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-02-15 11:25:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:44,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:25:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:44,774 INFO L225 Difference]: With dead ends: 172 [2019-02-15 11:25:44,774 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 11:25:44,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 11:25:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-02-15 11:25:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-15 11:25:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-02-15 11:25:44,840 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-02-15 11:25:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:44,840 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-02-15 11:25:44,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:25:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-02-15 11:25:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:25:44,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:44,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:25:44,841 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:44,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-02-15 11:25:44,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:44,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:44,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:44,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:44,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:45,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:45,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:45,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:45,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:45,025 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:45,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:25:45,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:25:45,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:25:45,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:45,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:45,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:45,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:45,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:45,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:45,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:45,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:45,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:45,165 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,217 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:45,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:45,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:45,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,295 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:45,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:25:45,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-15 11:25:45,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-15 11:25:45,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-15 11:25:45,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:45,406 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:45,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-15 11:25:45,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:45,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:45,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-15 11:25:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:45,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:45,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:25:45,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:45,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:25:45,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:25:45,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:25:45,562 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-02-15 11:25:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:46,023 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-02-15 11:25:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:46,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:25:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:46,026 INFO L225 Difference]: With dead ends: 140 [2019-02-15 11:25:46,026 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 11:25:46,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:25:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 11:25:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-02-15 11:25:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 11:25:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-02-15 11:25:46,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-02-15 11:25:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:46,064 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-02-15 11:25:46,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:25:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-02-15 11:25:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:46,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:46,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:46,065 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:46,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-15 11:25:46,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:46,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:46,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:46,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:46,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:46,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:46,198 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-15 11:25:46,199 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:46,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:46,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:46,794 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:46,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:46,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:46,795 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:46,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:46,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:46,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:46,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:46,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:46,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:46,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:46,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:46,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:46,982 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:46,992 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,019 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:47,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:47,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:47,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:47,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:47,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,139 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:47,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:25:47,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:47,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:47,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-15 11:25:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:47,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:47,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:47,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:47,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:47,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:47,237 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-02-15 11:25:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:47,690 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-02-15 11:25:47,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:47,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:25:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:47,692 INFO L225 Difference]: With dead ends: 77 [2019-02-15 11:25:47,692 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 11:25:47,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 11:25:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-02-15 11:25:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 11:25:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-02-15 11:25:47,747 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-02-15 11:25:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:47,747 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-02-15 11:25:47,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-02-15 11:25:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:47,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:47,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:47,748 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-15 11:25:47,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:47,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:47,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:47,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:47,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:47,862 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-15 11:25:47,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:47,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:48,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:48,754 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:25:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:48,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:48,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:48,754 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:48,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:48,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:48,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:48,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:48,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:48,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:48,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:48,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:48,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:48,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:48,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:48,996 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,011 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,038 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:49,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:49,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:49,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:25:49,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:49,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,158 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:49,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:25:49,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:25:49,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,215 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:49,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:49,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:25:49,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:49,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:49,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-15 11:25:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:49,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:49,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:25:49,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:49,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:25:49,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:25:49,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:49,322 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-02-15 11:25:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:49,882 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-02-15 11:25:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:49,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:25:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:49,883 INFO L225 Difference]: With dead ends: 86 [2019-02-15 11:25:49,884 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:25:49,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:25:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:25:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-02-15 11:25:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 11:25:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-02-15 11:25:49,939 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-02-15 11:25:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:49,940 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-02-15 11:25:49,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:25:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-02-15 11:25:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:49,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:49,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:49,940 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-02-15 11:25:49,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:49,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:49,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:49,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:50,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:50,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:50,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:50,166 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-02-15 11:25:50,167 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:50,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:50,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:50,674 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:50,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:50,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:50,675 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:50,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:50,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:50,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:50,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:50,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:50,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 22 [2019-02-15 11:25:50,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-15 11:25:50,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:50,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-02-15 11:25:50,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-02-15 11:25:50,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:25:50,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 11:25:50,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-02-15 11:25:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-15 11:25:50,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:50,856 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:50,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-02-15 11:25:50,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:50,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:25:50,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-02-15 11:25:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:50,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:50,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:25:50,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-02-15 11:25:50,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:50,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:25:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:25:50,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:50,959 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-02-15 11:25:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:51,181 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-02-15 11:25:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:25:51,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 11:25:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:51,183 INFO L225 Difference]: With dead ends: 115 [2019-02-15 11:25:51,183 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 11:25:51,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:25:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 11:25:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-02-15 11:25:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 11:25:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-02-15 11:25:51,291 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-02-15 11:25:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:51,291 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-02-15 11:25:51,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:25:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-02-15 11:25:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:51,292 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:51,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:51,292 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:51,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-15 11:25:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:51,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:51,691 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-02-15 11:25:51,865 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:25:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:51,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:51,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:51,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:51,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:51,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:51,897 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:51,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:51,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:51,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:51,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:51,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:51,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:51,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:51,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:51,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:51,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:51,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:52,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:52,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:52,062 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,072 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,100 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:52,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:25:52,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:52,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,249 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:52,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-15 11:25:52,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:52,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-15 11:25:52,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-15 11:25:52,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:52,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:25:52,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:52,345 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:52,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-15 11:25:52,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:52,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:52,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:25:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:52,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:52,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:25:52,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:52,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:25:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:25:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:52,458 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-02-15 11:25:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:53,055 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-02-15 11:25:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:25:53,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:25:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:53,057 INFO L225 Difference]: With dead ends: 104 [2019-02-15 11:25:53,057 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:25:53,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:25:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:25:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-02-15 11:25:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:25:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-02-15 11:25:53,159 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-02-15 11:25:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:53,159 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-02-15 11:25:53,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:25:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-02-15 11:25:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:53,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:53,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:53,160 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:53,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-02-15 11:25:53,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:53,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:53,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:53,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:53,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:53,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:53,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:53,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:53,273 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-15 11:25:53,274 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:53,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:53,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:53,875 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:53,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:53,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:53,875 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:53,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:53,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:53,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:53,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:53,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-15 11:25:53,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:53,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-15 11:25:53,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:53,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:54,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:54,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:54,099 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:54,145 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 11:25:54,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 11:25:54,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:54,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:54,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:25:54,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:54,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-15 11:25:54,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,304 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:54,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:54,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-15 11:25:54,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:54,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:54,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-02-15 11:25:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:54,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:54,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:54,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:25:54,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:54,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:54,424 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-02-15 11:25:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:54,825 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-02-15 11:25:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:54,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:25:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:54,827 INFO L225 Difference]: With dead ends: 68 [2019-02-15 11:25:54,827 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:25:54,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:25:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-02-15 11:25:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 11:25:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-02-15 11:25:54,938 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-02-15 11:25:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:54,938 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-02-15 11:25:54,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-02-15 11:25:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:54,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:54,939 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:25:54,939 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:54,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-02-15 11:25:54,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:54,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:54,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:54,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:54,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:25:54,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:54,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:25:54,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:25:54,977 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-02-15 11:25:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:55,103 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-02-15 11:25:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:55,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 11:25:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:55,104 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:25:55,105 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 11:25:55,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:25:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 11:25:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-15 11:25:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 11:25:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-02-15 11:25:55,264 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-02-15 11:25:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:55,264 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-02-15 11:25:55,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:25:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-02-15 11:25:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:55,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:55,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:55,265 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-15 11:25:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:55,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:55,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:55,434 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:25:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:55,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:55,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:55,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:55,545 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-15 11:25:55,545 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:55,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:56,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:56,131 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:25:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:56,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:56,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:56,131 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:56,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:56,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:56,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:56,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:56,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:56,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:56,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:56,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:56,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:56,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:56,316 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,342 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,352 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:56,378 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:56,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:56,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:56,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,456 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:56,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-15 11:25:56,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:56,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:25:56,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:56,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:25:56,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:56,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:56,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-15 11:25:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:56,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:56,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:56,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:25:56,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:56,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:25:56,588 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-02-15 11:25:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:57,021 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-02-15 11:25:57,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:25:57,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:25:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:57,023 INFO L225 Difference]: With dead ends: 78 [2019-02-15 11:25:57,023 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:25:57,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:25:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:25:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-02-15 11:25:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:25:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-02-15 11:25:57,135 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-02-15 11:25:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:57,135 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-02-15 11:25:57,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-02-15 11:25:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:57,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:57,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:57,136 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-02-15 11:25:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:57,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:57,295 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2019-02-15 11:25:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:57,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:57,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:57,331 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:57,331 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-15 11:25:57,332 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:57,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:57,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:57,525 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:57,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:57,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:57,525 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:57,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:57,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:57,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:57,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:25:57,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:25:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:25:57,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:57,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:25:57,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:25:57,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:25:57,678 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,702 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,710 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:57,729 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:25:57,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:25:57,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:57,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:25:57,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:57,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:25:57,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:57,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:57,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-15 11:25:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:57,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:57,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:57,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:25:57,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:57,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:25:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:25:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:25:57,883 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-02-15 11:25:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:58,291 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-02-15 11:25:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:58,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:25:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:58,293 INFO L225 Difference]: With dead ends: 64 [2019-02-15 11:25:58,293 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 11:25:58,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 11:25:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-02-15 11:25:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 11:25:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-02-15 11:25:58,404 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-02-15 11:25:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:58,404 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-02-15 11:25:58,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:25:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-02-15 11:25:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:58,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:58,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:58,405 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-15 11:25:58,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:58,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:58,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:58,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:58,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:58,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:25:58,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:25:58,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:58,479 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:58,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:25:58,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:25:58,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:25:58,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:25:58,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:58,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:25:58,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:25:58,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:58,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:58,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:58,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-15 11:25:58,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-15 11:25:58,640 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,686 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-15 11:25:58,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:25:58,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 11:25:58,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-15 11:25:58,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-15 11:25:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:58,791 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:58,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-15 11:25:58,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:58,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:58,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-15 11:25:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:58,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:25:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:58,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:25:58,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:25:58,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:25:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:25:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:25:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:25:58,881 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-02-15 11:25:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:59,339 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-02-15 11:25:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:25:59,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:25:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:59,340 INFO L225 Difference]: With dead ends: 76 [2019-02-15 11:25:59,340 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:25:59,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:25:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:25:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-02-15 11:25:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 11:25:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-02-15 11:25:59,462 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-02-15 11:25:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:59,462 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-02-15 11:25:59,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:25:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-02-15 11:25:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:25:59,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:59,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:25:59,463 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-02-15 11:25:59,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:59,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:25:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:59,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:25:59,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:59,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:25:59,579 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-02-15 11:25:59,580 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:59,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:59,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:25:59,773 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:25:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:59,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:25:59,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:59,774 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:25:59,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:59,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:25:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:59,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:25:59,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-15 11:25:59,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-15 11:25:59,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-02-15 11:25:59,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:25:59,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:25:59,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-15 11:25:59,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:25:59,870 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,884 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,891 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:25:59,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:25:59,911 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-15 11:25:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:25:59,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:25:59,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:25:59,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-15 11:25:59,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:25:59,997 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:25:59,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:25:59,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:00,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-15 11:26:00,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:00,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:00,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-15 11:26:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:00,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-15 11:26:00,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:00,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:26:00,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:26:00,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:00,111 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-02-15 11:26:00,528 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-02-15 11:26:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:01,093 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-02-15 11:26:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:26:01,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:26:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:01,094 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:26:01,094 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:26:01,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:26:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:26:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-02-15 11:26:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 11:26:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-02-15 11:26:01,292 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-02-15 11:26:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:01,292 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-02-15 11:26:01,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:26:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-02-15 11:26:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:26:01,292 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:01,292 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:01,292 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-02-15 11:26:01,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:01,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:01,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:01,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:01,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:01,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:26:01,461 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-15 11:26:01,462 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:01,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:01,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:01,961 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:01,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:01,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:01,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:01,961 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:01,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:01,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:01,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:01,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:26:01,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:26:02,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:26:02,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:26:02,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:02,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:02,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:02,150 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:02,187 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-15 11:26:02,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:26:02,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:02,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:02,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:02,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:02,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:26:02,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:02,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-15 11:26:02,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:02,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:02,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:02,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:02,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:02,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:26:02,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:02,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:26:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:26:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:02,401 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-02-15 11:26:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:03,084 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-02-15 11:26:03,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:26:03,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-15 11:26:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:03,086 INFO L225 Difference]: With dead ends: 118 [2019-02-15 11:26:03,087 INFO L226 Difference]: Without dead ends: 106 [2019-02-15 11:26:03,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:26:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-15 11:26:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-02-15 11:26:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-15 11:26:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-02-15 11:26:03,317 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-02-15 11:26:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:03,317 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-02-15 11:26:03,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:26:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-02-15 11:26:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:26:03,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:03,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:03,318 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-02-15 11:26:03,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:03,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:03,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:03,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:03,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:03,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:03,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:03,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:26:03,485 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-15 11:26:03,486 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:03,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:04,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:04,182 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:26:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:04,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:04,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:04,182 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:04,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:04,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:04,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:26:04,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:26:04,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:26:04,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:26:04,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:04,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:04,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:04,429 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,446 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,491 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:26:04,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:26:04,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:04,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:04,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:26:04,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,728 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:04,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:26:04,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,780 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:04,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:04,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:26:04,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:04,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:04,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-15 11:26:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:04,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:04,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:04,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:26:04,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:04,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:26:04,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:26:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:04,890 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-02-15 11:26:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:05,769 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-02-15 11:26:05,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:26:05,770 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-15 11:26:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:05,772 INFO L225 Difference]: With dead ends: 124 [2019-02-15 11:26:05,772 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 11:26:05,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:26:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 11:26:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-02-15 11:26:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 11:26:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-02-15 11:26:06,090 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-02-15 11:26:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:06,090 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-02-15 11:26:06,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:26:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-02-15 11:26:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:26:06,091 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:06,091 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:06,091 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:06,092 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-02-15 11:26:06,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:06,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:06,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:06,223 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:26:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:26:06,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:06,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:06,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-15 11:26:06,361 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-02-15 11:26:06,362 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:06,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:06,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:06,555 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:06,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:06,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:06,556 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:06,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:06,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:06,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:06,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:26:06,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:26:06,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 22 [2019-02-15 11:26:06,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-15 11:26:06,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-15 11:26:06,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-15 11:26:06,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-02-15 11:26:06,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,681 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,686 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:06,700 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-15 11:26:06,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-15 11:26:06,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:06,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-15 11:26:06,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-15 11:26:06,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:06,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-15 11:26:06,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:06,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-02-15 11:26:06,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-15 11:26:06,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-15 11:26:06,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:06,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-02-15 11:26:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:06,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:07,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:07,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 11:26:07,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:07,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:26:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:26:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:07,003 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-02-15 11:26:07,278 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-02-15 11:26:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:07,755 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-02-15 11:26:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:07,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-15 11:26:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:07,756 INFO L225 Difference]: With dead ends: 87 [2019-02-15 11:26:07,756 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 11:26:07,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 11:26:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-02-15 11:26:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 11:26:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-02-15 11:26:08,071 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-02-15 11:26:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:08,071 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-02-15 11:26:08,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:26:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-02-15 11:26:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:26:08,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:08,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:08,072 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-02-15 11:26:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:08,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,228 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:26:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:26:08,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:08,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:08,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:08,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,309 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:08,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:26:08,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:26:08,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:26:08,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:08,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:08,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:26:08,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-15 11:26:08,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-15 11:26:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-15 11:26:08,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-15 11:26:08,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-15 11:26:08,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-15 11:26:08,464 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,472 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,481 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,498 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-02-15 11:26:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:26:08,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:08,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:08,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-02-15 11:26:08,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-15 11:26:08,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,709 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:08,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2019-02-15 11:26:08,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:08,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-02-15 11:26:08,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,789 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:08,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-02-15 11:26:08,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-02-15 11:26:08,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:08,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-02-15 11:26:08,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-15 11:26:08,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:08,946 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:08,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-15 11:26:08,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:08,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-15 11:26:08,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-02-15 11:26:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:09,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:09,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:09,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:26:09,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:09,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:26:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:26:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:26:09,090 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-02-15 11:26:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:10,421 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-02-15 11:26:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:26:10,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-15 11:26:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:10,423 INFO L225 Difference]: With dead ends: 186 [2019-02-15 11:26:10,423 INFO L226 Difference]: Without dead ends: 177 [2019-02-15 11:26:10,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:26:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-15 11:26:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-02-15 11:26:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 11:26:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-02-15 11:26:10,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-02-15 11:26:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:10,840 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-02-15 11:26:10,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:26:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-02-15 11:26:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:26:10,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:10,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:10,841 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-02-15 11:26:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:10,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:26:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 11:26:10,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:10,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:10,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:26:10,966 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-15 11:26:10,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:10,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:12,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:12,296 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:26:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:12,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:12,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:12,297 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:12,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:12,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:12,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:12,488 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 11:26:12,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:12,845 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 11:26:12,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:12,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:12,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:12,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:26:12,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:26:12,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:26:12,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:26:12,970 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:12,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,019 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-15 11:26:13,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 11:26:13,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:13,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 11:26:13,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-15 11:26:13,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,135 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:13,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:26:13,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:13,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2019-02-15 11:26:13,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-15 11:26:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:13,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:13,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:26:13,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:13,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:26:13,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:26:13,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:26:13,300 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-02-15 11:26:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:14,077 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-02-15 11:26:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:26:14,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-15 11:26:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:14,083 INFO L225 Difference]: With dead ends: 110 [2019-02-15 11:26:14,083 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 11:26:14,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:26:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 11:26:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-02-15 11:26:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:26:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-15 11:26:14,197 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-02-15 11:26:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:14,197 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-15 11:26:14,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:26:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-15 11:26:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:26:14,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:14,198 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:26:14,198 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-02-15 11:26:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:14,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-15 11:26:14,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:14,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:14,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:26:14,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:26:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:14,328 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:26:14,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:26:14,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:26:14,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:26:14,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:26:14,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:14,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-15 11:26:14,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-15 11:26:14,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-15 11:26:14,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-15 11:26:14,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-15 11:26:14,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-15 11:26:14,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-15 11:26:14,498 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,532 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,581 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-15 11:26:14,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-15 11:26:14,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:26:14,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:14,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-02-15 11:26:14,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,776 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:14,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-15 11:26:14,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-02-15 11:26:14,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,836 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:14,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-15 11:26:14,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-02-15 11:26:14,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:14,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-02-15 11:26:14,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:14,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:14,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-15 11:26:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:14,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:15,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:26:15,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:15,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:26:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:26:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:26:15,033 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-02-15 11:26:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:15,500 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-02-15 11:26:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:26:15,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 11:26:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:15,503 INFO L225 Difference]: With dead ends: 32 [2019-02-15 11:26:15,503 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 11:26:15,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:26:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 11:26:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 11:26:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 11:26:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 11:26:15,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-15 11:26:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:15,505 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 11:26:15,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:26:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 11:26:15,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 11:26:15,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 11:26:15,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:15,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:15,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:16,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:17,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:17,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:17,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:17,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:21,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:21,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:26,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 11:26:28,511 WARN L181 SmtUtils]: Spent 12.99 s on a formula simplification. DAG size of input: 1516 DAG size of output: 1068 [2019-02-15 11:26:41,995 WARN L181 SmtUtils]: Spent 13.47 s on a formula simplification. DAG size of input: 1007 DAG size of output: 76 [2019-02-15 11:26:41,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-15 11:26:41,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-15 11:26:41,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-15 11:26:41,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-02-15 11:26:41,998 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-02-15 11:26:41,998 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-15 11:26:41,999 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse9 (= 0 (select .cse17 ULTIMATE.start_main_p1))) (.cse6 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse10 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse4 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse7 1))) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p4))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) .cse4 .cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse6 (<= 0 .cse7)) (and (and .cse8 .cse9 (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1))) ULTIMATE.start_main_p3)) .cse10) (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0)) (and (<= .cse1 0) (let ((.cse12 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (or (and .cse0 .cse8 .cse9 .cse6 .cse10 (<= 1 (select .cse12 ULTIMATE.start_main_p3))) (and .cse5 (let ((.cse16 (select .cse12 ULTIMATE.start_main_p1))) (let ((.cse14 (and .cse8 (<= 1 .cse16) .cse0)) (.cse13 (<= 0 .cse3))) (or (and .cse13 (= 0 (select .cse12 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse14) (let ((.cse15 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (and .cse13 .cse14) .cse15) (and .cse13 .cse15 (= 0 .cse16) .cse4)))))))))))))) [2019-02-15 11:26:41,999 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-15 11:26:41,999 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-02-15 11:26:41,999 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-15 11:26:41,999 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-02-15 11:26:42,016 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:26:42 BoogieIcfgContainer [2019-02-15 11:26:42,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 11:26:42,016 INFO L168 Benchmark]: Toolchain (without parser) took 115259.34 ms. Allocated memory was 134.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 108.7 MB in the beginning and 486.8 MB in the end (delta: -378.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-02-15 11:26:42,017 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:26:42,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.08 ms. Allocated memory is still 134.7 MB. Free memory was 108.5 MB in the beginning and 106.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:26:42,018 INFO L168 Benchmark]: Boogie Preprocessor took 22.87 ms. Allocated memory is still 134.7 MB. Free memory was 106.3 MB in the beginning and 105.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:26:42,018 INFO L168 Benchmark]: RCFGBuilder took 361.30 ms. Allocated memory is still 134.7 MB. Free memory was 105.0 MB in the beginning and 94.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:26:42,018 INFO L168 Benchmark]: TraceAbstraction took 114816.99 ms. Allocated memory was 134.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 94.5 MB in the beginning and 486.8 MB in the end (delta: -392.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-02-15 11:26:42,020 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.21 ms. Allocated memory is still 134.7 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.08 ms. Allocated memory is still 134.7 MB. Free memory was 108.5 MB in the beginning and 106.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.87 ms. Allocated memory is still 134.7 MB. Free memory was 106.3 MB in the beginning and 105.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 361.30 ms. Allocated memory is still 134.7 MB. Free memory was 105.0 MB in the beginning and 94.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114816.99 ms. Allocated memory was 134.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 94.5 MB in the beginning and 486.8 MB in the end (delta: -392.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (#memory_int[p4] <= 0 && ((((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) || (!(p3 == p4) && ((((0 <= #memory_int[p3] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || ((0 <= #memory_int[p3] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || (((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)))))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 114.7s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 26.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 23.5s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 286 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4050516002 FormulaSimplificationTreeSizeReduction, 12.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39887995 FormulaSimplificationTreeSizeReductionInter, 13.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 34.9s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91527 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...